JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/17", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Psychology and Cognitive Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1701", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Psychology", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Tel-Aviv University", 
          "id": "http://www.grid.ac/institutes/grid.12136.37", 
          "name": [
            "Tel-Aviv University"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kaplan", 
        "givenName": "Eyal", 
        "id": "sg:person.016351357345.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016351357345.24"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Applied Math, Weizmann Institute of Science", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Department of Computer Science and Applied Math, Weizmann Institute of Science"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Naor", 
        "givenName": "Moni", 
        "id": "sg:person.07776170271.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Applied Math, Weizmann Institute of Science", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Department of Computer Science and Applied Math, Weizmann Institute of Science"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Reingold", 
        "givenName": "Omer", 
        "id": "sg:person.012547246003.78", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012547246003.78"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2005", 
    "datePublishedReg": "2005-01-01", 
    "description": "Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions, the size of previously constructed families of such permutations is far from optimal. This paper gives a new method for reducing the size of families given by previous constructions. Our method relies on pseudorandom generators for space-bounded computations. In fact, all we need is a generator, that produces \u201cpseudorandom walks\u201d on undirected graphs with a consistent labelling. One such generator is implied by Reingold\u2019s log-space algorithm for undirected connectivity\u00a0[21,22]. We obtain families of k-wise almost independent permutations, with an optimal description length, up to a constant factor. More precisely, if the distance from uniform for any k tuple should be at most \u03b4, then the size of the description of a permutation in the family is \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$O(kn +\\log \\frac 1 {\\delta})$\\end{document}.", 
    "editor": [
      {
        "familyName": "Chekuri", 
        "givenName": "Chandra", 
        "type": "Person"
      }, 
      {
        "familyName": "Jansen", 
        "givenName": "Klaus", 
        "type": "Person"
      }, 
      {
        "familyName": "Rolim", 
        "givenName": "Jos\u00e9 D. P.", 
        "type": "Person"
      }, 
      {
        "familyName": "Trevisan", 
        "givenName": "Luca", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11538462_30", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-28239-6", 
        "978-3-540-31874-3"
      ], 
      "name": "Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques", 
      "type": "Book"
    }, 
    "keywords": [
      "construction", 
      "amount of attention", 
      "attention", 
      "recent years", 
      "years", 
      "cases", 
      "independent functions", 
      "family", 
      "size of family", 
      "consistent labeling", 
      "labeling", 
      "factors", 
      "independent permutations", 
      "permutations", 
      "amount", 
      "function", 
      "size", 
      "paper", 
      "new method", 
      "method", 
      "generator", 
      "fact", 
      "pseudorandom", 
      "log-space algorithm", 
      "undirected connectivity", 
      "connectivity", 
      "length", 
      "constant factor", 
      "distance", 
      "uniform", 
      "description", 
      "wise independent functions", 
      "such permutations", 
      "previous constructions", 
      "pseudorandom generators", 
      "space-bounded computation", 
      "computation", 
      "undirected graph", 
      "graph", 
      "such generators", 
      "Reingold\u2019s log-space algorithm", 
      "algorithm", 
      "optimal description length", 
      "description length", 
      "tuples", 
      "wise independent permutations"
    ], 
    "name": "Derandomized Constructions of k-Wise (Almost) Independent Permutations", 
    "pagination": "354-365", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1037921863"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11538462_30"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11538462_30", 
      "https://app.dimensions.ai/details/publication/pub.1037921863"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:08", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_140.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11538462_30"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

138 TRIPLES      23 PREDICATES      72 URIs      65 LITERALS      7 BLANK NODES