{"slug":"oip-node-c16-branching-optimal-transport","title":"Node C16: Branching / Optimal Transport","body":"# Node C16: Branching / Optimal Transport\n\nC16 — Branching / Optimal Transport\n{\n  \"id\": \"C16\",\n  \"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.\",\n  \"domain\": [\"physiology\", \"geomorphology\", \"neuroscience\", \"mycology\", \"meteorology\", \"engineering\"],\n  \"pattern\": [\"branching\", \"optimal_transport\", \"Murray_Law\", \"constructal_law\", \"space_filling\"],\n  \"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.\",\n  \"scale\": \"10^-6 m (capillaries) → 10^6 m (river deltas) — 12 orders\",\n  \"claim_tier\": \"T1\",\n  \"sources\": [\n    \"Murray, C.D. (1926). 'The Physiological Principle of Minimum Work.' Proc. Natl. Acad. Sci. USA, 12(3), 207-214.\",\n    \"Horton, R.E. (1945). 'Erosional Development of Streams and Their Drainage Basins.' Geol. Soc. Am. Bull., 56, 275-370.\",\n    \"Bejan, A. (1996). 'Street Network Theory of Organization in Nature.' J. Adv. Transp., 30(1), 85-107.\",\n    \"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.\"\n  ],\n  \"dual\": \"Uniform perfusion (no hierarchy) — a system where every point is equally close to the source, no branching advantage.\",\n  \"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.\",\n  \"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.\",\n  \"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.\",\n  \"pattern_type\": \"structural\",\n  \"maps_to_axiom\": [\"A2\", \"A7\"]\n}\n\n---\n\n## Corpus map\n- Same node, other planes: [Encyclopedia C16](/a/convergence-encyclopedia-c16)\n- Edges touching C16: [convergence edge 9](/a/oip-convergence-edge-9) · [disconfirming edge 5](/a/oip-disconfirming-edge-5)\n- Catalogue hub: [Public Article](/a/oip-convergence-public-article) · [Schema](/a/oip-convergence-schema)","hero":null,"images":[],"style":{},"tags":["philosophy","oip","convergence-catalogue","node","systems-theory"],"model":null,"ledger":null,"embeds":[],"widgets":[],"home":true,"claims":[],"sources":[],"reviews":[],"extra":{"kind":"corpus","corpus_map":{"prev":"oip-node-c15-optimization-under-constraint-pareto-fronts","next":"oip-node-c17-spirals-logarithmic-growth-packing","hub":"oip-convergence-public-article","series":"catalogue-nodes","position":16,"of":25}},"register":"oip_protocol","status":"published","revisions":2,"contributions":[],"provenance":[{"ts":"2026-07-04T04:34:06.031Z","model":"claude-fable-5","action":"edit","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"genesis","hash":"4e91442b25c414ab64694c24d04241bb26c0f9a70793fabb133432b9cfb6a719"},{"ts":"2026-07-04T05:02:02.772Z","model":"claude-fable-5","action":"edit","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"4e91442b25c414ab64694c24d04241bb26c0f9a70793fabb133432b9cfb6a719","hash":"a00c66a7eb798789cc1493105261ab1ded3fc7b1f10315d50d18c5581b0c4108"}],"energy":{"passes":2,"tokens_in":0,"tokens_out":0,"tokens_total":0,"cost_usd":0,"models":{"claude-fable-5":2},"head":"a00c66a7eb798789cc1493105261ab1ded3fc7b1f10315d50d18c5581b0c4108"},"posted_at":"2026-07-04T02:47:54.877Z","created_at":"2026-07-04T02:47:54.877Z","updated_at":"2026-07-04T05:02:02.772Z","machine":{"shape":"article.machine/v1","slug":"oip-node-c16-branching-optimal-transport","kind":"corpus","read":{"human":"https://miscsubjects.com/a/oip-node-c16-branching-optimal-transport","json":"https://miscsubjects.com/api/articles/oip-node-c16-branching-optimal-transport","bundle":"https://miscsubjects.com/api/articles/oip-node-c16-branching-optimal-transport/bundle?format=markdown"},"traversal":{"prev":{"slug":"oip-node-c15-optimization-under-constraint-pareto-fronts","human":"https://miscsubjects.com/a/oip-node-c15-optimization-under-constraint-pareto-fronts","json":"https://miscsubjects.com/api/articles/oip-node-c15-optimization-under-constraint-pareto-fronts"},"next":{"slug":"oip-node-c17-spirals-logarithmic-growth-packing","human":"https://miscsubjects.com/a/oip-node-c17-spirals-logarithmic-growth-packing","json":"https://miscsubjects.com/api/articles/oip-node-c17-spirals-logarithmic-growth-packing"},"hub":{"slug":"oip-convergence-public-article","human":"https://miscsubjects.com/a/oip-convergence-public-article","json":"https://miscsubjects.com/api/articles/oip-convergence-public-article"},"series":"catalogue-nodes","position":16,"of":25},"ledger":{"claims":0,"sources":0,"contributions":0,"revisions":2,"objections_url":"https://miscsubjects.com/api/articles/oip-node-c16-branching-optimal-transport/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=oip-node-c16-branching-optimal-transport","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":"source text is prose-preserving — attack via objections, never rewrite the author's words"},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"oip-node-c16-branching-optimal-transport\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"oip-node-c16-branching-optimal-transport\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/oip-node-c16-branching-optimal-transport/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"oip-node-c16-branching-optimal-transport\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/oip-node-c16-branching-optimal-transport | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}}}