{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RVMQBTV6EA262AXV3Y3OTTMIYI","short_pith_number":"pith:RVMQBTV6","schema_version":"1.0","canonical_sha256":"8d5900cebe2035ed02f5de36e9cd88c228122a9d70632979e062f2e9ba5ba700","source":{"kind":"arxiv","id":"2603.25414","version":4},"attestation_state":"computed","paper":{"title":"Decidable By Construction: Design-Time Verification for Trustworthy AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"AI model properties for stability and correctness reduce to decidable constraints over abelian groups, allowing verification before training.","cross_cats":["cs.AI","cs.LG","cs.LO"],"primary_cat":"cs.PL","authors_text":"Houston Haynes","submitted_at":"2026-03-26T13:09:36Z","abstract_excerpt":"A prevailing assumption in machine learning is that model correctness must be enforced after the fact. We observe that the properties determining whether an AI model is numerically stable, computationally correct, or consistent with a physical domain do not necessarily demand post hoc enforcement. They can be verified at design time, before training begins, at marginal computational cost, with particular relevance to models deployed in high-leverage decision support and scientifically constrained settings. These properties share a specific algebraic structure: they are expressible as constrain"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2603.25414","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-03-26T13:09:36Z","cross_cats_sorted":["cs.AI","cs.LG","cs.LO"],"title_canon_sha256":"a70bb953913038e9c15ac51b42f710950c9072eb23bda861a8a94280cb010777","abstract_canon_sha256":"1656f01237d476718a5865e8ba9e77c0aadbba92ce585a077c58ad49660b3549"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:57.343463Z","signature_b64":"j6USd3Tv1K5gwMMz1EctsNobGpeJ0VZ9oZmNZhpOyPIVMuaRG+CDOl5PEPX9zIcw9jbQa3p9f23Z1FxgAnZuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d5900cebe2035ed02f5de36e9cd88c228122a9d70632979e062f2e9ba5ba700","last_reissued_at":"2026-06-19T16:09:57.343028Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:57.343028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decidable By Construction: Design-Time Verification for Trustworthy AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"AI model properties for stability and correctness reduce to decidable constraints over abelian groups, allowing verification before training.","cross_cats":["cs.AI","cs.LG","cs.LO"],"primary_cat":"cs.PL","authors_text":"Houston Haynes","submitted_at":"2026-03-26T13:09:36Z","abstract_excerpt":"A prevailing assumption in machine learning is that model correctness must be enforced after the fact. We observe that the properties determining whether an AI model is numerically stable, computationally correct, or consistent with a physical domain do not necessarily demand post hoc enforcement. They can be verified at design time, before training begins, at marginal computational cost, with particular relevance to models deployed in high-leverage decision support and scientifically constrained settings. These properties share a specific algebraic structure: they are expressible as constrain"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Hindley-Milner unification over abelian groups computes the maximum a posteriori hypothesis under a computable restriction of Solomonoff's universal prior, placing the framework's type inference on the same formal ground as universal induction.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the properties determining numerical stability, computational correctness, and physical consistency in AI models are expressible as constraints over finitely generated abelian groups Z^n where inference is decidable in polynomial time and the principal type is unique.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A type system over finitely generated abelian groups enables design-time verification of AI model properties and links Hindley-Milner unification to a restriction of Solomonoff's universal prior.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"AI model properties for stability and correctness reduce to decidable constraints over abelian groups, allowing verification before training.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a7b9b858b8d8c3597c5e7f432d560dc9a590a5a56a3186028fdfef6721573f1a"},"source":{"id":"2603.25414","kind":"arxiv","version":4},"verdict":{"id":"71dea383-9306-44b6-9f5c-70bc004c3c15","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T00:40:52.634725Z","strongest_claim":"Hindley-Milner unification over abelian groups computes the maximum a posteriori hypothesis under a computable restriction of Solomonoff's universal prior, placing the framework's type inference on the same formal ground as universal induction.","one_line_summary":"A type system over finitely generated abelian groups enables design-time verification of AI model properties and links Hindley-Milner unification to a restriction of Solomonoff's universal prior.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the properties determining numerical stability, computational correctness, and physical consistency in AI models are expressible as constraints over finitely generated abelian groups Z^n where inference is decidable in polynomial time and the principal type is unique.","pith_extraction_headline":"AI model properties for stability and correctness reduce to decidable constraints over abelian groups, allowing verification before training."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.25414/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.25414","created_at":"2026-06-19T16:09:57.343081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.25414v4","created_at":"2026-06-19T16:09:57.343081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.25414","created_at":"2026-06-19T16:09:57.343081+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVMQBTV6EA26","created_at":"2026-06-19T16:09:57.343081+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVMQBTV6EA262AXV","created_at":"2026-06-19T16:09:57.343081+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVMQBTV6","created_at":"2026-06-19T16:09:57.343081+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI","json":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI.json","graph_json":"https://pith.science/api/pith-number/RVMQBTV6EA262AXV3Y3OTTMIYI/graph.json","events_json":"https://pith.science/api/pith-number/RVMQBTV6EA262AXV3Y3OTTMIYI/events.json","paper":"https://pith.science/paper/RVMQBTV6"},"agent_actions":{"view_html":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI","download_json":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI.json","view_paper":"https://pith.science/paper/RVMQBTV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.25414&json=true","fetch_graph":"https://pith.science/api/pith-number/RVMQBTV6EA262AXV3Y3OTTMIYI/graph.json","fetch_events":"https://pith.science/api/pith-number/RVMQBTV6EA262AXV3Y3OTTMIYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI/action/storage_attestation","attest_author":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI/action/author_attestation","sign_citation":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI/action/citation_signature","submit_replication":"https://pith.science/pith/RVMQBTV6EA262AXV3Y3OTTMIYI/action/replication_record"}},"created_at":"2026-06-19T16:09:57.343081+00:00","updated_at":"2026-06-19T16:09:57.343081+00:00"}