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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, U.S.A., e-mail: prahladh@mit.edu, US", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, U.S.A., e-mail: prahladh@mit.edu, US"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Harsha", 
        "givenName": "P.", 
        "id": "sg:person.012210720000.77", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012210720000.77"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, U.S.A., e-mail: madhu@mit.edu, http://theory.lcs.mit.edu/~madhu/, US", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, U.S.A., e-mail: madhu@mit.edu, http://theory.lcs.mit.edu/~madhu/, US"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Sudan", 
        "givenName": "M.", 
        "id": "sg:person.014663420265.17", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014663420265.17"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2000-12", 
    "datePublishedReg": "2000-12-01", 
    "description": "Abstract. Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In this paper we give a transformation with slightly-super-cubic blowup in proof size, with a low query complexity. Specifically, the verifier probes the proof in 16 bits and rejects every proof of a false assertion with probability arbitrarily close to 1/2, while accepting correct proofs of theorems with probability one. The proof is obtained by revisiting known constructions and improving numerous components therein. In the process we abstract a number of new modules that may be of use in other PCP constructions.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/pl00001606", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1136224", 
        "issn": [
          "1016-3328", 
          "1420-8954"
        ], 
        "name": "computational complexity", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "3", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "9"
      }
    ], 
    "keywords": [
      "query complexity", 
      "probability one", 
      "large polynomials", 
      "known constructions", 
      "correct proof", 
      "high query complexity", 
      "proof", 
      "low query complexity", 
      "PCP constructions", 
      "complexity", 
      "theorem", 
      "proof size", 
      "polynomials", 
      "blowup", 
      "checkable proofs", 
      "construction", 
      "probability", 
      "false assertions", 
      "new module", 
      "numerous components", 
      "transformation", 
      "one", 
      "size", 
      "number", 
      "verifier", 
      "bits", 
      "module", 
      "process", 
      "components", 
      "assertion", 
      "use", 
      "PCP", 
      "paper"
    ], 
    "name": "Small PCPs with low query complexity", 
    "pagination": "157-201", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1025900372"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/pl00001606"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/pl00001606", 
      "https://app.dimensions.ai/details/publication/pub.1025900372"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-20T07:21", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_318.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/pl00001606"
  }
]

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.

100 TRIPLES      21 PREDICATES      59 URIs      51 LITERALS      6 BLANK NODES