{"_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":"convergence-encyclopedia-c11","urls":{"read":"https://miscsubjects.com/api/articles/convergence-encyclopedia-c11/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/convergence-encyclopedia-c11/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/convergence-encyclopedia-c11/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/convergence-encyclopedia-c11/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/convergence-encyclopedia-c11/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/convergence-encyclopedia-c11/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/convergence-encyclopedia-c11/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":"convergence-encyclopedia-c11","title":"Convergence Encyclopedia: C11 — Networks / Small-World / Scale-Free","register":"oip_protocol","tags":["OIP","convergence-encyclopedia","node"],"updated_at":"2026-07-04T05:01:02.278Z","body_excerpt":"**F1 — Tier.** T1 (small-world phenomenon); T1 (scale-free claim, with Clauset caution). Uncertainty flag: The scale-free property is less ubiquitous than initially claimed; many networks are better described by alternative distributions.\n\n**F2 — Sources.** \n- Euler, L. (1736). “Solutio problematis ad geometriam situs pertinentis.” Commentarii Academiae Scientiarum Petropolitanae, 8, 128–140.\n- Watts, D.J. & Strogatz, S.H. (1998). “Collective dynamics of ‘small-world’ networks.” Nature, 393(6684), 440–442.\n- Barabasi, A.L. & Albert, R. (1999). “Emergence of scaling in random networks.” Science, 286(5439), 509–512.\n- Granovetter, M.S. (1973). “The strength of weak ties.” American Journal of Sociology, 78(6), 1360–1380.\n\n**F3 — Domains.** Neural networks (brain connectome), internet routing, food webs, metabolic networks, scientific collaboration networks, social networks, power grids.\n\n**F4 — Scale.** Protein interaction networks (~10³ nodes) → World Wide Web (~10¹² nodes); neural circuits (~10⁴ neurons) → human brain (~10¹¹ neurons).\n\n**F5 — Falsifier.** A large adaptive network (≥10⁴ nodes, evolving under selection pressure) that is demonstrably neither small-world (high average path length, low clustering) nor approximately scale-free in degree distribution. If such networks are common and functional, the convergence claim weakens.\n\n**F6 — Rival (strongest form).** Network properties are statistical artifacts of growth processes, not deep structural principles. Preferential attachment (Barabasi-Albert) produces power-law degree distributions, but so do many other growth mechanisms. More critically: Clauset, Shalizi & Newman (2009) SIAM Review 51:661 showed that many claimed scale-free networks do not survive rigorous statistical fitting. The “scale-free” property is often an artifact of log-binning or insufficient data. Small-worldness is more robust but may be a trivial consequence of sparse random graphs with local clustering. CITED.\n\n**F7 — Independence.** HIGH — with caveat. Euler (mathematics, 1736 — founding graph theory), Watts-Strogatz (sociology/applied math, Cornell, 1998), and Barabasi (physics, Notre Dame, 1999) arrived independently. BUT: all employ graph theory — this is a shared mathematical framework, a hidden common cause. The independence assessment is HIGH for the empirical discoveries (small-world, preferential attachment); MODERATE for the formal framework.\n\n**F8 — Pattern type.** Mathematical.\n\n**F9 — Maps.** A3 (pattern-dynamics), A7 (pattern geometry).\n\n---\n\n## Corpus map\n- Previous: [Convergence Encyclopedia: C10](/a/convergence-encyclopedia-c10)\n- Next: [Convergence Encyclopedia: C12](/a/convergence-encyclopedia-c12)\n- Encyclopedia start: [The Schema](/a/convergence-encyclopedia-schema)\n- Same node, other planes: [Catalogue node C11](/a/oip-node-c11-networks-small-world-scale-free) · [Catalogue hub](/a/oip-convergence-public-article)\n- Edges touching C11: [convergence edge 8](/a/oip-convergence-edge-8) · [convergence edge 9](/a/oip-convergence-edge-9)\n- Kin corpora: [Total Structure](/a/oip-total-structure) · [Signature of the Grain](/a/oip-sog-preamble-axioms)","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[],"sources":[],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"slug":"convergence-encyclopedia-c11","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}}