{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:C4WFFQB3LA2UGTMRNZ4B6RMMFD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2a84312a414541211905507e3f056935936770ce587ba254f6110f374e3e66a6","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-16T13:43:57Z","title_canon_sha256":"3dae47c10513ca7b75122c5fd34c682a5b0473f0f4118990ac3811a7c9175355"},"schema_version":"1.0","source":{"id":"2605.16995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16995","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16995v1","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16995","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"C4WFFQB3LA2U","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"pith_short_16","alias_value":"C4WFFQB3LA2UGTMR","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"pith_short_8","alias_value":"C4WFFQB3","created_at":"2026-05-20T00:03:35Z"}],"graph_snapshots":[{"event_id":"sha256:1932c527c2a12a5a463aa1300f4e7026d404634aae17c687fa2ac5604400cc63","target":"graph","created_at":"2026-05-20T00:03:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For every even order p ≥ 4 the construction produces explicit Runge-Kutta methods with stage number s(p) = (p² - 2p + 8)/4; the Q/D conditions together with B(p) are sufficient to guarantee order p."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The Q- and D-space residual conditions remain linearly independent and the two structured linear systems at each recursive step remain solvable for the chosen stage count; this is invoked when the authors state that the Butcher coefficients are obtained from the two linear systems (abstract and §3-4)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A Q/D-space reformulation of Butcher simplifying assumptions yields sufficient order conditions and a recursive linear-system construction for explicit Runge-Kutta methods of even order p with s(p)=(p²-2p+8)/4 stages."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A Q/D-space reformulation of order conditions yields explicit Runge-Kutta methods of even order p with stage count (p squared minus 2p plus 8) over 4."}],"snapshot_sha256":"831c4c4a95b4b267bf71b4956d8c0c92f4b9927313fabbc14cc13e07a3bceffc"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ea07115783fc62ad7578425c7976b92e521272d5338a3ff29e24f845dd6ef11f"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T19:50:02.541722Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.903645Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T19:23:36.219732Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:20:41.580946Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.203358Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.292561Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16995/integrity.json","findings":[],"snapshot_sha256":"11084f1a2023915264a62f51cbf3fd6a69dcb725119e6b32614e4bb0267de02a","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constructing explicit Runge--Kutta (ERK) methods with as few stages as possible for a given order is a classical problem in numerical analysis. In this work, we introduce a $Q$/$D$-space framework of sufficient order conditions for ERK methods. This framework generalizes Butcher's classical simplifying assumptions by reformulating them in terms of simplified $Q$- and $D$-spaces defined through their residual vectors. It yields sufficient conditions which, together with $B(p)$, ensure order $p$. It also leads to a recursive construction procedure for ERK methods of arbitrary even order, in whic","authors_text":"Jizu Huang, Junyuan He","cross_cats":["cs.NA"],"headline":"A Q/D-space reformulation of order conditions yields explicit Runge-Kutta methods of even order p with stage count (p squared minus 2p plus 8) over 4.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-16T13:43:57Z","title":"Low Stage High Order Explicit Runge--Kutta Methods via Q- and D-Conditions: General Theory and Efficient Recursive Construction"},"references":{"count":38,"internal_anchors":2,"resolved_work":38,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Tensor networks and hi- erarchical tensors for the solution of high-dimensional partial diﬀerential equations","work_id":"d76da37e-686c-42a4-b34f-1d755f4e8335","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Counting Rooted Trees: The Universal Law t(n) ∼ Cρ −nn−3/2","work_id":"3ea2841b-af68-4a37-b34f-14e426b230ac","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A 3(2) pair of Runge-Kutta formulas","work_id":"f7f109bd-db00-4b17-87fc-e70545239090","year":1989},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Coeﬃcients for the study of Runge-Kutta integration processes","work_id":"5f755197-c7e6-41fa-ac35-0e57a0ad145a","year":1963},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Implicit runge-kutta processes","work_id":"e50396ab-86cd-429e-a810-3c13ce531974","year":1964}],"snapshot_sha256":"c7a439d78e520a819f3e184cc32c4fc9e49ffec5e4484afceb6fb3734d10912b"},"source":{"id":"2605.16995","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:10:04.663515Z","id":"bc09107e-a7cd-46b6-988f-97d5e1aa5a20","model_set":{"reader":"grok-4.3"},"one_line_summary":"A Q/D-space reformulation of Butcher simplifying assumptions yields sufficient order conditions and a recursive linear-system construction for explicit Runge-Kutta methods of even order p with s(p)=(p²-2p+8)/4 stages.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A Q/D-space reformulation of order conditions yields explicit Runge-Kutta methods of even order p with stage count (p squared minus 2p plus 8) over 4.","strongest_claim":"For every even order p ≥ 4 the construction produces explicit Runge-Kutta methods with stage number s(p) = (p² - 2p + 8)/4; the Q/D conditions together with B(p) are sufficient to guarantee order p.","weakest_assumption":"The Q- and D-space residual conditions remain linearly independent and the two structured linear systems at each recursive step remain solvable for the chosen stage count; this is invoked when the authors state that the Butcher coefficients are obtained from the two linear systems (abstract and §3-4)."}},"verdict_id":"bc09107e-a7cd-46b6-988f-97d5e1aa5a20"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:046555ac17b425cb044e7102b27769ca8e13b6015c503d00195853a5f784b34d","target":"record","created_at":"2026-05-20T00:03:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2a84312a414541211905507e3f056935936770ce587ba254f6110f374e3e66a6","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-16T13:43:57Z","title_canon_sha256":"3dae47c10513ca7b75122c5fd34c682a5b0473f0f4118990ac3811a7c9175355"},"schema_version":"1.0","source":{"id":"2605.16995","kind":"arxiv","version":1}},"canonical_sha256":"172c52c03b5835434d916e781f458c28c1adfdb856e7e417c9b813b8c21ff9c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"172c52c03b5835434d916e781f458c28c1adfdb856e7e417c9b813b8c21ff9c7","first_computed_at":"2026-05-20T00:03:35.030479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:35.030479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8DaOPqlb6WATG+V+BeF+zQfPPdonj5bQIS2o3gfDppog8pxHBINgJMgTVDr+AjllpRrchCVfNRk8jcxQ3prDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:35.031295Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:046555ac17b425cb044e7102b27769ca8e13b6015c503d00195853a5f784b34d","sha256:1932c527c2a12a5a463aa1300f4e7026d404634aae17c687fa2ac5604400cc63"],"state_sha256":"eb97234150b7b0b5e6a37f432daab5bf0ab609225de10d15af501f6ce3f57eb7"}