{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FWVHGGPM56ZMNGMNVXK33XSEGY","short_pith_number":"pith:FWVHGGPM","canonical_record":{"source":{"id":"2605.23022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-21T20:47:07Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"098d2c4deac02649ef98808f6ab054c87f0e4a14b136247ffea9cf26b5fbf6a7","abstract_canon_sha256":"a1b4cf6e56c5d85dbc0d1ec733c09515bcd4431b43cd4cf5480cdfdb342ddc84"},"schema_version":"1.0"},"canonical_sha256":"2daa7319ecefb2c6998dadd5bdde44363cf1f70b599abb6bf144148732f2aa4c","source":{"kind":"arxiv","id":"2605.23022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23022","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23022v1","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23022","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"FWVHGGPM56ZM","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"pith_short_16","alias_value":"FWVHGGPM56ZMNGMN","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"pith_short_8","alias_value":"FWVHGGPM","created_at":"2026-05-25T02:01:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FWVHGGPM56ZMNGMNVXK33XSEGY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.23022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-21T20:47:07Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"098d2c4deac02649ef98808f6ab054c87f0e4a14b136247ffea9cf26b5fbf6a7","abstract_canon_sha256":"a1b4cf6e56c5d85dbc0d1ec733c09515bcd4431b43cd4cf5480cdfdb342ddc84"},"schema_version":"1.0"},"canonical_sha256":"2daa7319ecefb2c6998dadd5bdde44363cf1f70b599abb6bf144148732f2aa4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:35.054510Z","signature_b64":"5pVh/TsWb3mWy6idtzsP13N6ydnxmMKPWw9qd2pH8twFHXPI9AFfZuBpx1R9NKYWr7x50w96g+8lrMRTnhfzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2daa7319ecefb2c6998dadd5bdde44363cf1f70b599abb6bf144148732f2aa4c","last_reissued_at":"2026-05-25T02:01:35.053835Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:35.053835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.23022","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuc/39QWeEvgzN0y4fa9gtnu1N9bm+nSG01Dd4TNvKuQ34BbDVW8EH6bQVlQ73KTyoMutlV3FQGBkiEWB+zZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:36:06.307344Z"},"content_sha256":"b619a393431c26cfa50f4717f986895d8124a2b9e3ec8c8ca0fcd6ddebb0b2c7","schema_version":"1.0","event_id":"sha256:b619a393431c26cfa50f4717f986895d8124a2b9e3ec8c8ca0fcd6ddebb0b2c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FWVHGGPM56ZMNGMNVXK33XSEGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complete first-order reasoning for functional programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Adithya Murali, Lucas Pe\\~na, P. Madhusudan, Ranjit Jhala","submitted_at":"2026-05-21T20:47:07Z","abstract_excerpt":"Several practical tools for automatically verifying functional programs (e.g., Liquid Haskell and Leon for Scala programs) rely on a heuristic based on unrolling recursive function definitions followed by quantifier-free reasoning using SMT solvers. We uncover foundational theoretical properties of this heuristic, revealing that it can be generalized and formalized as a technique that is in fact complete for reasoning with combined First-Order theories of algebraic datatypes and background theories, where background theories support decidable quantifier-free reasoning. The theory developed in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23022","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.23022/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/DKr9InOt5Nrr1+EnG7DuN3y5PLDE8rC3wEfcvBebIxBbqwwqPgvGVAgL8mDOaqx8G3MuZ+ao4QXzQkSfnkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:36:06.308083Z"},"content_sha256":"0c51516573d4b59088a23ca171176e0dd97e3299caa46018c8b7a79e23113ecf","schema_version":"1.0","event_id":"sha256:0c51516573d4b59088a23ca171176e0dd97e3299caa46018c8b7a79e23113ecf"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FWVHGGPM56ZMNGMNVXK33XSEGY","target":"integrity","payload":{"note":"Identifier '10.5555/1939141.1939161' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"K. Rustan M. Leino. 2010. Dafny: An Automatic Program Verifier for Functional Correctness. InProceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning(Dakar, Senegal)(LPAR’10). Springe","arxiv_id":"2605.23022","detector":"doi_compliance","evidence":{"doi":"10.5555/1939141.1939161","arxiv_id":null,"ref_index":51,"raw_excerpt":"K. Rustan M. Leino. 2010. Dafny: An Automatic Program Verifier for Functional Correctness. InProceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning(Dakar, Senegal)(LPAR’10). Springer-Verlag, Berlin, Heidelberg, 348–370. doi:10.5555/1939141.1939161","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":51,"audited_at":"2026-05-25T05:20:08.493970Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/1939141.1939161","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"23cbe7f0c3c81309641b506803e2668b764db22defb7ace97577c21012cb8d94","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7393,"payload_sha256":"375b90307a470b3787bd75326c683e71b9bfd74c5de3d37dabc6763cf77c4b66","signature_b64":"rMkN4izt/7he1QvpxeQ1LPqGV8yKgpkIHZnHItX2ADL1Al9zdBp/m2ZW1hu9o8+u8FryQp9Lr0bzoslCgv3+BA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T05:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+v3u/qNXn2g9i56MKsWQF0CjlZIKevIeKEABk88ZM75/zNGmjOVnCM0lVCYwfDc0Y15wHTuydOMg9ZJEbynCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:36:06.309591Z"},"content_sha256":"dfaf6d2515bcee854cf278499a77acf90c81f570a38f713f00a1c1e2d1fa28f6","schema_version":"1.0","event_id":"sha256:dfaf6d2515bcee854cf278499a77acf90c81f570a38f713f00a1c1e2d1fa28f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/bundle.json","state_url":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T01:36:06Z","links":{"resolver":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY","bundle":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/bundle.json","state":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FWVHGGPM56ZMNGMNVXK33XSEGY","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a1b4cf6e56c5d85dbc0d1ec733c09515bcd4431b43cd4cf5480cdfdb342ddc84","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-21T20:47:07Z","title_canon_sha256":"098d2c4deac02649ef98808f6ab054c87f0e4a14b136247ffea9cf26b5fbf6a7"},"schema_version":"1.0","source":{"id":"2605.23022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23022","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23022v1","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23022","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"FWVHGGPM56ZM","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"pith_short_16","alias_value":"FWVHGGPM56ZMNGMN","created_at":"2026-05-25T02:01:35Z"},{"alias_kind":"pith_short_8","alias_value":"FWVHGGPM","created_at":"2026-05-25T02:01:35Z"}],"graph_snapshots":[{"event_id":"sha256:0c51516573d4b59088a23ca171176e0dd97e3299caa46018c8b7a79e23113ecf","target":"graph","created_at":"2026-05-25T02:01: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.23022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Several practical tools for automatically verifying functional programs (e.g., Liquid Haskell and Leon for Scala programs) rely on a heuristic based on unrolling recursive function definitions followed by quantifier-free reasoning using SMT solvers. We uncover foundational theoretical properties of this heuristic, revealing that it can be generalized and formalized as a technique that is in fact complete for reasoning with combined First-Order theories of algebraic datatypes and background theories, where background theories support decidable quantifier-free reasoning. The theory developed in ","authors_text":"Adithya Murali, Lucas Pe\\~na, P. Madhusudan, Ranjit Jhala","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-21T20:47:07Z","title":"Complete first-order reasoning for functional programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23022","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b619a393431c26cfa50f4717f986895d8124a2b9e3ec8c8ca0fcd6ddebb0b2c7","target":"record","created_at":"2026-05-25T02:01: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":"a1b4cf6e56c5d85dbc0d1ec733c09515bcd4431b43cd4cf5480cdfdb342ddc84","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-21T20:47:07Z","title_canon_sha256":"098d2c4deac02649ef98808f6ab054c87f0e4a14b136247ffea9cf26b5fbf6a7"},"schema_version":"1.0","source":{"id":"2605.23022","kind":"arxiv","version":1}},"canonical_sha256":"2daa7319ecefb2c6998dadd5bdde44363cf1f70b599abb6bf144148732f2aa4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2daa7319ecefb2c6998dadd5bdde44363cf1f70b599abb6bf144148732f2aa4c","first_computed_at":"2026-05-25T02:01:35.053835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:35.053835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5pVh/TsWb3mWy6idtzsP13N6ydnxmMKPWw9qd2pH8twFHXPI9AFfZuBpx1R9NKYWr7x50w96g+8lrMRTnhfzDQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:35.054510Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b619a393431c26cfa50f4717f986895d8124a2b9e3ec8c8ca0fcd6ddebb0b2c7","sha256:0c51516573d4b59088a23ca171176e0dd97e3299caa46018c8b7a79e23113ecf","sha256:dfaf6d2515bcee854cf278499a77acf90c81f570a38f713f00a1c1e2d1fa28f6"],"state_sha256":"0800136b183b17d496091038d9c61b33327b811fd295a1f6b2d74188fd7fffdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/oYHzcVK2vn2Xgge3NtHp4ZB0LXYQ2KSqp4s4QxuZ2qNIleCeSKv+fCqbqa80w0Nv5ZWjyFDnsSBdtbuMrQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:36:06.313560Z","bundle_sha256":"be8ef517d32f63be9cc86f606a860ea5c1730570ba71ffaa58d12f8c8a80b6ad"}}