{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AP4TETUFEHNKCTUMJ6LS2T7KLB","short_pith_number":"pith:AP4TETUF","schema_version":"1.0","canonical_sha256":"03f9324e8521daa14e8c4f972d4fea586c42a0a601baff32d5b295af18165ed1","source":{"kind":"arxiv","id":"1903.01237","version":4},"attestation_state":"computed","paper":{"title":"Dijkstra Monads for All","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Catalin Hritcu, Danel Ahman, \\'Eric Tanter, Exequiel Rivas, Guido Martinez, Kenji Maillard, Robert Atkey","submitted_at":"2019-03-04T13:46:38Z","abstract_excerpt":"This paper proposes a general semantic framework for verifying programs with arbitrary monadic side-effects using Dijkstra monads, which we define as monad-like structures indexed by a specification monad. We prove that any monad morphism between a computational monad and a specification monad gives rise to a Dijkstra monad, which provides great flexibility for obtaining Dijkstra monads tailored to the verification task at hand. We moreover show that a large variety of specification monads can be obtained by applying monad transformers to various base specification monads, including predicate "},"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":"1903.01237","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2019-03-04T13:46:38Z","cross_cats_sorted":[],"title_canon_sha256":"df26b84a2a5552e45c6b744add7fecfd6af46ca08d19fd6e709d254e6fcbc9ed","abstract_canon_sha256":"410f8d0df3dc0e45f9bfaea8af7eb353267821945925bcbf6a7614da3eba7e6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:13.641273Z","signature_b64":"pLrzlgd7cCUUljTsXSGA7ruRd9RbJrcO3LLk0YuRdTNKE0Mm7GZKUQWTm62Vl7f71tpzU3t4ZrHMT6CJ/8nBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03f9324e8521daa14e8c4f972d4fea586c42a0a601baff32d5b295af18165ed1","last_reissued_at":"2026-05-17T23:42:13.640684Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:13.640684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dijkstra Monads for All","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Catalin Hritcu, Danel Ahman, \\'Eric Tanter, Exequiel Rivas, Guido Martinez, Kenji Maillard, Robert Atkey","submitted_at":"2019-03-04T13:46:38Z","abstract_excerpt":"This paper proposes a general semantic framework for verifying programs with arbitrary monadic side-effects using Dijkstra monads, which we define as monad-like structures indexed by a specification monad. We prove that any monad morphism between a computational monad and a specification monad gives rise to a Dijkstra monad, which provides great flexibility for obtaining Dijkstra monads tailored to the verification task at hand. We moreover show that a large variety of specification monads can be obtained by applying monad transformers to various base specification monads, including predicate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01237","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1903.01237","created_at":"2026-05-17T23:42:13.640763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01237v4","created_at":"2026-05-17T23:42:13.640763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01237","created_at":"2026-05-17T23:42:13.640763+00:00"},{"alias_kind":"pith_short_12","alias_value":"AP4TETUFEHNK","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AP4TETUFEHNKCTUM","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AP4TETUF","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.10007","citing_title":"Formal Verification of Imperative First-Class Functions in Move","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10007","citing_title":"Formal Verification of Imperative First-Class Functions in Move","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB","json":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB.json","graph_json":"https://pith.science/api/pith-number/AP4TETUFEHNKCTUMJ6LS2T7KLB/graph.json","events_json":"https://pith.science/api/pith-number/AP4TETUFEHNKCTUMJ6LS2T7KLB/events.json","paper":"https://pith.science/paper/AP4TETUF"},"agent_actions":{"view_html":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB","download_json":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB.json","view_paper":"https://pith.science/paper/AP4TETUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01237&json=true","fetch_graph":"https://pith.science/api/pith-number/AP4TETUFEHNKCTUMJ6LS2T7KLB/graph.json","fetch_events":"https://pith.science/api/pith-number/AP4TETUFEHNKCTUMJ6LS2T7KLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB/action/storage_attestation","attest_author":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB/action/author_attestation","sign_citation":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB/action/citation_signature","submit_replication":"https://pith.science/pith/AP4TETUFEHNKCTUMJ6LS2T7KLB/action/replication_record"}},"created_at":"2026-05-17T23:42:13.640763+00:00","updated_at":"2026-05-17T23:42:13.640763+00:00"}