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": "MIT, Cambridge, USA", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Microsoft Research, Cambridge, USA", 
            "MIT, Cambridge, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kalai", 
        "givenName": "Yael Tauman", 
        "id": "sg:person.015074540743.62", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015074540743.62"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Tel Aviv University, Tel Aviv, Israel", 
          "id": "http://www.grid.ac/institutes/grid.12136.37", 
          "name": [
            "Tel Aviv University, Tel Aviv, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Paneth", 
        "givenName": "Omer", 
        "id": "sg:person.014073524511.68", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014073524511.68"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "MIT, Cambridge, USA", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "MIT, Cambridge, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Yang", 
        "givenName": "Lisa", 
        "id": "sg:person.015330373527.13", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015330373527.13"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2020-08-10", 
    "datePublishedReg": "2020-08-10", 
    "description": "In this work, we construct an updatable and unambiguous delegation scheme based on the decisional assumption on bilinear groups introduced by Kalai, Paneth and Yang [STOC 2019]. Using this delegation scheme, we show PPAD-hardness (and hence the hardness of computing Nash equilibria) based on the quasi-polynomial hardness of this bilinear group assumption and any hard language that is decidable in quasi-polynomial time and polynomial space.The delegation scheme is for super-polynomial time deterministic computations and is publicly verifiable and non-interactive in the common reference string (CRS) model. It is updatable meaning that given a proof for the statement that a Turing machine reaches some configuration C in T steps, it is efficient to update it into a proof for the statement that the machine reaches the next configuration \\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}$$C'$$\\end{document} in \\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}$$T+1$$\\end{document} steps. It is unambiguous meaning that it is hard to find two different proofs for the same statement.", 
    "editor": [
      {
        "familyName": "Micciancio", 
        "givenName": "Daniele", 
        "type": "Person"
      }, 
      {
        "familyName": "Ristenpart", 
        "givenName": "Thomas", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-030-56877-1_23", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-030-56876-4", 
        "978-3-030-56877-1"
      ], 
      "name": "Advances in Cryptology \u2013 CRYPTO 2020", 
      "type": "Book"
    }, 
    "keywords": [
      "delegation scheme", 
      "PPAD hardness", 
      "quasi-polynomial hardness", 
      "common reference string model", 
      "bilinear groups", 
      "quasi-polynomial time", 
      "decisional assumption", 
      "Turing machines", 
      "unambiguous meaning", 
      "next configuration", 
      "deterministic computation", 
      "polynomial space", 
      "machine", 
      "hard languages", 
      "group assumptions", 
      "scheme", 
      "T steps", 
      "proof", 
      "computation", 
      "language", 
      "configuration C", 
      "delegation", 
      "step", 
      "Kalai", 
      "space", 
      "work", 
      "assumption", 
      "model", 
      "statements", 
      "different proof", 
      "configuration", 
      "meaning", 
      "same statement", 
      "string model", 
      "time", 
      "Yang", 
      "group", 
      "hardness", 
      "Paneth", 
      "unambiguous proof"
    ], 
    "name": "Delegation with Updatable Unambiguous Proofs and PPAD-Hardness", 
    "pagination": "652-673", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1130050081"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-030-56877-1_23"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-030-56877-1_23", 
      "https://app.dimensions.ai/details/publication/pub.1130050081"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:29", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_22.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-030-56877-1_23"
  }
]

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.

123 TRIPLES      23 PREDICATES      65 URIs      58 LITERALS      7 BLANK NODES