{
  "canonicalUrl": "https://xn--mwe.com/glossary/line-oriented-graph/",
  "claimStatus": "VERIFIED PROJECT IMPLEMENTATION",
  "code": "K01-TERM-113",
  "correctionStatus": "CURRENT K05 RELEASE",
  "definition": "A deterministic text export in which each line encodes one graph edge with stable identifiers and controlled relation semantics.",
  "lastReviewed": "2026-08-16",
  "name": "Line-Oriented Graph",
  "not": "Compact serialization does not remove the need for vocabulary, node, and evidence validation.",
  "plain": "One graph connection per line for simple inspection and processing.",
  "relatedTermCodes": [
    "K01-TERM-043",
    "K01-TERM-047",
    "K01-TERM-054",
    "K01-TERM-089",
    "K01-TERM-097",
    "K01-TERM-098",
    "K01-TERM-099",
    "K01-TERM-100"
  ],
  "releaseId": "K12-2026-08-16",
  "researchCutoff": "2026-08-16",
  "slug": "line-oriented-graph",
  "sourceRevalidatedAt": "2026-08-15T23:00:00Z",
  "status": "VERIFIED PROJECT IMPLEMENTATION",
  "topic": "terminology-ontology",
  "type": "DefinedTerm"
}