Object Invocation Protocol · protocol specification

Node C16: Branching / Optimal Transport

Posted Jul 4, 2026 · Updated Jul 17, 2026 · 2 min read

C16 — Branching / Optimal Transport { "id": "C16", "claim": "The solution to connecting one source to many sinks with minimum transport cost converges on hierarchical branching networks; these networks follow scaling laws (Murray's Law, constructal scaling) across 22 orders of magnitude.", "domain": ["physiology", "geomorphology", "neuroscience", "mycology", "meteorology", "engineering"], "pattern": ["branching", "optimal_transport", "Murray_Law", "constructal_law", "space_filling"], "mechanism": "Murray's Law: for minimum viscous energy dissipation in a bifurcating network, r_0^3 = r_1^3 + r_2^3 (cube of parent radius equals sum of cubes of daughter radii). Bejan's constructal law: flow systems evolve to provide easier access to currents. Horton's laws: stream number and length decrease geometrically with stream order.", "scale": "10^-6 m (capillaries) → 10^6 m (river deltas) — 12 orders", "claim_tier": "T1", "sources": [ "Murray, C.D. (1926). 'The Physiological Principle of Minimum Work.' Proc. Natl. Acad. Sci. USA, 12(3), 207-214.", "Horton, R.E. (1945). 'Erosional Development of Streams and Their Drainage Basins.' Geol. Soc. Am. Bull., 56, 275-370.", "Bejan, A. (1996). 'Street Network Theory of Organization in Nature.' J. Adv. Transp., 30(1), 85-107.", "West, G.B., Brown, J.H. & Enquist, B.J. (1997). 'A General Model for the Origin of Allometric Scaling Laws in Biology.' Science, 276, 122-126." ], "dual": "Uniform perfusion (no hierarchy) — a system where every point is equally close to the source, no branching advantage.", "falsifier": "A branching transport network (biological, geological, or engineered) that violates Murray's Law or constructal scaling predictions under controlled measurement, with no compensatory advantage.", "rival_frame": "Branching is geometric necessity under flow constraints, not evidence of a deep 'grain.' Any gradient-driven flow through a volume must branch to access all points; the scaling emerges from dimensionality and conservation laws, not from optimization. The 'constructal law' is a restatement of the obvious.", "independence_check": "HIGH. Murray (physiology, Penn State, 1926) derived the law from minimizing blood flow work. Horton (geology, USGS, 1945) found stream ordering empirically from topographic maps. Bejan (mechanical engineering, Duke, 1996) derived constructal theory from heat transfer optimization. WBE (theoretical biology, 1997) derived metabolic scaling from network geometry. Four fields, four nations, seven decades, same pattern: hierarchical branching minimizes transport cost.", "pattern_type": "structural", "maps_to_axiom": ["A2", "A7"] }

---

Corpus map

Same node, other planes: Encyclopedia C16
Edges touching C16: convergence edge 9 · disconfirming edge 5
Catalogue hub: Public Article · Schema

Key evidence

6 claims · tier-ranked · API

human

The solution to connecting one source to many sinks with minimum transport cost converges on hierarchical branching networks.

human

These networks follow scaling laws (Murray's Law, constructal scaling) across 22 orders of magnitude.

human

Horton's laws state that stream number and length decrease geometrically with stream order.

human

The networks span from 10^-6 m (capillaries) to 10^6 m (river deltas), a range of 12 orders of magnitude.

mechanistic

Murray's Law states that for minimum viscous energy dissipation in a bifurcating network, r_0^3 = r_1^3 + r_2^3.

anecdotal

Bejan's constructal law states that flow systems evolve to provide easier access to currents.

Model review1 contributions · 1 modelExpand the recursive review layer

1 / 1

grok/grok-4.3atomizer

atomize2026-07-07 07:55

atomize · 6 claims

inspect — what it was prompted & output

prompted with

You are the claim atomizer for the miscsubjects.com philosophy and OIP corpus. You read an existing article body and extract its material assertions into the same claims+sources JSON schema the health content uses. The body is read-only input.

ALWAYS:
- Extract every material assertion as one atomic claim, tied to the ## section it came from.
- Tier honestly: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.
- Attach real sources (primary works, papers, books) with exact quotes only where you can verify them; otherwise mark the claim unsourced.
- Prefer fewer, harder claims over many soft ones.

NEVER:
- Never rewrite, summarize, or output the body.
- Never invent a URL, quote, or publication.
- Never duplicate an existing claim text.

input: atomize oip-node-c16-branching-optimal-transport

it output

{
  "claims": [
    {
      "id": "c1",
      "text": "The solution to connecting one source to many sinks with minimum transport cost converges on hierarchical branching networks.",
      "section": "# Node C16: Branching / Optimal Transport",
      "tier": "human",
      "source_ids": [],
      "source_status": "unsourced",
      "why_material": "Core assertion linking optimal transport minimization to network structure."
    },
    {
      "id": "c2",
      "text": "These networks follow scaling laws (Murray's Law, constructal scaling) across 22 orders of magnitude.",
      "section": "# Node C16: Branching / Optimal Transport",
      "tier": "human",
      "source_ids": [],
      "source_status": "unsourced",
      "why_material": "Quantifies the range and universality of the scaling pattern."
    },
    {
      "id": "c3",
      "text": "Murray's Law states that for minimum viscous energy dissipation in a bifurcating network, r_0^3 = r_1^3 + r_2^3.",
      "section": "# Node C16: Branching / Optimal Transport",
      "tier": "mechanistic",
      "source_ids": [],
      "source_status": "unsourced",
      "why_material": "Provides the explicit mathematical mechanism for the branching optimization."
    },
    {
      "id": "c4",
      "text": "Bejan's constructal law states that flow systems evolve to provide easier access to currents.",
      "section": "# Node C16: Branch

f64f61839e89466d

Machine verification: /api/articles/oip-node-c16-branching-optimal-transport/contributions

Corpus map

Key evidence

Latest from the journal

Related articles