{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4APOQR4OVL46O5BRYIZZGCWAUD","short_pith_number":"pith:4APOQR4O","schema_version":"1.0","canonical_sha256":"e01ee8478eaaf9e77431c233930ac0a0cf8a3e9ec78a577f02dd7a8a8ce20d9b","source":{"kind":"arxiv","id":"1310.4283","version":2},"attestation_state":"computed","paper":{"title":"Abstract interpretation as anti-refinement","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arnaud Spiwack","submitted_at":"2013-10-16T07:16:49Z","abstract_excerpt":"This article shows a correspondence between abstract interpretation of imperative programs and the refinement calculus: in the refinement calculus, an abstract interpretation of a program is a specification which is a function.\n  This correspondence can be used to guide the design of mechanically verified static analyses, keeping the correctness proof well separated from the heuristic parts of the algorithms."},"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":"1310.4283","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.PL","submitted_at":"2013-10-16T07:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"78421afe78cc272119426048be4fc64f3021125fedf297a2c4702a01c4143037","abstract_canon_sha256":"f4f137a2e043f0808c0d91570d2ba6ecc5db660c1fd1f3313e62f3f974af6aef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:47.130495Z","signature_b64":"lVY2XzbgFYYRqyngk/AdG1kHFFkwb7L0oqWwXChrma2dwprTAqf8ttTmjczNoJU2pk7mktT0CFQdUKgY+zEUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e01ee8478eaaf9e77431c233930ac0a0cf8a3e9ec78a577f02dd7a8a8ce20d9b","last_reissued_at":"2026-05-18T02:49:47.130073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:47.130073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abstract interpretation as anti-refinement","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arnaud Spiwack","submitted_at":"2013-10-16T07:16:49Z","abstract_excerpt":"This article shows a correspondence between abstract interpretation of imperative programs and the refinement calculus: in the refinement calculus, an abstract interpretation of a program is a specification which is a function.\n  This correspondence can be used to guide the design of mechanically verified static analyses, keeping the correctness proof well separated from the heuristic parts of the algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4283","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":""},"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":"1310.4283","created_at":"2026-05-18T02:49:47.130133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4283v2","created_at":"2026-05-18T02:49:47.130133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4283","created_at":"2026-05-18T02:49:47.130133+00:00"},{"alias_kind":"pith_short_12","alias_value":"4APOQR4OVL46","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4APOQR4OVL46O5BR","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4APOQR4O","created_at":"2026-05-18T12:27:32.513160+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/4APOQR4OVL46O5BRYIZZGCWAUD","json":"https://pith.science/pith/4APOQR4OVL46O5BRYIZZGCWAUD.json","graph_json":"https://pith.science/api/pith-number/4APOQR4OVL46O5BRYIZZGCWAUD/graph.json","events_json":"https://pith.science/api/pith-number/4APOQR4OVL46O5BRYIZZGCWAUD/events.json","paper":"https://pith.science/paper/4APOQR4O"},"agent_actions":{"view_html":"https://pith.science/pith/4APOQR4OVL46O5BRYIZZGCWAUD","download_json":"https://pith.science/pith/4APOQR4OVL46O5BRYIZZGCWAUD.json","view_paper":"https://pith.science/paper/4APOQR4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4283&json=true","fetch_graph":"https://pith.science/api/pith-number/4APOQR4OVL46O5BRYIZZGCWAUD/graph.json","fetch_events":"https://pith.science/api/pith-number/4APOQR4OVL46O5BRYIZZGCWAUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4APOQR4OVL46O5BRYIZZGCWAUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4APOQR4OVL46O5BRYIZZGCWAUD/action/storage_attestation","attest_author":"https://pith.science/pith/4APOQR4OVL46O5BRYIZZGCWAUD/action/author_attestation","sign_citation":"https://pith.science/pith/4APOQR4OVL46O5BRYIZZGCWAUD/action/citation_signature","submit_replication":"https://pith.science/pith/4APOQR4OVL46O5BRYIZZGCWAUD/action/replication_record"}},"created_at":"2026-05-18T02:49:47.130133+00:00","updated_at":"2026-05-18T02:49:47.130133+00:00"}