{"query": "A parable — Decision two roads", "count": 20, "results": [{"id": "card_n_8b6256f0ebba", "title": "A parable — Decision two roads", "shelf": "codex", "surface": "witness", "snippet": "A man stood at the fork of two roads with no map. He sat down to think and a thousand reasons came, half for each road. After many hours he saw he was no closer to choosing. Then he remembered the thi", "authority_tier": "operator", "source": "Narrow Highway — original parable", "readable": false, "generated": false}, {"id": "card_theory_graph_theory", "title": "Graph theory (Euler, connectivity)", "shelf": "theories", "surface": "secular", "snippet": "Graph theory (Euler, connectivity) — an engine domain that can touch it: combinatorics. Calibration: seals. Dots and lines — vertices and edges — and everything that follows from which dots are joined", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_queueing_theory", "title": "Queueing theory (Little's law)", "shelf": "theories", "surface": "secular", "snippet": "Queueing theory (Little's law) — an engine domain that can touch it: operations_research. Calibration: seals — Little's law and standard queue formulas compute. L = λW: the average number waiting equa", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_contract_theory_rule_of_law", "title": "Contract theory & rule of law", "shelf": "theories", "surface": "secular", "snippet": "Contract theory & rule of law — an engine domain that can touch it: law. Calibration: map-only — institutional, not a computation. A contract is an enforceable promise, and enforceability is what make", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_n_6f8626f8a063", "title": "A parable — Marathon", "shelf": "codex", "surface": "witness", "snippet": "A young runner sprinted from the first mile, and the crowd cheered him. By the tenth mile he walked. By the fifteenth he sat. An older runner passed him at a pace the crowd had laughed at, and finishe", "authority_tier": "operator", "source": "Narrow Highway — original parable", "readable": false, "generated": false}, {"id": "card_alm_connection_syntonic_comma", "title": "Almanac: The syntonic comma: the pure third and the Pythagorean third disagree by 81:80", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  Music has TWO ways to build a major third, and they do not match. music_theory confirmed the pure (just) major third is the simple ratio 5:4 (64 Hz to 80 Hz) -- the one nature gives in the", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_floor_p_vs_np", "title": "The P versus NP chain - from the machine and the circuit to the three barriers", "shelf": "codex", "surface": "secular", "snippet": "Two trees. Computability: Turing's machine (1936), time as a resource (Hartmanis-Stearns 1965), feasible as polynomial in the input's length (Cobham 1965, Edmonds 1965). Circuits: Shannon's count of g", "authority_tier": "engine_derived", "source": "Narrow Highway - a chain on the one map (operator seed)", "readable": false, "generated": false}, {"id": "card_joint_weil_conjectures", "title": "The Weil conjectures (Deligne 1974): the Riemann hypothesis over finite fields, a theorem", "shelf": "codex", "surface": "secular", "snippet": "The Weil conjectures are the analogue of the Riemann hypothesis for the zeta functions of varieties over FINITE FIELDS, and they are a theorem (Deligne 1974): every eigenvalue of Frobenius on the i-th", "authority_tier": "engine_derived", "source": "Narrow Highway - the Millennium floor, a joint found in the literature (operator seed)", "readable": false, "generated": false}, {"id": "card_bridge_theory_graph_theory__topology", "title": "Bridge: Graph theory (Euler, connectivity)  ↔  Topology (what survives stretching)", "shelf": "bridges", "surface": "secular", "snippet": "Graph theory (Euler, connectivity) and Topology (what survives stretching) are the same form in different domains. graph theory is topology with the geometry discarded: Euler solved the Königsberg bri", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_alm_located_modular_exponentiation_trapdoor", "title": "Almanac: The modular-exponentiation trapdoor: fast one way, hard the other", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  Public-key cryptography needs an operation that is easy to do and ruinous to undo -- and modular exponentiation is it. mathematics confirmed the FAST direction by square-and-multiply: beca", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_timeline_t035", "title": "Saul's conversion on the road to Damascus (c. AD 33-36)", "shelf": "scripture", "surface": "witness", "snippet": "Saul's conversion on the road to Damascus — New Testament, Pentecost and the Jerusalem Church. Date: c. AD 33-36. Scripture: Acts 9:1-19. An approximate range; Paul's own later reckoning in Galatians ", "authority_tier": "reference", "source": "World English Bible (public domain) + the standard study tables", "readable": false, "generated": false}, {"id": "card_n_770170ab1111", "title": "The linguistic clock — the comparative method dates the dispersal", "shelf": "science", "surface": "secular", "snippet": "The same history is written in the words. The comparative method reconstructs ancestral\ntongues from their daughters (sealed in the language-evolution wing), and glottochronology's\nexponential vocabul", "authority_tier": "engine_derived", "source": "Concordance assay — 2026-07-09", "readable": false, "generated": false}, {"id": "card_src_mill_mulmuley_2011", "title": "K. D. Mulmuley 2011 — On P vs. NP and geometric complexity theory", "shelf": "millennium", "surface": "secular", "snippet": "K. D. Mulmuley (2011). On P vs. NP and geometric complexity theory. J. ACM 58 (2011) 5:1–26. DOI 10.1145/1944345.1944346. arXiv: 0908.1936. Canonical: https://doi.org/10.1145/1944345.1944346. Free cop", "authority_tier": "reference", "source": "K. D. Mulmuley (2011), J. ACM 58 (2011) 5:1–26", "readable": false, "generated": false}, {"id": "card_n_d020834a87f2", "title": "A parable — Temptation", "shelf": "codex", "surface": "witness", "snippet": "There hath no temptation taken you but such as is common to man. The new temptation you fear is not new — only newly aimed at you. With the temptation, the same road has a door. The door is sometimes ", "authority_tier": "operator", "source": "Narrow Highway — original parable", "readable": false, "generated": false}, {"id": "card_src_mill_mulmuley_sohoni_2001", "title": "K. D. Mulmuley 2001 — Geometric complexity theory I: an approach to the P vs. NP and related problems", "shelf": "millennium", "surface": "secular", "snippet": "K. D. Mulmuley, M. Sohoni (2001). Geometric complexity theory I: an approach to the P vs. NP and related problems. SIAM J. Comput. 31 (2001) 496–526. DOI 10.1137/S009753970038715X. Canonical: https://", "authority_tier": "reference", "source": "K. D. Mulmuley, M. Sohoni (2001), SIAM J. Comput. 31 (2001) 496–526", "readable": false, "generated": false}, {"id": "card_n_5335d3c35271", "title": "A parable — Worry children", "shelf": "codex", "surface": "witness", "snippet": "A mother watched her child run toward the road and called him back a thousand times. By the thousandth call her voice was tired and her child no longer turned. A wise woman sat beside her and said, 'Y", "authority_tier": "operator", "source": "Narrow Highway — original parable", "readable": false, "generated": false}, {"id": "card_src_fed_cat10400330", "title": "CADD drawings : electrical, mechanical, civil, recreation, roads, maps, architectural", "shelf": "ecology", "surface": "secular", "snippet": "CADD drawings : electrical, mechanical, civil, recreation, roads, maps, architectural. A United States federal publication, public domain (17 USC 105). The full text (460,285 bytes) is held on the ark", "authority_tier": "reference", "source": "US Forest Service publications (PD, 17 USC 105)", "readable": true, "generated": false}, {"id": "card_n_f1c2cf8a54d5", "title": "A parable — Worry what if", "shelf": "codex", "surface": "witness", "snippet": "A woman lay awake and ran every path her child might walk for a thousand miles. By morning she had aged a year, and the child had walked one mile, and the road had been gentle. She kissed him goodbye ", "authority_tier": "operator", "source": "Narrow Highway — original parable", "readable": false, "generated": false}, {"id": "card_src_mill_aaronson_2016", "title": "S. Aaronson 2016 — P =? NP", "shelf": "millennium", "surface": "secular", "snippet": "S. Aaronson (2016). P =? NP. Open Problems in Mathematics (Springer, 2016) 1–122. DOI 10.1007/978-3-319-32162-2_1. Canonical: https://doi.org/10.1007/978-3-319-32162-2_1. Free copy: https://www.scotta", "authority_tier": "reference", "source": "S. Aaronson (2016), Open Problems in Mathematics (Springer, 2016) 1–122", "readable": false, "generated": false}, {"id": "card_src_fed_tm5_1202", "title": "TM 5-1202 Scraper, Road, Motorized, Cable-Operated, 12 Cu. Yd., L Tourneau Model Super C Tournapull, With Model LP Carryall: Maintenance Instructions And Parts Catalog, 1944", "shelf": "practical", "surface": "secular", "snippet": "TM 5-1202 Scraper, Road, Motorized, Cable-Operated, 12 Cu. Yd., L Tourneau Model Super C Tournapull, With Model LP Carryall: Maintenance Instructions And Parts Catalog, 1944. A United States federal p", "authority_tier": "reference", "source": "US War Department field & technical manuals (PD, 17 USC 105)", "readable": true, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_n_8b6256f0ebba"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}