{"slug":"oip-disconfirming-edge-5","title":"Disconfirming Edge 5: Branching vs Scale Invariance","body":"**C16** (Branching) contradicts **C10** (Scale Invariance)\n\n**Tension:** If branching networks are optimal transport solutions (C16), they should be engineering-optimal — not necessarily fractal. If they are fractal (C10, scale-invariant), they must follow power-law scaling — but engineering optimality often produces exponential, not power-law, scaling.\n\n**Resolution status:** PARTIALLY RESOLVED\n\n**What would settle it:** A definitive proof that Murray’s Law (r^3) follows from fractal geometry rather than viscous dissipation optimization; OR demonstration that optimal transport under realistic biological constraints necessarily produces fractal, not exponential, scaling.\n\n**Current state:** Bejan’s constructal law claims to derive branching from optimization, but the derivation assumes a fractal Ansatz. WBE (1997) derive the 3/4 scaling exponent from network geometry plus minimization, suggesting both nodes are partially right.\n\n**Honest assessment:** The tension is more apparent than real — both branching and fractality emerge from the same physical constraints (space-filling + minimum cost). But the rival frames of each node are in genuine tension: one says geometry is primary, the other says optimization is primary.\n\nSummary Table: Disconfirming Edges\n\n---\n\n## Corpus map\n- C16 (Branching): [C16 in the Encyclopedia](/a/convergence-encyclopedia-c16) · [C16 in the Catalogue](/a/oip-node-c16-branching-optimal-transport)\n- C10 (Scale Invariance): [C10 in the Encyclopedia](/a/convergence-encyclopedia-c10) · [C10 in the Catalogue](/a/oip-node-c10-scale-invariance-fractals-allometry)\n- Disconfirming edges: [1](/a/oip-disconfirming-edge-11) · [2](/a/oip-disconfirming-edge-22) · [3](/a/oip-disconfirming-edge-33) · [4](/a/oip-disconfirming-edge-44) · [5](/a/oip-disconfirming-edge-55)\n- Catalogue hub: [Convergence Catalogue — Public Article](/a/oip-convergence-public-article) · [The Schema](/a/oip-convergence-schema)","register":"oip_protocol","tags":["OIP","catalogue","disconfirming","edge"],"category":null,"style":{},"claims":[{"id":"c1","text":"C16 (Branching) contradicts C10 (Scale Invariance)","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"States the core disconfirming relationship between nodes."},{"id":"c2","text":"If branching networks are optimal transport solutions (C16), they should be engineering-optimal — not necessarily fractal.","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Articulates one side of the stated tension."},{"id":"c3","text":"If they are fractal (C10, scale-invariant), they must follow power-law scaling — but engineering optimality often produces exponential, not power-law, scaling.","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Articulates the opposing side of the stated tension."},{"id":"c4","text":"Resolution status is PARTIALLY RESOLVED","section":"","tier":"anecdotal","source_ids":[],"source_status":"unsourced","why_material":"Reports current status of the edge."},{"id":"c5","text":"Bejan’s constructal law claims to derive branching from optimization, but the derivation assumes a fractal Ansatz.","section":"","tier":"anecdotal","source_ids":[],"source_status":"unsourced","why_material":"Attributes a specific limitation to the constructal law derivation."},{"id":"c6","text":"WBE (1997) derive the 3/4 scaling exponent from network geometry plus minimization, suggesting both nodes are partially right.","section":"","tier":"anecdotal","source_ids":[],"source_status":"unsourced","why_material":"Attributes a derivation and implication to the WBE 1997 work."},{"id":"c7","text":"The tension is more apparent than real — both branching and fractality emerge from the same physical constraints (space-filling + minimum cost).","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"States the assessment that the nodes share underlying physical constraints."},{"id":"c8","text":"The rival frames of each node are in genuine tension: one says geometry is primary, the other says optimization is primary.","section":"","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Identifies the genuine frame-level conflict."}],"sources":[],"prov":{"model":"Fable 5 (Claude Code)","action":"write"}}