| { |
| "claims": [ |
| { |
| "assessment": "verified", |
| "claim": 1, |
| "literal_claim": "Definition 1 formalizes an evolutionary selection model as a DAG G^(T) over trait variables X^(0)...X^(T), heritable factors epsilon^(0)...epsilon^(T), and reproduction/selection indicators S^(0)...S^(T-1), distinguishing it from one-shot static selection models (Section 2, Definition 1).", |
| "result": "26,064/26,064 exhaustive Definition-1 constructions were acyclic and matched both count formulae and all four edge families; 60/60 larger constructions also passed." |
| }, |
| { |
| "assessment": "verified", |
| "claim": 2, |
| "literal_claim": "Lemma 1 shows that repeated evolutionary selection induces conditional dependencies among variables that are absent under static selection models, so applying static-selection graphical models to evolutionary data can yield false causal discoveries (Section 2, Lemma 1).", |
| "result": "Lemma 1 had 0 violations in 1,433,520 exact relations and 17,712 witnesses of dependencies absent from the static graph; native PC found 46 spurious adjacencies with evolution versus 8 without selection." |
| }, |
| { |
| "assessment": "verified", |
| "claim": 3, |
| "literal_claim": "Theorem 1 proves that the clique-augmented DAG G^+ (Definition 2) fully captures all d-separation/conditional-independence constraints implied by the evolutionary selection model, without needing to explicitly model the selection variables (Section 3, Definition 2, Theorem 1).", |
| "result": "G^(T) and G^+ agreed on all 1,433,520 exact d-separation relations; deleting the selection clique caused 98,787 mismatches." |
| }, |
| { |
| "assessment": "verified", |
| "claim": 4, |
| "literal_claim": "Theorem 2 establishes that applying standard constraint-based algorithms such as PC or GES (Algorithm 1) to G^+ is sound and complete: oriented edges correspond to true causal relations, while unoriented edges may reflect the presence of selection (Section 3, Theorem 2, Algorithm 1).", |
| "result": "Across 8,688 exact models, all 52,128 adjacency checks, 2,640 orientation checks, and 39,030 completeness checks passed with 0 violations." |
| }, |
| { |
| "assessment": "verified", |
| "claim": 5, |
| "literal_claim": "Theorem 4 shows that combining heterogeneous data from multiple environments/domains via the CDNOD-based procedure (Algorithm 2) improves identifiability of the evolutionary selection model compared to single-environment data (Section 4, Theorem 4, Algorithm 2).", |
| "result": "Across 269,328 model/change-set configurations, multi-domain identification lost 0 single-domain orientations and was strictly better in 88,176 (32.74%); native CDNOD oriented 4.65 correct edges versus 3.55 for single-domain PC." |
| }, |
| { |
| "assessment": "falsified_as_literally_registered", |
| "claim": 6, |
| "literal_claim": "The proposed identification procedure is validated on synthetic graphs of varying size and on seven real-world datasets spanning biology, agriculture, and social science (Section 5).", |
| "result": "The 750-run native synthetic grid found oriented-only PC precision above the standard interpretation in only 3/15 cells and 0/5 d=20 cells; the 626x8 PanTHERIA rerun gave oriented precision 0.40 versus unoriented 1.00, while all seven paper tables had 0 arithmetic mismatches." |
| } |
| ], |
| "paper_id": "mOcTXKawFY" |
| } |
|
|
