{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BLYYRP6P2WKGH7INTHZZ5EALYM","short_pith_number":"pith:BLYYRP6P","schema_version":"1.0","canonical_sha256":"0af188bfcfd59463fd0d99f39e900bc3152a356f1fa1798e3004e3232dba0d9b","source":{"kind":"arxiv","id":"2504.19852","version":2},"attestation_state":"computed","paper":{"title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Chengxi Yang, Qinxiang Cao, Shushu Wu","submitted_at":"2025-04-28T14:47:20Z","abstract_excerpt":"Current approaches for formal verification of algorithms face important limitations. For specification, they cannot express algorithms naturally and concisely, especially for algorithms with states and flexible control flow. For verification, formal proof based on Hoare logic cannot reflect the logical structure of natural proof. To address these challenges, we introduce a formal framework for naturally specifying and verifying sequential algorithms in Coq. We use the state relation monad to integrate Coq's expressive type system with the flexible control flow of imperative languages. It suppo"},"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":"2504.19852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-04-28T14:47:20Z","cross_cats_sorted":[],"title_canon_sha256":"f13d93cc7dab243e4127886814c2a7e29a92b94081810feb0a26e69d47f2363c","abstract_canon_sha256":"30450a534d8813cb14d3b1bbb796546c06eca3be0420fb14ea17fa1024f9791e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:56:18.678801Z","signature_b64":"ARMeI2R4vT0HNVkChQacTrK55zTtd2FBahOOOQlXpCQK4ZW0cXPeY56p2iEZX1VKena1fRLmRgnXmjyyurQ/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0af188bfcfd59463fd0d99f39e900bc3152a356f1fa1798e3004e3232dba0d9b","last_reissued_at":"2026-07-05T10:56:18.678355Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:56:18.678355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Chengxi Yang, Qinxiang Cao, Shushu Wu","submitted_at":"2025-04-28T14:47:20Z","abstract_excerpt":"Current approaches for formal verification of algorithms face important limitations. For specification, they cannot express algorithms naturally and concisely, especially for algorithms with states and flexible control flow. For verification, formal proof based on Hoare logic cannot reflect the logical structure of natural proof. To address these challenges, we introduce a formal framework for naturally specifying and verifying sequential algorithms in Coq. We use the state relation monad to integrate Coq's expressive type system with the flexible control flow of imperative languages. It suppo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19852","kind":"arxiv","version":2},"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/2504.19852/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":"2504.19852","created_at":"2026-07-05T10:56:18.678414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.19852v2","created_at":"2026-07-05T10:56:18.678414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19852","created_at":"2026-07-05T10:56:18.678414+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLYYRP6P2WKG","created_at":"2026-07-05T10:56:18.678414+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLYYRP6P2WKGH7IN","created_at":"2026-07-05T10:56:18.678414+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLYYRP6P","created_at":"2026-07-05T10:56:18.678414+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/BLYYRP6P2WKGH7INTHZZ5EALYM","json":"https://pith.science/pith/BLYYRP6P2WKGH7INTHZZ5EALYM.json","graph_json":"https://pith.science/api/pith-number/BLYYRP6P2WKGH7INTHZZ5EALYM/graph.json","events_json":"https://pith.science/api/pith-number/BLYYRP6P2WKGH7INTHZZ5EALYM/events.json","paper":"https://pith.science/paper/BLYYRP6P"},"agent_actions":{"view_html":"https://pith.science/pith/BLYYRP6P2WKGH7INTHZZ5EALYM","download_json":"https://pith.science/pith/BLYYRP6P2WKGH7INTHZZ5EALYM.json","view_paper":"https://pith.science/paper/BLYYRP6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.19852&json=true","fetch_graph":"https://pith.science/api/pith-number/BLYYRP6P2WKGH7INTHZZ5EALYM/graph.json","fetch_events":"https://pith.science/api/pith-number/BLYYRP6P2WKGH7INTHZZ5EALYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLYYRP6P2WKGH7INTHZZ5EALYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLYYRP6P2WKGH7INTHZZ5EALYM/action/storage_attestation","attest_author":"https://pith.science/pith/BLYYRP6P2WKGH7INTHZZ5EALYM/action/author_attestation","sign_citation":"https://pith.science/pith/BLYYRP6P2WKGH7INTHZZ5EALYM/action/citation_signature","submit_replication":"https://pith.science/pith/BLYYRP6P2WKGH7INTHZZ5EALYM/action/replication_record"}},"created_at":"2026-07-05T10:56:18.678414+00:00","updated_at":"2026-07-05T10:56:18.678414+00:00"}