{"query": "Get close - a bounded estimate", "count": 20, "results": [{"id": "card_instr_approximation", "title": "Get close - a bounded estimate", "shelf": "codex", "surface": "secular", "snippet": "The Get close - a bounded estimate verifier (src/concordance/verifiers/approximation.py). On the one map it instruments: card_question_p_vs_np. Found from the code's own imports, never invented; the m", "authority_tier": "engine_derived", "source": "verifier: approximation", "readable": false, "generated": false}, {"id": "card_theory_wave_optics", "title": "Wave optics (Huygens, Snell's law, diffraction)", "shelf": "theories", "surface": "secular", "snippet": "Wave optics (Huygens, Snell's law, diffraction) — an engine domain that can touch it: optics. Calibration: seals — refraction, lens and diffraction relations compute. Light behaves as a wave: it refra", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_holographic_principle", "title": "The holographic principle & black-hole entropy", "shelf": "theories", "surface": "secular", "snippet": "The holographic principle & black-hole entropy — an engine domain that can touch it: physics. Calibration: map-only — out of scope for sealing — foundational, empirical or interpretive (RESONANCE). Th", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (lone-domain seeding)", "readable": false, "generated": false}, {"id": "card_theory_prospect_theory", "title": "Prospect theory & bounded rationality (Kahneman, Simon)", "shelf": "theories", "surface": "secular", "snippet": "Prospect theory & bounded rationality (Kahneman, Simon) — an engine domain that can touch it: economics. Calibration: map-only — empirical and interpretive; specific experiments replicate. People do n", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_bridge_theory_structural_generative_linguistics__church_turing_thesis_computability", "title": "Bridge: Structural & generative linguistics (Saussure, Chomsky)  ↔  Church–Turing thesis / computability", "shelf": "bridges", "surface": "secular", "snippet": "Structural & generative linguistics (Saussure, Chomsky) and Church–Turing thesis / computability are the same form in different domains. the Chomsky hierarchy IS a computability hierarchy: regular, co", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_solve_get_close", "title": "Get close — a bounded estimate (the approximate flip)", "shelf": "codex", "surface": "secular", "snippet": "One step from the anchor, with a proven error: estimate f0 + f1·(x−x0), bound the remainder by Taylor (sup|f''|·(x−x0)^2/2) or Lipschitz. Fairly close, with a proven bound, is often the answer. The do", "authority_tier": "engine_derived", "source": "Narrow Highway — a step of the solve path", "readable": false, "generated": false}, {"id": "card_floor_the_solve_path", "title": "The solve path — two jaws that close on the answer", "shelf": "codex", "surface": "secular", "snippet": "How the engine solves a hard problem when no rule finds the exact answer (the barriers). Two jaws: EXCLUDE from outside (the barriers, the moat — cut the dead branches) and CONVERGE from inside (ancho", "authority_tier": "engine_derived", "source": "Narrow Highway — the solve path (operator seed)", "readable": false, "generated": false}, {"id": "card_src_pron_bounded", "title": "bounded", "shelf": "pronunciation", "surface": "secular", "snippet": "bounded: pronounced (ARPABET) B AW1 N D AH0 D; also B AW1 N D IH0 D. From the CMU Pronouncing Dictionary — the standard machine-readable pronunciations of North American English.", "authority_tier": "reference", "source": "CMU Pronouncing Dictionary (cmudict) — BSD-2-Clause, Carnegie Mellon", "readable": false, "generated": false}, {"id": "card_src_etym_icosahedron", "title": "icosahedron", "shelf": "etymology", "surface": "secular", "snippet": "icosahedron: etymology (Webster 1913) — n.: [Gr. (Geom.) Defn: A solid bounded by twenty sides or faces. Regular icosahedron, one of the five regular polyhedrons, bounded by twenty equilateral triangu", "authority_tier": "reference", "source": "Webster's Revised Unabridged Dictionary (1913), Project Gutenberg eBook #29765 — public domain", "readable": true, "generated": false}, {"id": "card_solve_answer", "title": "The answer — the surviving window closes", "shelf": "codex", "surface": "secular", "snippet": "Where the two jaws meet: a value with a proven bound, small enough to decide — or a proven limit (the inapproximability floor) saying it cannot shrink further. The proposer stayed free the whole way; ", "authority_tier": "engine_derived", "source": "Narrow Highway — a step of the solve path", "readable": false, "generated": false}, {"id": "card_src_etym_trapezohedron", "title": "trapezohedron", "shelf": "etymology", "surface": "secular", "snippet": "trapezohedron: etymology (Webster 1913) — n.: [NL., from trapezium + Gr. (Crystalloq.) (a) A solid bounded by twenty-four equal and similar trapeziums; a tetragonal trisoctahedron. See the Note under ", "authority_tier": "reference", "source": "Webster's Revised Unabridged Dictionary (1913), Project Gutenberg eBook #29765 — public domain", "readable": true, "generated": false}, {"id": "card_src_etym_tetrahedron", "title": "tetrahedron", "shelf": "etymology", "surface": "secular", "snippet": "tetrahedron: etymology (Webster 1913) — n.: [Tetra- + Gr. (Geom.) Defn: A solid figure inclosed or bounded by four triangles. Note: In crystallography, the regular tetrahedron is regarded as the hemih", "authority_tier": "reference", "source": "Webster's Revised Unabridged Dictionary (1913), Project Gutenberg eBook #29765 — public domain", "readable": true, "generated": false}, {"id": "card_src_word_bounded_interval", "title": "bounded interval", "shelf": "dictionary", "surface": "secular", "snippet": "bounded interval: (noun) an interval that includes its endpoints — syn: closed interval", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "readable": false, "generated": false}, {"id": "card_doctrine_authority_chain", "title": "A request is not an authority — the four-layer chain", "shelf": "doctrine", "surface": "secular", "snippet": "\"The Main may request. The Steward may admit a bounded capability. The Motion Executive may generate only approved trajectories. The Reflex layer continuously limits pressure, flow, current, force, sp", "authority_tier": "author", "source": "Humanoid Robot — Integrated Architecture and Development Planning Bible v0.2 — Matt Harris", "readable": false, "generated": false}, {"id": "card_c_2844e4b4b212", "title": "The framework is bounded by its own red-team", "shelf": "connections", "surface": null, "snippet": "The hub's honesty is the boundary card: the three escape hatches shut, the two weaknesses carried openly.", "authority_tier": "engine_derived", "source": "Concordance assay — 2026-07-10", "readable": false, "generated": false}, {"id": "card_c_663f60b2cc20", "title": "Schumann resonance resonates with Fluid probability dynamics", "shelf": "connections", "surface": null, "snippet": "Both are eigenmode stories — standing waves of a bounded medium; the recurrence is RESONANCE, a map-aid, never a proof of unity.", "authority_tier": "engine_derived", "source": "Concordance assay — 2026-07-09", "readable": false, "generated": false}, {"id": "card_src_etym_chiliahedron", "title": "chiliahedron", "shelf": "etymology", "surface": "secular", "snippet": "chiliahedron: etymology (Webster 1913) — n.: [Gr. Defn: A figure bounded by a thousand plane surfaces (Spelt also chiliaëdron.)]. From Webster's Revised Unabridged Dictionary (1913), public domain.", "authority_tier": "reference", "source": "Webster's Revised Unabridged Dictionary (1913), Project Gutenberg eBook #29765 — public domain", "readable": true, "generated": false}, {"id": "card_src_etym_octahedron", "title": "octahedron", "shelf": "etymology", "surface": "secular", "snippet": "octahedron: etymology (Webster 1913) — n.: [Gr. (Geom.) Defn: A solid bounded by eight faces. The regular octahedron is contained by eight equal equilateral triangles.]. From Webster's Revised Unabrid", "authority_tier": "reference", "source": "Webster's Revised Unabridged Dictionary (1913), Project Gutenberg eBook #29765 — public domain", "readable": true, "generated": false}, {"id": "card_chain_hopf_1951", "title": "Hopf 1951 — Über die Anfangswertaufgabe für die hydrodynamischen Grundgleichungen", "shelf": "codex", "surface": "secular", "snippet": "E. Hopf (1951). Über die Anfangswertaufgabe für die hydrodynamischen Grundgleichungen. Math. Nachr. 4 (1951) 213–231. DOI 10.1002/mana.3210040121. Canonical: https://doi.org/10.1002/mana.3210040121. C", "authority_tier": "reference", "source": "E. Hopf (1951), Math. Nachr. 4 (1951) 213–231", "readable": false, "generated": false}, {"id": "card_seal_f7e8e3e2664e79407e63c34d16ee4e6e9676b945e34dbdda6d65bcf9827bd36e", "title": "Receipt f7e8e3e2664e… — sealed: record", "shelf": "seals", "surface": "secular", "snippet": "{\n \"anchors\": [],\n \"axis_coords\": {\n  \"axis\": \"mathematics\",\n  \"dimensions\": [\n   \"reasoning\"\n  ]\n },\n \"gate_results\": [\n  {\n   \"details\": {\n    \"broken_at\": null,\n    \"confirmed_steps\": 1,\n    \"error", "authority_tier": "engine_derived", "source": "Narrow Highway engine — sealed record", "readable": false, "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_instr_approximation"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}