{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NNC5A2TIMGEWPV5CCHZQ7E5ZCF","short_pith_number":"pith:NNC5A2TI","canonical_record":{"source":{"id":"1004.2884","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-04-16T17:01:27Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4b53dac9cac767437de85ff880dd116281b12f84a4b88f1f0398e43e70114b85","abstract_canon_sha256":"2b5c01e334f32a189ea9443406975b49d274d1de989f3c2ba0660cba6ab26148"},"schema_version":"1.0"},"canonical_sha256":"6b45d06a68618967d7a211f30f93b9117c66a2835a76430469a2196aefa76bd8","source":{"kind":"arxiv","id":"1004.2884","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2884","created_at":"2026-05-18T04:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2884v2","created_at":"2026-05-18T04:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2884","created_at":"2026-05-18T04:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"NNC5A2TIMGEW","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NNC5A2TIMGEWPV5C","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NNC5A2TI","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NNC5A2TIMGEWPV5CCHZQ7E5ZCF","target":"record","payload":{"canonical_record":{"source":{"id":"1004.2884","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-04-16T17:01:27Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4b53dac9cac767437de85ff880dd116281b12f84a4b88f1f0398e43e70114b85","abstract_canon_sha256":"2b5c01e334f32a189ea9443406975b49d274d1de989f3c2ba0660cba6ab26148"},"schema_version":"1.0"},"canonical_sha256":"6b45d06a68618967d7a211f30f93b9117c66a2835a76430469a2196aefa76bd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:19.388076Z","signature_b64":"p3nOwRu+9+HPNqqG50Kd/f2z2bobRGHf1gciGhts0YDP7Pje0+aEsyWpudy04YOQkIpASJEPRiWI6c+kYIZhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b45d06a68618967d7a211f30f93b9117c66a2835a76430469a2196aefa76bd8","last_reissued_at":"2026-05-18T04:32:19.387423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:19.387423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.2884","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DfWiYka26qUhysEQOyK3BPTe7gWAodC8Ywnf8wdiG/2sC3GVukPg1isbUAHf56mKgKepaZWp4s0Pe+BpdebnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:51:44.071521Z"},"content_sha256":"b44bf8e3e57f9e3d7e71cbf02b64a31a8ed72aff67ad1bc0cb218987ff672ad8","schema_version":"1.0","event_id":"sha256:b44bf8e3e57f9e3d7e71cbf02b64a31a8ed72aff67ad1bc0cb218987ff672ad8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NNC5A2TIMGEWPV5CCHZQ7E5ZCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HMC: Verifying Functional Programs Using Abstract Interpreters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Andrey Rybalchenko, Ranjit Jhala, Rupak Majumdar","submitted_at":"2010-04-16T17:01:27Z","abstract_excerpt":"We present Hindley-Milner-Cousots (HMC), an algorithm that allows any interprocedural analysis for first-order imperative programs to be used to verify safety properties of typed higher-order functional programs. HMC works as follows. First, it uses the type structure of the functional program to generate a set of logical refinement constraints whose satisfaction implies the safety of the source program. Next, it transforms the logical refinement constraints into a simple first-order imperative program that is safe iff the constraints are satisfiable. Thus, in one swoop, HMC makes tools for in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2884","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9EmiVAaitbJAYl9ia0tHpuFe7xzokvixb8VjqqD3dO6Gk/MVk+WroNbznLVzWu/fn0VyXqwJAkAAZmk1EMyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:51:44.072154Z"},"content_sha256":"c5f56345c4527e8fca26e5fed471634031f16cc01f68d1020e2288cfd0a8e2b9","schema_version":"1.0","event_id":"sha256:c5f56345c4527e8fca26e5fed471634031f16cc01f68d1020e2288cfd0a8e2b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/bundle.json","state_url":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T15:51:44Z","links":{"resolver":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF","bundle":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/bundle.json","state":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NNC5A2TIMGEWPV5CCHZQ7E5ZCF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2b5c01e334f32a189ea9443406975b49d274d1de989f3c2ba0660cba6ab26148","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-04-16T17:01:27Z","title_canon_sha256":"4b53dac9cac767437de85ff880dd116281b12f84a4b88f1f0398e43e70114b85"},"schema_version":"1.0","source":{"id":"1004.2884","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2884","created_at":"2026-05-18T04:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2884v2","created_at":"2026-05-18T04:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2884","created_at":"2026-05-18T04:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"NNC5A2TIMGEW","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NNC5A2TIMGEWPV5C","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NNC5A2TI","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:c5f56345c4527e8fca26e5fed471634031f16cc01f68d1020e2288cfd0a8e2b9","target":"graph","created_at":"2026-05-18T04:32:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present Hindley-Milner-Cousots (HMC), an algorithm that allows any interprocedural analysis for first-order imperative programs to be used to verify safety properties of typed higher-order functional programs. HMC works as follows. First, it uses the type structure of the functional program to generate a set of logical refinement constraints whose satisfaction implies the safety of the source program. Next, it transforms the logical refinement constraints into a simple first-order imperative program that is safe iff the constraints are satisfiable. Thus, in one swoop, HMC makes tools for in","authors_text":"Andrey Rybalchenko, Ranjit Jhala, Rupak Majumdar","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-04-16T17:01:27Z","title":"HMC: Verifying Functional Programs Using Abstract Interpreters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2884","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b44bf8e3e57f9e3d7e71cbf02b64a31a8ed72aff67ad1bc0cb218987ff672ad8","target":"record","created_at":"2026-05-18T04:32:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2b5c01e334f32a189ea9443406975b49d274d1de989f3c2ba0660cba6ab26148","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-04-16T17:01:27Z","title_canon_sha256":"4b53dac9cac767437de85ff880dd116281b12f84a4b88f1f0398e43e70114b85"},"schema_version":"1.0","source":{"id":"1004.2884","kind":"arxiv","version":2}},"canonical_sha256":"6b45d06a68618967d7a211f30f93b9117c66a2835a76430469a2196aefa76bd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b45d06a68618967d7a211f30f93b9117c66a2835a76430469a2196aefa76bd8","first_computed_at":"2026-05-18T04:32:19.387423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:19.387423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p3nOwRu+9+HPNqqG50Kd/f2z2bobRGHf1gciGhts0YDP7Pje0+aEsyWpudy04YOQkIpASJEPRiWI6c+kYIZhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:19.388076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.2884","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b44bf8e3e57f9e3d7e71cbf02b64a31a8ed72aff67ad1bc0cb218987ff672ad8","sha256:c5f56345c4527e8fca26e5fed471634031f16cc01f68d1020e2288cfd0a8e2b9"],"state_sha256":"c3e17ffcb5a3d18925bbcc5932cb2d6d0fe558d28db7613d6394947f61918f2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLrleyS6YTOWKWbxz/NqxxbLTlWyfvIAqgzrBgFd2HOVrsEQ9CN8kTRhgCaH0jqqrLSnT58+eRYyPliZnmyoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:51:44.079632Z","bundle_sha256":"ecf668b1db58e29da6bfe27bdf65ad2d885c62691fa0344d6b77c790fb4f86d0"}}