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/0803", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computer Software", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "name": [
            "K.U.Leuven-ESAT, K. Mercierlaan 94, B-3001\u00a0Heverlee, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vounckx", 
        "givenName": "Johan", 
        "id": "sg:person.011331673473.04", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011331673473.04"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "K.U.Leuven-ESAT, K. Mercierlaan 94, B-3001\u00a0Heverlee, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Deconinck", 
        "givenName": "G.", 
        "id": "sg:person.01022745130.75", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01022745130.75"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "K.U.Leuven-ESAT, K. Mercierlaan 94, B-3001\u00a0Heverlee, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lauwereins", 
        "givenName": "R.", 
        "id": "sg:person.015212207733.37", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015212207733.37"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/3-540-58426-9_141", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001612096", 
          "https://doi.org/10.1007/3-540-58426-9_141"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-58426-9_142", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031655689", 
          "https://doi.org/10.1007/3-540-58426-9_142"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-57981-8_151", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051752322", 
          "https://doi.org/10.1007/3-540-57981-8_151"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/12.2145", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061087492"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1995", 
    "datePublishedReg": "1995-01-01", 
    "description": "The reconfiguration approach presented in this paper provides a solution to the need for fault tolerance in large systems. The developed techniques all have a data complexity and an execution time complexity less than proportional to the number of nodes in the system. Hence the approach is extremely suited for massively parallel systems. The reconfiguration strategy consists of four different subtasks, repartitioning (each application must have sufficient working processors), loading of injured networks, remapping (to replace faulty processors by working ones) and deadlock-free fault tolerant compact routing.", 
    "editor": [
      {
        "familyName": "Hertzberger", 
        "givenName": "Bob", 
        "type": "Person"
      }, 
      {
        "familyName": "Serazzi", 
        "givenName": "Giuseppe", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0046655", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-59393-5", 
        "978-3-540-49242-9"
      ], 
      "name": "High-Performance Computing and Networking", 
      "type": "Book"
    }, 
    "name": "Reconfiguration of massively parallel systems", 
    "pagination": "372-377", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0046655"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "97baff35855c0a57c6fea25b2b80a0409c8d466963d2ce6b5fdd9f01a90bebc4"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1031850935"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0046655", 
      "https://app.dimensions.ai/details/publication/pub.1031850935"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T16:04", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8675_00000054.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/BFb0046655"
  }
]

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.

102 TRIPLES      23 PREDICATES      31 URIs      20 LITERALS      8 BLANK NODES