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/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Lehrstuhl f\u00fcr Angewandte Mathematik II, Universit\u00e4t Augsburg, D-86135, Augsburg, Germany", 
          "id": "http://www.grid.ac/institutes/grid.7307.3", 
          "name": [
            "Lehrstuhl f\u00fcr Angewandte Mathematik II, Universit\u00e4t Augsburg, D-86135, Augsburg, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jungnickel", 
        "givenName": "Dieter", 
        "id": "sg:person.016273474670.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016273474670.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dipartimento di Matematica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, 2, Piazzale Aldo Moro, I-00185, Roma, Italy", 
          "id": "http://www.grid.ac/institutes/grid.7841.a", 
          "name": [
            "Dipartimento di Matematica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, 2, Piazzale Aldo Moro, I-00185, Roma, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "De Resmini", 
        "givenName": "Marialuisa J.", 
        "id": "sg:person.012712302064.14", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012712302064.14"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada", 
          "id": "http://www.grid.ac/institutes/grid.46078.3d", 
          "name": [
            "Dept. of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vanstone", 
        "givenName": "Scott A.", 
        "id": "sg:person.010344544767.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1996", 
    "datePublishedReg": "1996-01-01", 
    "description": "We consider the problem of embedding the even graphical code based on the complete graph on n vertices into a shortening of a Hamming code of length 2m - 1, where m = h(n) should be as small as possible. As it turns out, this problem is equivalent to the existence problem for optimal codes with minimum distance 5, and optimal embeddings can always be realized as graphical codes based on Kn. As a consequence, we are able to determine h(n) exactly for all n of the form 2k + 1 and to narrow down the possibilities in general to two or three conceivable values.", 
    "editor": [
      {
        "familyName": "Jungnickel", 
        "givenName": "Dieter", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-1-4613-1395-3_11", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-1-4612-8604-2", 
        "978-1-4613-1395-3"
      ], 
      "name": "Designs and Finite Geometries", 
      "type": "Book"
    }, 
    "keywords": [
      "graphical codes", 
      "Hamming code", 
      "optimal codes", 
      "optimal embedding", 
      "code", 
      "complete graph", 
      "graph", 
      "embedding", 
      "existence problem", 
      "vertices", 
      "form 2k", 
      "minimum distance 5", 
      "conceivable values", 
      "distance 5", 
      "possibility", 
      "values", 
      "length", 
      "consequences", 
      "Kn", 
      "problem", 
      "shortening"
    ], 
    "name": "Codes Based on Complete Graphs", 
    "pagination": "159-165", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1021658850"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-1-4613-1395-3_11"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-1-4613-1395-3_11", 
      "https://app.dimensions.ai/details/publication/pub.1021658850"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:31", 
    "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_297.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-1-4613-1395-3_11"
  }
]

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.

101 TRIPLES      23 PREDICATES      47 URIs      40 LITERALS      7 BLANK NODES