{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_topology","feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","contains":"claims, sources, anecdotes, question_graph slice","slug":"what-is-voxel-graph","urls":{"read":"https://miscsubjects.com/api/articles/what-is-voxel-graph/topology"},"how_to_use":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/what-is-voxel-graph/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/what-is-voxel-graph/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"graph_topology","name":"Cross-article graph","what":"Merged claims/sources across condition+stack slugs for one question.","urls":{"read":"https://miscsubjects.com/api/articles/what-is-voxel-graph/graph-topology?question=..."}},{"id":"question_graph","name":"Question graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output).","urls":{"read":"https://miscsubjects.com/api/articles/what-is-voxel-graph/question-graph","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/what-is-voxel-graph/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","why":"Every feature is auditable collective intelligence","how":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/what-is-voxel-graph/topology"},"imessage":null,"router":null,"related":[{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"graph_topology","what":"Merged claims/sources across condition+stack slugs for one question."},{"id":"question_graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output)."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."}],"not_medical_advice":true},"slug":"what-is-voxel-graph","title":"What Is a Voxel Graph","register":"standard","tags":["oip","kimi-import","self-explaining","voxel","concepts","what-is-voxel-graph"],"updated_at":"2026-07-15T04:21:08.221Z","body_excerpt":"<!-- hierarchy:nav -->\n> **Path:** [OIP](https://miscsubjects.com/a/oip) › [Thinker Reference](https://miscsubjects.com/a/oip-thinker-reference) › [Protocol Concepts](https://miscsubjects.com/a/oip-protocol-concepts) › **What Is a Voxel Graph**\n>\n> **Shelf:** Protocol Concepts · **Traversal:** self-explaining · hierarchical · voxel-ready\n> **Machine root:** [OIP tree](https://miscsubjects.com/api/dispatch?map=1&format=markdown) · [Registry](https://miscsubjects.com/api/dispatch?registry=1)\n\n# What Is a Voxel Graph\n\n## §SELF — what-is-voxel-graph\n\n**What this page is:** A definition of the voxel graph, a typed node/edge graph used in OIP to represent concepts, objects, and their relationships.\n**What it explains:** What a voxel graph is, why it is called \"voxel,\" what properties it has, and how it is used to represent knowledge as a connected graph rather than as documents.\n**Why read it:** To understand how OIP represents knowledge — not as pages or files, but as a typed, traversable, three-dimensional graph of concepts and relationships.\n\n### What a Voxel Graph Is\n\nA voxel graph is a typed node/edge graph used in OIP to represent the topology of concepts, objects, and their relationships. The word \"voxel\" is short for \"volume element,\" in the same way that \"pixel\" is short for \"picture element.\" A voxel graph is a three-dimensional graph where nodes have types and edges have types. The three dimensions are: position (where a node is in the graph), type (what kind of thing the node is), and state (what the node knows or claims). Nodes can be concepts, objects, articles, claims, sources, thinkers, or any typed entity. Edges can be implements, references, contradicts, supports, derives-from, or any typed relationship.\n\n### Why It Matters\n\nMost knowledge systems store information as documents or records. A document has a location (a file path, a URL) and a boundary: it starts at the title and ends at the last paragraph. Relationships between documents are external to the documents themselves — they exist in indexes, link lists, or search engines. A voxel graph inverts this: the graph is the primary structure. A document (like this article) is a view into the graph, not a container. This means relationships are first-class: they are typed, traversable, and part of the same structure as the concepts they connect. The voxel graph is how OIP represents knowledge.\n\n### The Key Idea\n\nKnowledge is not a set of documents. Knowledge is a graph of typed concepts connected by typed relationships. In a voxel graph, every node and every edge has a type. There are no untyped connections. You can traverse from any node to any other by following edges. There is no hierarchy and no center: any node can connect to any other. The graph is rhizomatic (a structure that grows laterally with no central root or trunk). A key feature of the OIP voxel graph is that the philosophy plane (concepts, thinkers, theories) is wired directly to the protocol plane (implementations, objects, operations). For example: the concept node \"autopoiesis\" (a theory about self-producing systems) connects to the protocol node \"§SELF blocks\" (a structural element in OIP) via an \"implements\" edge. The connection means: OIP's §SELF block implements the concept of autopoiesis.\n\n### Properties of a Voxel Graph\n\n- **Typed.** Every node and every edge has a type. A node type might be concept, object, article, claim, source, or thinker. An edge type might be implements, references, contradicts, supports, or derives-from. You cannot have a connection without a type. This means the graph carries semantic information in its structure, not just in the content of its nodes.\n- **Traversable.** Any node can be reached from any other by following edges. There is no walled garden. If two concepts are related, there is a path between them. Traversal is the primary operation on a voxel graph: you start at a node and follow edges to discover what is connected and how.\n- **Rhizomatic.** There is","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[],"sources":[],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"slug":"what-is-voxel-graph","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"honesty":{"active_claims":0,"retracted_claims":0,"cut_claims":0,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":0,"claims_total":0,"sources":0,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}