{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q4EHHSGG73JSAWOA6KDDBKOSLS","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e99c732f708fe0c9cf94b647d12ef948594ac89e9cc1bf9627a3bff2039959bd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-16T05:27:48Z","title_canon_sha256":"47c4fac98caf69df67cb0d2ec4e9d7204b1f10262ca9b35524fd6612a91d6a80"},"schema_version":"1.0","source":{"id":"2605.16820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16820","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16820v1","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16820","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"Q4EHHSGG73JS","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q4EHHSGG73JSAWOA","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q4EHHSGG","created_at":"2026-05-20T00:03:24Z"}],"graph_snapshots":[{"event_id":"sha256:8793be12a2d93a44990aa9d563a677a82ae99062fbdcec731eb71d5f52bc8cb5","target":"graph","created_at":"2026-05-20T00:03:24Z","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":"We present a novel decision procedure for the theory of arrays with constant arrays that supports arbitrary index domains and is not limited to the infinite case. We present our procedure as an abstract calculus and show its refutational and satisfiability soundness."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The abstract calculus correctly captures the semantics of constant arrays over finite index domains without requiring additional restrictions or losing completeness, in contrast to prior procedures limited to infinite domains."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A novel decision procedure for extensional arrays with constant arrays over arbitrary index domains, presented as a refutationally and satisfiability sound abstract calculus and implemented in Bitwuzla."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A decision procedure for the theory of arrays with constant arrays supports arbitrary index domains including finite ones."}],"snapshot_sha256":"1c77e74d1c9b0a8cdc8aaedaa4854dc379587699eb5086c35c23f93467000621"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"de75240c85b13ebc2b1131a06082a14fce9aaa5968da540ed6f14368f633ffb0"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.023621Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T20:00:51.596833Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.269430Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.410238Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16820/integrity.json","findings":[{"audited_at":"2026-05-19T20:00:51.596833Z","detected_arxiv_id":null,"detected_doi":"10.34727/2025/ISBN.978-3-85448-084-66","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.34727/2025/ISBN.978-3-85448-084-66) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":11,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"7445854fe3f1a249c3cb2fddbb5ce7aef717c60ca401e9932bfcfe6ddef8c10f","summary":{"advisory":1,"by_detector":{"doi_compliance":{"advisory":1,"critical":0,"informational":0,"total":1}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reasoning about array data structures is a key requirement for many applications in hardware and software verification, especially in combination with machine integers. The Satisfiability Modulo Theories (SMT) theory of extensional arrays provides array read and write operators and allows extensionality over arrays. This is sufficient to express many aspects of computer-aided verification, but lacks succinctness to efficiently deal with arrays that are initialized with a default value. Existing procedures for extending the SMT-LIB theory of arrays with support for constant arrays are limited t","authors_text":"Aina Niemetz, Clark Barrett, Mathias Preiner","cross_cats":[],"headline":"A decision procedure for the theory of arrays with constant arrays supports arbitrary index domains including finite ones.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-16T05:27:48Z","title":"Satisfiability Modulo Extensional Constant Arrays (Extended Version)"},"references":{"count":35,"internal_anchors":0,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"https://fmv.jku.at/hwmcc19/ (2019)","work_id":"8c08d5e0-1b82-4558-8c0f-cd8643548013","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"https://hwmcc.github.io/2020/ (2020)","work_id":"e60332a6-9ea2-4e41-aeee-6fc164ccf3ed","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"https://github.com/bitwuzla/bitwuzla/ (2026)","work_id":"c02c0d19-1abd-4010-bbd1-c1fcfb23cfb6","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"hevm symbolic execution engine SMT queries (2026), https://github.com/SMT-LIB/pending-benchmarks/commit/ 0a87f2c7581a3df7ad0f2d7b57621b6ecf4637ad","work_id":"b706473d-3888-4365-8637-e2a56b45945a","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"https://github.com/Z3Prover/z3/ (2026)","work_id":"dc2e70c9-418e-4741-b14c-a944a47c827c","year":2026}],"snapshot_sha256":"95c2d49311758f8612f95e0a31a26a47079b108365efcfe0ae24f9ff0322ec8c"},"source":{"id":"2605.16820","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:47:50.851350Z","id":"c837a903-87cd-4ea0-aae3-c5dcabef18d4","model_set":{"reader":"grok-4.3"},"one_line_summary":"A novel decision procedure for extensional arrays with constant arrays over arbitrary index domains, presented as a refutationally and satisfiability sound abstract calculus and implemented in Bitwuzla.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A decision procedure for the theory of arrays with constant arrays supports arbitrary index domains including finite ones.","strongest_claim":"We present a novel decision procedure for the theory of arrays with constant arrays that supports arbitrary index domains and is not limited to the infinite case. We present our procedure as an abstract calculus and show its refutational and satisfiability soundness.","weakest_assumption":"The abstract calculus correctly captures the semantics of constant arrays over finite index domains without requiring additional restrictions or losing completeness, in contrast to prior procedures limited to infinite domains."}},"verdict_id":"c837a903-87cd-4ea0-aae3-c5dcabef18d4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61675c60d915db4fc14522616521a306eea33d4b8956a5e9ea31db8b2851cc4b","target":"record","created_at":"2026-05-20T00:03:24Z","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":"e99c732f708fe0c9cf94b647d12ef948594ac89e9cc1bf9627a3bff2039959bd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-16T05:27:48Z","title_canon_sha256":"47c4fac98caf69df67cb0d2ec4e9d7204b1f10262ca9b35524fd6612a91d6a80"},"schema_version":"1.0","source":{"id":"2605.16820","kind":"arxiv","version":1}},"canonical_sha256":"870873c8c6fed32059c0f28630a9d25c80cedb9903530f2e96aa5f0915055080","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"870873c8c6fed32059c0f28630a9d25c80cedb9903530f2e96aa5f0915055080","first_computed_at":"2026-05-20T00:03:24.325039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:24.325039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sGgU5M6/AqD7NKU7/DaManx/YlcH5hpPY6mU3tca7S6lCTBF1kWNpgmw9XBQUGphYdg8Wg9FfgSCNU2KOAP7Aw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:24.326014Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16820","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:01467a0fccb9d3fbd731930844c443ed478b4a41c0b194aa0d85236d24764766","sha256:b344d2a9598420e6f7594356e4aa6a5594dde47487fb1a3acda7f619adcfefe0"]}],"invalid_events":[],"applied_event_ids":["sha256:61675c60d915db4fc14522616521a306eea33d4b8956a5e9ea31db8b2851cc4b","sha256:8793be12a2d93a44990aa9d563a677a82ae99062fbdcec731eb71d5f52bc8cb5"],"state_sha256":"68e2c0555fc9592c49391c7b3b6e1eeac328f282dd17ba8f13b0fd7d7bf97e99"}