| { |
| "status": "pass", |
| "n_checks": 11, |
| "checks": [ |
| { |
| "check": "strict_json_and_finite_values", |
| "status": "pass", |
| "detail": "statistics.json is strict and finite" |
| }, |
| { |
| "check": "input_fingerprints", |
| "status": "pass", |
| "detail": "all six frozen input SHA-256 hashes match" |
| }, |
| { |
| "check": "heldout_graph_design", |
| "status": "pass", |
| "detail": "all methods have 50 prompts \u00d7 4 cross-phrasing edges; Jacobian exceeds its null" |
| }, |
| { |
| "check": "lens_and_graph_sensitivity", |
| "status": "pass", |
| "detail": "lens edge Jaccard 0.980\u20131.000; mutual edges are more homophilic" |
| }, |
| { |
| "check": "relation_edge_invariants", |
| "status": "pass", |
| "detail": "1,440 audited edges: two per source, cross-variant, same-family, different material case" |
| }, |
| { |
| "check": "reported_precision_recalculation", |
| "status": "pass", |
| "detail": "all ten graph precisions exactly match row-level selected edges" |
| }, |
| { |
| "check": "case_preserving_exact_null", |
| "status": "pass", |
| "detail": "all fixed graphs use 46,656 balanced case-level assignments; Jacobian p<0.05" |
| }, |
| { |
| "check": "complete_candidate_rankings", |
| "status": "pass", |
| "detail": "1,440 three-candidate rankings audited; Jacobian AUC and every leave-one-family-out AUC exceed chance" |
| }, |
| { |
| "check": "surface_form_falsification", |
| "status": "pass", |
| "detail": "all four counterfactual crossings are \u226575% and BH q<0.05; opposite-order edges are more accurate" |
| }, |
| { |
| "check": "artifact_baselines", |
| "status": "pass", |
| "detail": "answer-order-only is below chance; numeric-direction oracle is the 100% ceiling" |
| }, |
| { |
| "check": "figure_artifacts", |
| "status": "pass", |
| "detail": "all three figures exist as non-empty PNG, PDF, and SVG" |
| } |
| ], |
| "audited_artifacts": { |
| "experiments/graph-topology-rigorous-2026-07-17/statistics.json": "d6dbfd153ee5d8ca99ac384dbdd341a6eeebb6f9787e74d571970af555729a1f", |
| "experiments/graph-topology-rigorous-2026-07-17/replication_relation_graph_selected_edges.csv": "3b1c102bea1df782df6a5ab45a18f1e02d13943228ba48d99130b01460e4b1e6", |
| "experiments/graph-topology-rigorous-2026-07-17/replication_relation_candidate_ranks.csv": "167eec3b5f080fe50dc03946d4e66ec624c240a00c07b97ac0b8789a0e9441af", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/mechanism-graph-evidence.png": "78be5ef75a7ada8465224dadf4336b048a01d1743262334ad5d3699c03ad7d23", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/mechanism-graph-evidence.pdf": "f8dc7c4a233828d60a9404992d1fefacbf543963c8602063ef16e4a0e22ad31e", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/mechanism-graph-evidence.svg": "57867c80126510d3415181b7fa41a6e30c35d140db9804fd27d5cee104eb3a4a", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/relation-graph-falsification.png": "321ef0152d31375a21e3642aedd830cc0de1274bb4ab6e2f631501f60964fe1b", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/relation-graph-falsification.pdf": "93cfe014fbb0775be450d46df82141c081c3dc077ed07ac3512d249ca4808c61", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/relation-graph-falsification.svg": "b45cc3451af33fa8ada88f7c28c1a2f03e2b5613b7b0a7eea9325a6ed9fd6f78", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/relation-ranking-robustness.png": "c6c489f9e8fc8ed285cd0c9d86ce5272a44e92eb96646fe202c9cfedb98d4cdf", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/relation-ranking-robustness.pdf": "c9104aafa3600fcd6caafdb2199ce06d62032568097b32320a2743b77dd4b6ab", |
| "experiments/graph-topology-rigorous-2026-07-17/figures/relation-ranking-robustness.svg": "4c594029453dce7a5247d46aede1b7457560c6ed7dc2d2058a20733a84404695" |
| } |
| } |
|
|
