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": "School of Operations Research and Industrial Engineering, Cornell University, 14853, Ithaca, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.5386.8", 
          "name": [
            "School of Operations Research and Industrial Engineering, Cornell University, 14853, Ithaca, NY, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Renegar", 
        "givenName": "James", 
        "id": "sg:person.01221736460.09", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01221736460.09"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1988-01", 
    "datePublishedReg": "1988-01-01", 
    "description": "A new interior method for linear programming is presented and a polynomial time bound for it is proven. The proof is substantially different from those given for the ellipsoid algorithm and for Karmarkar's algorithm. Also, the algorithm is conceptually simpler than either of those algorithms.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/bf01580724", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1047630", 
        "issn": [
          "0025-5610", 
          "1436-4646"
        ], 
        "name": "Mathematical Programming", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1-3", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "40"
      }
    ], 
    "keywords": [
      "polynomial time algorithm", 
      "linear programming", 
      "polynomial time", 
      "algorithm", 
      "ellipsoid algorithm", 
      "programming", 
      "Karmarkar's algorithm", 
      "method", 
      "interior methods", 
      "proof", 
      "Newton method", 
      "time"
    ], 
    "name": "A polynomial-time algorithm, based on Newton's method, for linear programming", 
    "pagination": "59-93", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1028120387"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01580724"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01580724", 
      "https://app.dimensions.ai/details/publication/pub.1028120387"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-08-04T16:50", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/article/article_211.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/bf01580724"
  }
]

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.

69 TRIPLES      20 PREDICATES      37 URIs      29 LITERALS      6 BLANK NODES