{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KARLDYFEAZDJPYUWMKHFNIYVO4","short_pith_number":"pith:KARLDYFE","schema_version":"1.0","canonical_sha256":"5022b1e0a4064697e296628e56a31577343a603684026a2ed5f037a490c81214","source":{"kind":"arxiv","id":"2506.20310","version":1},"attestation_state":"computed","paper":{"title":"Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ion Chirica, M\\'ario Pereira","submitted_at":"2025-06-25T10:48:38Z","abstract_excerpt":"Albeit being a central notion of every programming language, formally and modularly reasoning about iteration proves itself to be a non-trivial feat, specially in the context of higher-order iteration. In this paper, we present a generic approach to the specification and deductive verification of higher-order iterators, written in the OCaml language. Our methodology follows two key principles: first, the usage of the Gospel specification language to describe the general behaviour of any iteration schema; second, the usage of the Cameleer framework to deductively verify that every iteration cli"},"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":"2506.20310","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-06-25T10:48:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"abd58e761b28cfff1811bf51c21add109725432ee681afbb65012fade7f09bf6","abstract_canon_sha256":"1387f43bd96e663dd5f6e2d7880711038364ece8f3fbabcf9a52dfa68fd095ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:03.617070Z","signature_b64":"IfDgDeZUda67Bv1Nmlyp+GcjtT+BgskBcb/Hn8F2lqNr1RytSEkm/PNrgcfdpKrRjQa7MKRs5ATLvEDpNbkCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5022b1e0a4064697e296628e56a31577343a603684026a2ed5f037a490c81214","last_reissued_at":"2026-07-05T11:27:03.616678Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:03.616678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ion Chirica, M\\'ario Pereira","submitted_at":"2025-06-25T10:48:38Z","abstract_excerpt":"Albeit being a central notion of every programming language, formally and modularly reasoning about iteration proves itself to be a non-trivial feat, specially in the context of higher-order iteration. In this paper, we present a generic approach to the specification and deductive verification of higher-order iterators, written in the OCaml language. Our methodology follows two key principles: first, the usage of the Gospel specification language to describe the general behaviour of any iteration schema; second, the usage of the Cameleer framework to deductively verify that every iteration cli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20310","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/2506.20310/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":"2506.20310","created_at":"2026-07-05T11:27:03.616735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20310v1","created_at":"2026-07-05T11:27:03.616735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20310","created_at":"2026-07-05T11:27:03.616735+00:00"},{"alias_kind":"pith_short_12","alias_value":"KARLDYFEAZDJ","created_at":"2026-07-05T11:27:03.616735+00:00"},{"alias_kind":"pith_short_16","alias_value":"KARLDYFEAZDJPYUW","created_at":"2026-07-05T11:27:03.616735+00:00"},{"alias_kind":"pith_short_8","alias_value":"KARLDYFE","created_at":"2026-07-05T11:27:03.616735+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/KARLDYFEAZDJPYUWMKHFNIYVO4","json":"https://pith.science/pith/KARLDYFEAZDJPYUWMKHFNIYVO4.json","graph_json":"https://pith.science/api/pith-number/KARLDYFEAZDJPYUWMKHFNIYVO4/graph.json","events_json":"https://pith.science/api/pith-number/KARLDYFEAZDJPYUWMKHFNIYVO4/events.json","paper":"https://pith.science/paper/KARLDYFE"},"agent_actions":{"view_html":"https://pith.science/pith/KARLDYFEAZDJPYUWMKHFNIYVO4","download_json":"https://pith.science/pith/KARLDYFEAZDJPYUWMKHFNIYVO4.json","view_paper":"https://pith.science/paper/KARLDYFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20310&json=true","fetch_graph":"https://pith.science/api/pith-number/KARLDYFEAZDJPYUWMKHFNIYVO4/graph.json","fetch_events":"https://pith.science/api/pith-number/KARLDYFEAZDJPYUWMKHFNIYVO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KARLDYFEAZDJPYUWMKHFNIYVO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KARLDYFEAZDJPYUWMKHFNIYVO4/action/storage_attestation","attest_author":"https://pith.science/pith/KARLDYFEAZDJPYUWMKHFNIYVO4/action/author_attestation","sign_citation":"https://pith.science/pith/KARLDYFEAZDJPYUWMKHFNIYVO4/action/citation_signature","submit_replication":"https://pith.science/pith/KARLDYFEAZDJPYUWMKHFNIYVO4/action/replication_record"}},"created_at":"2026-07-05T11:27:03.616735+00:00","updated_at":"2026-07-05T11:27:03.616735+00:00"}