{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7M2DYC7AF5YNFKWEF3A7TFL3WP","short_pith_number":"pith:7M2DYC7A","schema_version":"1.0","canonical_sha256":"fb343c0be02f70d2aac42ec1f9957bb3dbdce358a19c05ee702c2b8eab7d8e70","source":{"kind":"arxiv","id":"2207.09854","version":1},"attestation_state":"computed","paper":{"title":"Auto-active Verification of Graph Algorithms, Written in OCaml","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Castanho, M\\'ario Pereira","submitted_at":"2022-07-20T12:39:34Z","abstract_excerpt":"Functional programming offers the perfect ground for building correct-by-construction software. Languages of such paradigm normally feature state-of-the-art type systems, good abstraction mechanisms, and well-defined execution models. We claim that all of these make software written in a functional language excellent targets for formal certification. Yet, somehow surprising, techniques such as deductive verification have been seldom applied to large-scale programs, written in mainstream functional languages. In this paper, we wish to address this situation and present the auto-active proof of "},"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":"2207.09854","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-07-20T12:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"3dbf00be6a9596bada5254d03a1d03c44ca7364ab14a7840c97041ba22515003","abstract_canon_sha256":"c9e5d6d2a7037c81574c31f1fd6b358753d798d881e567ee9e09099561bc8588"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:42:02.552231Z","signature_b64":"8OMlLKIWbIBW5yZ50NOH43jxsSSWrUgfR2xDshioo2siw1VWAjh1SshwIYOOVyTvQP8Vhxt3DTxHAm/XqmvcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb343c0be02f70d2aac42ec1f9957bb3dbdce358a19c05ee702c2b8eab7d8e70","last_reissued_at":"2026-07-05T04:42:02.551774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:42:02.551774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auto-active Verification of Graph Algorithms, Written in OCaml","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Castanho, M\\'ario Pereira","submitted_at":"2022-07-20T12:39:34Z","abstract_excerpt":"Functional programming offers the perfect ground for building correct-by-construction software. Languages of such paradigm normally feature state-of-the-art type systems, good abstraction mechanisms, and well-defined execution models. We claim that all of these make software written in a functional language excellent targets for formal certification. Yet, somehow surprising, techniques such as deductive verification have been seldom applied to large-scale programs, written in mainstream functional languages. In this paper, we wish to address this situation and present the auto-active proof of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.09854","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/2207.09854/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":"2207.09854","created_at":"2026-07-05T04:42:02.551828+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.09854v1","created_at":"2026-07-05T04:42:02.551828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.09854","created_at":"2026-07-05T04:42:02.551828+00:00"},{"alias_kind":"pith_short_12","alias_value":"7M2DYC7AF5YN","created_at":"2026-07-05T04:42:02.551828+00:00"},{"alias_kind":"pith_short_16","alias_value":"7M2DYC7AF5YNFKWE","created_at":"2026-07-05T04:42:02.551828+00:00"},{"alias_kind":"pith_short_8","alias_value":"7M2DYC7A","created_at":"2026-07-05T04:42:02.551828+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20310","citing_title":"Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP","json":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP.json","graph_json":"https://pith.science/api/pith-number/7M2DYC7AF5YNFKWEF3A7TFL3WP/graph.json","events_json":"https://pith.science/api/pith-number/7M2DYC7AF5YNFKWEF3A7TFL3WP/events.json","paper":"https://pith.science/paper/7M2DYC7A"},"agent_actions":{"view_html":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP","download_json":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP.json","view_paper":"https://pith.science/paper/7M2DYC7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.09854&json=true","fetch_graph":"https://pith.science/api/pith-number/7M2DYC7AF5YNFKWEF3A7TFL3WP/graph.json","fetch_events":"https://pith.science/api/pith-number/7M2DYC7AF5YNFKWEF3A7TFL3WP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP/action/storage_attestation","attest_author":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP/action/author_attestation","sign_citation":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP/action/citation_signature","submit_replication":"https://pith.science/pith/7M2DYC7AF5YNFKWEF3A7TFL3WP/action/replication_record"}},"created_at":"2026-07-05T04:42:02.551828+00:00","updated_at":"2026-07-05T04:42:02.551828+00:00"}