Research instrument · source-driven · no inferred links
Evidence Atlas
See how the catalogue fits together—and inspect the exact record behind every connection.
Interactive research relationship instrument
Accepted relationship register (175)
This complete nonvisual representation is generated from the same source graph as the map. Expand it to browse every accepted edge; interactive filters may hide rows, while the unfiltered HTML retains them all.
| Source | Relationship | Target | Recorded basis | Status | Provenance |
|---|---|---|---|---|---|
| The bordered Jacobian of binary-form multiplication | cites related release | Exact Smith invariants of binary-form factorisation | Subsequent unrefereed work: Anonymous. (2026). Exact Smith Invariants and Affine Determinant Lines of Binary-Form Factorisation (Version 0.1.0-candidate). This is a separate child extension, not a correction to or strengthening of the present release. | asserted | source record |
| TxGraffiti Conjecture 15/3 resolution | cites related release | Bilateral deficiency in regular-DIM graphs | Subsequent unrefereed work: Anonymous. (2026). Bilateral Deficiency: Residual SAT Optimisation and Independent Domination in Regular-DIM Graphs (Version 1.0.1-candidate). This is a separate child extension, not a correction to or strengthening of the present release. | asserted | source record |
| Wales 20 mph casualty attribution | cites related release | Stocks are not flows | Anonymous (2026). Stocks Are Not Flows: An Identification Audit of Investor Pressure and Tenure Change in England. Evidence Press. | asserted | source record |
| The full e=3 Polydegree column | extends result | Smooth-point certificates for Polydegree containments | The derivative--Jacobian identity, integral weighted-Euler factorisation, smooth-point reformulation and smaller Hensel certificate form the structural layer used by this all-degree successor. | asserted | source record |
| Conditional sharp partial identification of diversification histories | shares broad cluster | Identification and robust operations | The method registry lists affine-diversification-fibres as a member of Identification and robust operations. | asserted | source record |
| Aggregation without sufficiency | shares broad cluster | Aggregation licences and target sufficiency | The method registry lists aggregation-without-sufficiency as a member of Aggregation licences and target sufficiency. | asserted | source record |
| Bilateral deficiency in regular-DIM graphs | shares broad cluster | Exact combinatorial certificate architecture | The method registry lists bilateral-deficiency-regular-dim as a member of Exact combinatorial certificate architecture. | asserted | source record |
| The bordered Jacobian of binary-form multiplication | shares broad cluster | Binary-form Jacobian, determinant and obstruction toolkit | The method registry lists bordered-jacobian-foundations as a member of Binary-form Jacobian, determinant and obstruction toolkit. | asserted | source record |
| Certified commitment horizons in dynamic lot sizing | shares broad cluster | Identification and robust operations | The method registry lists certified-commitment-horizons as a member of Identification and robust operations. | asserted | source record |
| The exact two-item cap gap in joint replenishment | shares broad cluster | Identification and robust operations | The method registry lists certified-two-item-jrp as a member of Identification and robust operations. | asserted | source record |
| Fixed-seed cyclicity loci for polynomial exponential periods | shares broad cluster | Cyclicity and spectral compression | The method registry lists cyclicity-loci-exponential-periods as a member of Cyclicity and spectral compression. | asserted | source record |
| Fixed-seed cyclic rank from inverse roots | shares broad cluster | Cyclicity and spectral compression | The method registry lists cyclicity-root-span-low-rank as a member of Cyclicity and spectral compression. | asserted | source record |
| Degree-difference principle and affine slices | shares broad cluster | Binary-form Jacobian, determinant and obstruction toolkit | The method registry lists degree-difference-affine-slices as a member of Binary-form Jacobian, determinant and obstruction toolkit. | asserted | source record |
| Erdős 848: exact answer for all N | shares broad cluster | Exact combinatorial certificate architecture | The method registry lists erdos-848-all-n as a member of Exact combinatorial certificate architecture. | asserted | source record |
| Exact low-length Recht–Ré inequalities | shares broad cluster | Sampling and optimisation diagnostics | The method registry lists exact-low-length-recht-re-inequalities as a member of Sampling and optimisation diagnostics. | asserted | source record |
| Exact Smith invariants of binary-form factorisation | shares broad cluster | Binary-form Jacobian, determinant and obstruction toolkit | The method registry lists exact-smith-invariants-affine-determinant-lines as a member of Binary-form Jacobian, determinant and obstruction toolkit. | asserted | source record |
| Exotic affine three-spheres | shares broad cluster | Binary-form Jacobian, determinant and obstruction toolkit | The method registry lists exotic-affine-three-spheres as a member of Binary-form Jacobian, determinant and obstruction toolkit. | asserted | source record |
| Frankl entropy concavity obstruction | shares broad cluster | Frankl entropy obstruction and repaired reductions | The method registry lists frankl-concavity-obstruction as a member of Frankl entropy obstruction and repaired reductions. | asserted | source record |
| The full e=3 Polydegree column | shares broad cluster | Polydegree smooth-point and Fourier-persistence certificates | The method registry lists full-e3-column-polydegree-conjecture as a member of Polydegree smooth-point and Fourier-persistence certificates. | asserted | source record |
| Furter's R(3) through n=299 | shares broad cluster | Finite polynomial-rigidity certificates and executable frontier | The method registry lists furter-r3-through-299 as a member of Finite polynomial-rigidity certificates and executable frontier. | asserted | source record |
| Hahn--Ewens spectrum and mixing transition | shares broad cluster | Cyclicity and spectral compression | The method registry lists hahn-ewens-mixing-theorem as a member of Cyclicity and spectral compression. | asserted | source record |
| Irreducible pushforwards and quartic transitions | shares broad cluster | Grand-problem salvage | The method registry lists irreducible-pushforwards-quartic-transitions as a member of Grand-problem salvage. | asserted | source record |
| Random reshuffling as a baseline policy | shares broad cluster | Sampling and optimisation diagnostics | The method registry lists random-reshuffling-baseline-policy as a member of Sampling and optimisation diagnostics. | asserted | source record |
| Reducible incidence divisors | shares broad cluster | Binary-form Jacobian, determinant and obstruction toolkit | The method registry lists reducible-incidence-divisors as a member of Binary-form Jacobian, determinant and obstruction toolkit. | asserted | source record |
| What the site-frequency spectrum can and cannot say | shares broad cluster | Certified demographic identifiability auditing | The method registry lists sfs-identifiability-audit as a member of Certified demographic identifiability auditing. | asserted | source record |
| Smooth-point certificates for Polydegree containments | shares broad cluster | Binary-form Jacobian, determinant and obstruction toolkit | The method registry lists smooth-point-certificates-polydegree-containments as a member of Binary-form Jacobian, determinant and obstruction toolkit. | asserted | source record |
| Stocks are not flows | shares broad cluster | Identification and robust operations | The method registry lists stocks-are-not-flows as a member of Identification and robust operations. | asserted | source record |
| TxGraffiti Conjecture 15/3 resolution | shares broad cluster | Exact combinatorial certificate architecture | The method registry lists txgraffiti-c3-resolution as a member of Exact combinatorial certificate architecture. | asserted | source record |
| When a unique answer is not an identified answer | shares broad cluster | Cross-field identification and selector provenance | The method registry lists unique-answer-not-identified as a member of Cross-field identification and selector provenance. | asserted | source record |
| VR2(K4) = 20 | shares broad cluster | Exact combinatorial certificate architecture | The method registry lists vr2-k4-equals-20 as a member of Exact combinatorial certificate architecture. | asserted | source record |
| Wales 20 mph casualty attribution | shares broad cluster | Wales policy-attribution identification audit | The method registry lists wales-20mph-casualty-attribution as a member of Wales policy-attribution identification audit. | asserted | source record |
| z(20) = 6 (Erdős problem 758) | shares broad cluster | Exact combinatorial certificate architecture | The method registry lists z20-equals-6 as a member of Exact combinatorial certificate architecture. | asserted | source record |
| The bordered Jacobian of binary-form multiplication | belongs to lineage | Binary-form factorisation programme | Each member explicitly identifies another member as foundational, parent, child, companion or continuation work in the published release metadata. | asserted | source record |
| Fixed-seed cyclicity loci for polynomial exponential periods | belongs to lineage | Fixed-seed cyclicity programme | The root-span release explicitly cites the cyclicity-loci release as its predecessor and extends the same fixed-seed cyclicity programme. | asserted | source record |
| Fixed-seed cyclic rank from inverse roots | belongs to lineage | Fixed-seed cyclicity programme | The root-span release explicitly cites the cyclicity-loci release as its predecessor and extends the same fixed-seed cyclicity programme. | asserted | source record |
| Degree-difference principle and affine slices | belongs to lineage | Binary-form factorisation programme | Each member explicitly identifies another member as foundational, parent, child, companion or continuation work in the published release metadata. | asserted | source record |
| Exact Smith invariants of binary-form factorisation | belongs to lineage | Binary-form factorisation programme | Each member explicitly identifies another member as foundational, parent, child, companion or continuation work in the published release metadata. | asserted | source record |
| Exotic affine three-spheres | belongs to lineage | Binary-form factorisation programme | Each member explicitly identifies another member as foundational, parent, child, companion or continuation work in the published release metadata. | asserted | source record |
| Reducible incidence divisors | belongs to lineage | Binary-form factorisation programme | Each member explicitly identifies another member as foundational, parent, child, companion or continuation work in the published release metadata. | asserted | source record |
| Wales 20 mph casualty attribution | reuses method | Stocks are not flows | The project reuses the identification-before-estimation workflow: distinguish the estimand from available proxies, register admitted rivals, test the observation map and publish a justified stopping boundary when point attribution fails. | asserted | source record |
| Conditional sharp partial identification of diversification histories | uses method | Adversarial scientific controls | The method registry assigns affine-diversification-fibres to adversarial-controls. | asserted | source record |
| Conditional sharp partial identification of diversification histories | uses method | Agent-readable research objects | The method registry assigns affine-diversification-fibres to agent-readable-research-object. | asserted | source record |
| Conditional sharp partial identification of diversification histories | uses method | Certified decision margins | The method registry assigns affine-diversification-fibres to certified-decision-margin. | asserted | source record |
| Conditional sharp partial identification of diversification histories | uses method | Identification before estimation | The method registry assigns affine-diversification-fibres to identification-gate. | asserted | source record |
| Conditional sharp partial identification of diversification histories | uses method | Partial identification and robust decisions | The method registry assigns affine-diversification-fibres to partial-identification. | asserted | source record |
| Conditional sharp partial identification of diversification histories | uses method | Structural compression | The method registry assigns affine-diversification-fibres to structural-compression. | asserted | source record |
| Aggregation without sufficiency | uses method | Adversarial scientific controls | The method registry assigns aggregation-without-sufficiency to adversarial-controls. | asserted | source record |
| Aggregation without sufficiency | uses method | Agent-readable research objects | The method registry assigns aggregation-without-sufficiency to agent-readable-research-object. | asserted | source record |
| Aggregation without sufficiency | uses method | Assurance as a vector | The method registry assigns aggregation-without-sufficiency to assurance-vector. | asserted | source record |
| Aggregation without sufficiency | uses method | Counterexample- and proxy-first analysis | The method registry assigns aggregation-without-sufficiency to counterexample-proxy-first. | asserted | source record |
| Aggregation without sufficiency | uses method | Identification before estimation | The method registry assigns aggregation-without-sufficiency to identification-gate. | asserted | source record |
| Aggregation without sufficiency | uses method | Partial identification and robust decisions | The method registry assigns aggregation-without-sufficiency to partial-identification. | asserted | source record |
| Aggregation without sufficiency | uses method | Structural compression | The method registry assigns aggregation-without-sufficiency to structural-compression. | asserted | source record |
| Bilateral deficiency in regular-DIM graphs | uses method | Adversarial scientific controls | The method registry assigns bilateral-deficiency-regular-dim to adversarial-controls. | asserted | source record |
| Bilateral deficiency in regular-DIM graphs | uses method | Certificate-first, proof-carrying research | The method registry assigns bilateral-deficiency-regular-dim to certificate-first. | asserted | source record |
| Bilateral deficiency in regular-DIM graphs | uses method | Explicit research-lineage reuse | The method registry assigns bilateral-deficiency-regular-dim to research-lineage-reuse. | asserted | source record |
| Bilateral deficiency in regular-DIM graphs | uses method | Structural compression | The method registry assigns bilateral-deficiency-regular-dim to structural-compression. | asserted | source record |
| The bordered Jacobian of binary-form multiplication | uses method | Adversarial scientific controls | The method registry assigns bordered-jacobian-foundations to adversarial-controls. | asserted | source record |
| The bordered Jacobian of binary-form multiplication | uses method | Assurance as a vector | The method registry assigns bordered-jacobian-foundations to assurance-vector. | asserted | source record |
| The bordered Jacobian of binary-form multiplication | uses method | Explicit research-lineage reuse | The method registry assigns bordered-jacobian-foundations to research-lineage-reuse. | asserted | source record |
| The bordered Jacobian of binary-form multiplication | uses method | Structural compression | The method registry assigns bordered-jacobian-foundations to structural-compression. | asserted | source record |
| Certified commitment horizons in dynamic lot sizing | uses method | Certificate-first, proof-carrying research | The method registry assigns certified-commitment-horizons to certificate-first. | asserted | source record |
| Certified commitment horizons in dynamic lot sizing | uses method | Certified decision margins | The method registry assigns certified-commitment-horizons to certified-decision-margin. | asserted | source record |
| Certified commitment horizons in dynamic lot sizing | uses method | Partial identification and robust decisions | The method registry assigns certified-commitment-horizons to partial-identification. | asserted | source record |
| Certified commitment horizons in dynamic lot sizing | uses method | Staged adoption and impact evaluation | The method registry assigns certified-commitment-horizons to staged-adoption-evaluation. | asserted | source record |
| Certified commitment horizons in dynamic lot sizing | uses method | Structural compression | The method registry assigns certified-commitment-horizons to structural-compression. | asserted | source record |
| The exact two-item cap gap in joint replenishment | uses method | Certificate-first, proof-carrying research | The method registry assigns certified-two-item-jrp to certificate-first. | asserted | source record |
| The exact two-item cap gap in joint replenishment | uses method | Certified decision margins | The method registry assigns certified-two-item-jrp to certified-decision-margin. | asserted | source record |
| The exact two-item cap gap in joint replenishment | uses method | Exact regime stitching | The method registry assigns certified-two-item-jrp to regime-stitching. | asserted | source record |
| The exact two-item cap gap in joint replenishment | uses method | Staged adoption and impact evaluation | The method registry assigns certified-two-item-jrp to staged-adoption-evaluation. | asserted | source record |
| The exact two-item cap gap in joint replenishment | uses method | Structural compression | The method registry assigns certified-two-item-jrp to structural-compression. | asserted | source record |
| Fixed-seed cyclicity loci for polynomial exponential periods | uses method | Adversarial scientific controls | The method registry assigns cyclicity-loci-exponential-periods to adversarial-controls. | asserted | source record |
| Fixed-seed cyclicity loci for polynomial exponential periods | uses method | Certificate-first, proof-carrying research | The method registry assigns cyclicity-loci-exponential-periods to certificate-first. | asserted | source record |
| Fixed-seed cyclicity loci for polynomial exponential periods | uses method | Counterexample- and proxy-first analysis | The method registry assigns cyclicity-loci-exponential-periods to counterexample-proxy-first. | asserted | source record |
| Fixed-seed cyclicity loci for polynomial exponential periods | uses method | Structural compression | The method registry assigns cyclicity-loci-exponential-periods to structural-compression. | asserted | source record |
| Fixed-seed cyclic rank from inverse roots | uses method | Adversarial scientific controls | The method registry assigns cyclicity-root-span-low-rank to adversarial-controls. | asserted | source record |
| Fixed-seed cyclic rank from inverse roots | uses method | Productive failure and stop receipts | The method registry assigns cyclicity-root-span-low-rank to productive-failure. | asserted | source record |
| Fixed-seed cyclic rank from inverse roots | uses method | Explicit research-lineage reuse | The method registry assigns cyclicity-root-span-low-rank to research-lineage-reuse. | asserted | source record |
| Fixed-seed cyclic rank from inverse roots | uses method | Structural compression | The method registry assigns cyclicity-root-span-low-rank to structural-compression. | asserted | source record |
| Degree-difference principle and affine slices | uses method | Adversarial scientific controls | The method registry assigns degree-difference-affine-slices to adversarial-controls. | asserted | source record |
| Degree-difference principle and affine slices | uses method | Explicit research-lineage reuse | The method registry assigns degree-difference-affine-slices to research-lineage-reuse. | asserted | source record |
| Degree-difference principle and affine slices | uses method | Structural compression | The method registry assigns degree-difference-affine-slices to structural-compression. | asserted | source record |
| Erdős 848: exact answer for all N | uses method | Adversarial scientific controls | The method registry assigns erdos-848-all-n to adversarial-controls. | asserted | source record |
| Erdős 848: exact answer for all N | uses method | Agent-readable research objects | The method registry assigns erdos-848-all-n to agent-readable-research-object. | asserted | source record |
| Erdős 848: exact answer for all N | uses method | Certificate-first, proof-carrying research | The method registry assigns erdos-848-all-n to certificate-first. | asserted | source record |
| Erdős 848: exact answer for all N | uses method | Exact regime stitching | The method registry assigns erdos-848-all-n to regime-stitching. | asserted | source record |
| Exact low-length Recht–Ré inequalities | uses method | Adversarial scientific controls | The method registry assigns exact-low-length-recht-re-inequalities to adversarial-controls. | asserted | source record |
| Exact low-length Recht–Ré inequalities | uses method | Certificate-first, proof-carrying research | The method registry assigns exact-low-length-recht-re-inequalities to certificate-first. | asserted | source record |
| Exact low-length Recht–Ré inequalities | uses method | Counterexample- and proxy-first analysis | The method registry assigns exact-low-length-recht-re-inequalities to counterexample-proxy-first. | asserted | source record |
| Exact low-length Recht–Ré inequalities | uses method | Exact regime stitching | The method registry assigns exact-low-length-recht-re-inequalities to regime-stitching. | asserted | source record |
| Exact Smith invariants of binary-form factorisation | uses method | Adversarial scientific controls | The method registry assigns exact-smith-invariants-affine-determinant-lines to adversarial-controls. | asserted | source record |
| Exact Smith invariants of binary-form factorisation | uses method | Agent-readable research objects | The method registry assigns exact-smith-invariants-affine-determinant-lines to agent-readable-research-object. | asserted | source record |
| Exact Smith invariants of binary-form factorisation | uses method | Assurance as a vector | The method registry assigns exact-smith-invariants-affine-determinant-lines to assurance-vector. | asserted | source record |
| Exact Smith invariants of binary-form factorisation | uses method | Certificate-first, proof-carrying research | The method registry assigns exact-smith-invariants-affine-determinant-lines to certificate-first. | asserted | source record |
| Exact Smith invariants of binary-form factorisation | uses method | Explicit research-lineage reuse | The method registry assigns exact-smith-invariants-affine-determinant-lines to research-lineage-reuse. | asserted | source record |
| Exact Smith invariants of binary-form factorisation | uses method | Structural compression | The method registry assigns exact-smith-invariants-affine-determinant-lines to structural-compression. | asserted | source record |
| Exotic affine three-spheres | uses method | Adversarial scientific controls | The method registry assigns exotic-affine-three-spheres to adversarial-controls. | asserted | source record |
| Exotic affine three-spheres | uses method | Counterexample- and proxy-first analysis | The method registry assigns exotic-affine-three-spheres to counterexample-proxy-first. | asserted | source record |
| Exotic affine three-spheres | uses method | Explicit research-lineage reuse | The method registry assigns exotic-affine-three-spheres to research-lineage-reuse. | asserted | source record |
| Exotic affine three-spheres | uses method | Structural compression | The method registry assigns exotic-affine-three-spheres to structural-compression. | asserted | source record |
| Frankl entropy concavity obstruction | uses method | Adversarial scientific controls | The method registry assigns frankl-concavity-obstruction to adversarial-controls. | asserted | source record |
| Frankl entropy concavity obstruction | uses method | Agent-readable research objects | The method registry assigns frankl-concavity-obstruction to agent-readable-research-object. | asserted | source record |
| Frankl entropy concavity obstruction | uses method | Assurance as a vector | The method registry assigns frankl-concavity-obstruction to assurance-vector. | asserted | source record |
| Frankl entropy concavity obstruction | uses method | Certificate-first, proof-carrying research | The method registry assigns frankl-concavity-obstruction to certificate-first. | asserted | source record |
| Frankl entropy concavity obstruction | uses method | Productive failure and stop receipts | The method registry assigns frankl-concavity-obstruction to productive-failure. | asserted | source record |
| Frankl entropy concavity obstruction | uses method | Structural compression | The method registry assigns frankl-concavity-obstruction to structural-compression. | asserted | source record |
| The full e=3 Polydegree column | uses method | Adversarial scientific controls | The method registry assigns full-e3-column-polydegree-conjecture to adversarial-controls. | asserted | source record |
| The full e=3 Polydegree column | uses method | Agent-readable research objects | The method registry assigns full-e3-column-polydegree-conjecture to agent-readable-research-object. | asserted | source record |
| The full e=3 Polydegree column | uses method | Assurance as a vector | The method registry assigns full-e3-column-polydegree-conjecture to assurance-vector. | asserted | source record |
| The full e=3 Polydegree column | uses method | Certificate-first, proof-carrying research | The method registry assigns full-e3-column-polydegree-conjecture to certificate-first. | asserted | source record |
| The full e=3 Polydegree column | uses method | Exact regime stitching | The method registry assigns full-e3-column-polydegree-conjecture to regime-stitching. | asserted | source record |
| The full e=3 Polydegree column | uses method | Explicit research-lineage reuse | The method registry assigns full-e3-column-polydegree-conjecture to research-lineage-reuse. | asserted | source record |
| The full e=3 Polydegree column | uses method | Structural compression | The method registry assigns full-e3-column-polydegree-conjecture to structural-compression. | asserted | source record |
| Furter's R(3) through n=299 | uses method | Adversarial scientific controls | The method registry assigns furter-r3-through-299 to adversarial-controls. | asserted | source record |
| Furter's R(3) through n=299 | uses method | Agent-readable research objects | The method registry assigns furter-r3-through-299 to agent-readable-research-object. | asserted | source record |
| Furter's R(3) through n=299 | uses method | Assurance as a vector | The method registry assigns furter-r3-through-299 to assurance-vector. | asserted | source record |
| Furter's R(3) through n=299 | uses method | Certificate-first, proof-carrying research | The method registry assigns furter-r3-through-299 to certificate-first. | asserted | source record |
| Furter's R(3) through n=299 | uses method | Counterexample- and proxy-first analysis | The method registry assigns furter-r3-through-299 to counterexample-proxy-first. | asserted | source record |
| Furter's R(3) through n=299 | uses method | Exact regime stitching | The method registry assigns furter-r3-through-299 to regime-stitching. | asserted | source record |
| Furter's R(3) through n=299 | uses method | Structural compression | The method registry assigns furter-r3-through-299 to structural-compression. | asserted | source record |
| Hahn--Ewens spectrum and mixing transition | uses method | Adversarial scientific controls | The method registry assigns hahn-ewens-mixing-theorem to adversarial-controls. | asserted | source record |
| Hahn--Ewens spectrum and mixing transition | uses method | Exact regime stitching | The method registry assigns hahn-ewens-mixing-theorem to regime-stitching. | asserted | source record |
| Hahn--Ewens spectrum and mixing transition | uses method | Structural compression | The method registry assigns hahn-ewens-mixing-theorem to structural-compression. | asserted | source record |
| Irreducible pushforwards and quartic transitions | uses method | Agent-readable research objects | The method registry assigns irreducible-pushforwards-quartic-transitions to agent-readable-research-object. | asserted | source record |
| Irreducible pushforwards and quartic transitions | uses method | Productive failure and stop receipts | The method registry assigns irreducible-pushforwards-quartic-transitions to productive-failure. | asserted | source record |
| Irreducible pushforwards and quartic transitions | uses method | Structural compression | The method registry assigns irreducible-pushforwards-quartic-transitions to structural-compression. | asserted | source record |
| Random reshuffling as a baseline policy | uses method | Agent-readable research objects | The method registry assigns random-reshuffling-baseline-policy to agent-readable-research-object. | asserted | source record |
| Random reshuffling as a baseline policy | uses method | Assurance as a vector | The method registry assigns random-reshuffling-baseline-policy to assurance-vector. | asserted | source record |
| Random reshuffling as a baseline policy | uses method | Certificate-first, proof-carrying research | The method registry assigns random-reshuffling-baseline-policy to certificate-first. | asserted | source record |
| Random reshuffling as a baseline policy | uses method | Certified decision margins | The method registry assigns random-reshuffling-baseline-policy to certified-decision-margin. | asserted | source record |
| Random reshuffling as a baseline policy | uses method | Counterexample- and proxy-first analysis | The method registry assigns random-reshuffling-baseline-policy to counterexample-proxy-first. | asserted | source record |
| Random reshuffling as a baseline policy | uses method | Productive failure and stop receipts | The method registry assigns random-reshuffling-baseline-policy to productive-failure. | asserted | source record |
| Random reshuffling as a baseline policy | uses method | Staged adoption and impact evaluation | The method registry assigns random-reshuffling-baseline-policy to staged-adoption-evaluation. | asserted | source record |
| Reducible incidence divisors | uses method | Counterexample- and proxy-first analysis | The method registry assigns reducible-incidence-divisors to counterexample-proxy-first. | asserted | source record |
| Reducible incidence divisors | uses method | Explicit research-lineage reuse | The method registry assigns reducible-incidence-divisors to research-lineage-reuse. | asserted | source record |
| Reducible incidence divisors | uses method | Structural compression | The method registry assigns reducible-incidence-divisors to structural-compression. | asserted | source record |
| What the site-frequency spectrum can and cannot say | uses method | Adversarial scientific controls | The method registry assigns sfs-identifiability-audit to adversarial-controls. | asserted | source record |
| What the site-frequency spectrum can and cannot say | uses method | Agent-readable research objects | The method registry assigns sfs-identifiability-audit to agent-readable-research-object. | asserted | source record |
| What the site-frequency spectrum can and cannot say | uses method | Assurance as a vector | The method registry assigns sfs-identifiability-audit to assurance-vector. | asserted | source record |
| What the site-frequency spectrum can and cannot say | uses method | Certificate-first, proof-carrying research | The method registry assigns sfs-identifiability-audit to certificate-first. | asserted | source record |
| What the site-frequency spectrum can and cannot say | uses method | Identification before estimation | The method registry assigns sfs-identifiability-audit to identification-gate. | asserted | source record |
| What the site-frequency spectrum can and cannot say | uses method | Partial identification and robust decisions | The method registry assigns sfs-identifiability-audit to partial-identification. | asserted | source record |
| Smooth-point certificates for Polydegree containments | uses method | Adversarial scientific controls | The method registry assigns smooth-point-certificates-polydegree-containments to adversarial-controls. | asserted | source record |
| Smooth-point certificates for Polydegree containments | uses method | Certificate-first, proof-carrying research | The method registry assigns smooth-point-certificates-polydegree-containments to certificate-first. | asserted | source record |
| Smooth-point certificates for Polydegree containments | uses method | Productive failure and stop receipts | The method registry assigns smooth-point-certificates-polydegree-containments to productive-failure. | asserted | source record |
| Smooth-point certificates for Polydegree containments | uses method | Exact regime stitching | The method registry assigns smooth-point-certificates-polydegree-containments to regime-stitching. | asserted | source record |
| Smooth-point certificates for Polydegree containments | uses method | Explicit research-lineage reuse | The method registry assigns smooth-point-certificates-polydegree-containments to research-lineage-reuse. | asserted | source record |
| Smooth-point certificates for Polydegree containments | uses method | Structural compression | The method registry assigns smooth-point-certificates-polydegree-containments to structural-compression. | asserted | source record |
| Stocks are not flows | uses method | Agent-readable research objects | The method registry assigns stocks-are-not-flows to agent-readable-research-object. | asserted | source record |
| Stocks are not flows | uses method | Assurance as a vector | The method registry assigns stocks-are-not-flows to assurance-vector. | asserted | source record |
| Stocks are not flows | uses method | Identification before estimation | The method registry assigns stocks-are-not-flows to identification-gate. | asserted | source record |
| Stocks are not flows | uses method | Partial identification and robust decisions | The method registry assigns stocks-are-not-flows to partial-identification. | asserted | source record |
| Stocks are not flows | uses method | Productive failure and stop receipts | The method registry assigns stocks-are-not-flows to productive-failure. | asserted | source record |
| TxGraffiti Conjecture 15/3 resolution | uses method | Adversarial scientific controls | The method registry assigns txgraffiti-c3-resolution to adversarial-controls. | asserted | source record |
| TxGraffiti Conjecture 15/3 resolution | uses method | Certificate-first, proof-carrying research | The method registry assigns txgraffiti-c3-resolution to certificate-first. | asserted | source record |
| TxGraffiti Conjecture 15/3 resolution | uses method | Counterexample- and proxy-first analysis | The method registry assigns txgraffiti-c3-resolution to counterexample-proxy-first. | asserted | source record |
| TxGraffiti Conjecture 15/3 resolution | uses method | Explicit research-lineage reuse | The method registry assigns txgraffiti-c3-resolution to research-lineage-reuse. | asserted | source record |
| When a unique answer is not an identified answer | uses method | Agent-readable research objects | The method registry assigns unique-answer-not-identified to agent-readable-research-object. | asserted | source record |
| When a unique answer is not an identified answer | uses method | Assurance as a vector | The method registry assigns unique-answer-not-identified to assurance-vector. | asserted | source record |
| When a unique answer is not an identified answer | uses method | Identification before estimation | The method registry assigns unique-answer-not-identified to identification-gate. | asserted | source record |
| When a unique answer is not an identified answer | uses method | Partial identification and robust decisions | The method registry assigns unique-answer-not-identified to partial-identification. | asserted | source record |
| VR2(K4) = 20 | uses method | Assurance as a vector | The method registry assigns vr2-k4-equals-20 to assurance-vector. | asserted | source record |
| VR2(K4) = 20 | uses method | Certificate-first, proof-carrying research | The method registry assigns vr2-k4-equals-20 to certificate-first. | asserted | source record |
| VR2(K4) = 20 | uses method | Explicit research-lineage reuse | The method registry assigns vr2-k4-equals-20 to research-lineage-reuse. | asserted | source record |
| Wales 20 mph casualty attribution | uses method | Adversarial scientific controls | The method registry assigns wales-20mph-casualty-attribution to adversarial-controls. | asserted | source record |
| Wales 20 mph casualty attribution | uses method | Agent-readable research objects | The method registry assigns wales-20mph-casualty-attribution to agent-readable-research-object. | asserted | source record |
| Wales 20 mph casualty attribution | uses method | Assurance as a vector | The method registry assigns wales-20mph-casualty-attribution to assurance-vector. | asserted | source record |
| Wales 20 mph casualty attribution | uses method | Counterexample- and proxy-first analysis | The method registry assigns wales-20mph-casualty-attribution to counterexample-proxy-first. | asserted | source record |
| Wales 20 mph casualty attribution | uses method | Identification before estimation | The method registry assigns wales-20mph-casualty-attribution to identification-gate. | asserted | source record |
| Wales 20 mph casualty attribution | uses method | Productive failure and stop receipts | The method registry assigns wales-20mph-casualty-attribution to productive-failure. | asserted | source record |
| z(20) = 6 (Erdős problem 758) | uses method | Adversarial scientific controls | The method registry assigns z20-equals-6 to adversarial-controls. | asserted | source record |
| z(20) = 6 (Erdős problem 758) | uses method | Agent-readable research objects | The method registry assigns z20-equals-6 to agent-readable-research-object. | asserted | source record |
| z(20) = 6 (Erdős problem 758) | uses method | Assurance as a vector | The method registry assigns z20-equals-6 to assurance-vector. | asserted | source record |
| z(20) = 6 (Erdős problem 758) | uses method | Certificate-first, proof-carrying research | The method registry assigns z20-equals-6 to certificate-first. | asserted | source record |
| z(20) = 6 (Erdős problem 758) | uses method | Explicit research-lineage reuse | The method registry assigns z20-equals-6 to research-lineage-reuse. | asserted | source record |
How to read the atlas
The atlas is a map of recorded relationships, not a ranking of papers and not a verdict on their claims. Release nodes have equal visual weight. The position of a node is a stable layout choice, not evidence of importance, influence, correctness or priority.
Three relationship states remain separate:
- Asserted — an Evidence Press source record explicitly declares the classification, citation or dependency.
- Computed — a deterministic rule has detected a structural pattern from declared inputs. Computed links are not scholarly assertions.
- Proposed — a person or agent has nominated a relationship for review. Proposed links are excluded from the accepted graph.
This first version contains asserted relationships only. It does not generate similarity links or hidden-dependency claims.
What the map distinguishes
A shared method, a broad cluster and a research lineage are different objects:
- A method edge says that a release illustrates a registered reusable method.
- A cluster edge records broad operational or thematic adjacency. It does not establish dependency or common provenance.
- A lineage edge records an evidence-backed research programme. Reuse within a lineage is correlated evidence, not independent confirmation.
- A parent edge records an inherited result or method and carries the parent's stated assurance ceiling.
- An internal citation edge records that one release names another as related work; it does not by itself establish agreement, priority or dependence.
The registry is explicitly a working taxonomy. The default Programme view excludes method-assignment edges, but it still mixes registry-derived cluster and lineage membership with direct inter-release citations, extensions and reuse; the status line and relationship register give the exact composition. A non-root release enters an evidence-backed lineage only when its metadata declares both the reciprocal lineage identifier and an evidential parent link. A parent link alone is not lineage membership.
Select any node or connection in the interactive map to inspect its basis, inference limit and exact source record.
An accessible and agent-readable instrument
The synchronized relationship register below the map contains the same accepted edges in a conventional table. It remains usable without JavaScript and is the nonvisual alternative to the SVG map.
Agents should retrieve research-graph.json and validate it against research-graph.schema.json. The API publishes stable node identifiers, content-derived edge identifiers, statement fingerprints, relationship status, source pointers and inference limits.
The current priorities, readiness gates and periodic review checklist are published in the Atlas roadmap, validated against its roadmap schema. The human-readable design record remains in the public repository.
The discovery layer
The next research stage can compare release statements, dependencies, citations and methods to nominate previously unrecorded connections. Those candidates should enter the proposal register, with an explanation and supporting sources, rather than appear as facts.
Useful candidate types may include a shared lemma under different notation, an unacknowledged antecedent, a common unresolved assumption, a reusable verifier, or two negative results that block the same strategy. A candidate becomes asserted only after additive review against resolvable evidence. Rejected and superseded proposals should remain available as negative knowledge.
The next implementation step is a fail-closed proposal-intake and review-receipt layer. Relationship-discovery experiments should follow only after proposals can be retained, rejected, superseded and audited without entering the accepted graph.
Safe reuse
Start from the selected release page and its archived evidence package. Carry the release's status and assurance boundaries into downstream work. A graph edge can lower discovery cost; it cannot substitute for reading the connected claims, checking their semantic bridge or reproducing their evidence.