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/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0102", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Applied Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "AT&T Bell Laboratories, 07974, Murray Hill, NJ, U.S.A.", 
          "id": "http://www.grid.ac/institutes/grid.469490.6", 
          "name": [
            "AT&T Bell Laboratories, 07974, Murray Hill, NJ, U.S.A."
          ], 
          "type": "Organization"
        }, 
        "familyName": "Karmarkar", 
        "givenName": "N.", 
        "id": "sg:person.012767743421.72", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012767743421.72"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/bf02579273", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010850152", 
          "https://doi.org/10.1007/bf02579273"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1984-12", 
    "datePublishedReg": "1984-12-01", 
    "description": "We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input. The running-time of this algorithm is better than the ellipsoid algorithm by a factor ofO(n2.5). We prove that given a polytopeP and a strictly interior point a \u03b5P, there is a projective transformation of the space that mapsP, a toP\u2032, a\u2032 having the following property. The ratio of the radius of the smallest sphere with center a\u2032, containingP\u2032 to the radius of the largest sphere with center a\u2032 contained inP\u2032 isO(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial time.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/bf02579150", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136493", 
        "issn": [
          "0209-9683", 
          "1439-6912"
        ], 
        "name": "Combinatorica", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "4"
      }
    ], 
    "keywords": [
      "new polynomial time algorithm", 
      "polynomial time algorithm", 
      "linear programming", 
      "projective transformation", 
      "sequence of points", 
      "ellipsoid algorithm", 
      "number of variables", 
      "interior point", 
      "optimal solution", 
      "polynomial time", 
      "arithmetic operations", 
      "algorithm", 
      "small spheres", 
      "number of bits", 
      "worst case", 
      "large spheres", 
      "programming", 
      "converges", 
      "wheren", 
      "polytopeP", 
      "radius", 
      "bit number", 
      "optimization", 
      "sphere", 
      "space", 
      "point", 
      "solution", 
      "number", 
      "transformation", 
      "variables", 
      "properties", 
      "input", 
      "applications", 
      "operation", 
      "bits", 
      "cases", 
      "\u03b5p", 
      "time", 
      "center", 
      "sequence", 
      "ratio", 
      "factors"
    ], 
    "name": "A new polynomial-time algorithm for linear programming", 
    "pagination": "373-395", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1035950209"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf02579150"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf02579150", 
      "https://app.dimensions.ai/details/publication/pub.1035950209"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-08-04T16:49", 
    "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_169.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/bf02579150"
  }
]

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.

103 TRIPLES      21 PREDICATES      68 URIs      59 LITERALS      6 BLANK NODES