{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZZTBTGE4JVNPKOTSNR5D5RLD7D","short_pith_number":"pith:ZZTBTGE4","canonical_record":{"source":{"id":"1107.3539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-07-18T19:44:11Z","cross_cats_sorted":[],"title_canon_sha256":"b39345cbe4594d44527f7bb4affa4af9f7375ac4397a70fcfb37caa3547b1f8f","abstract_canon_sha256":"8171cb3c7fec406c57f526da57b4e97ff407df807b757e9035ec13dcb9326a6a"},"schema_version":"1.0"},"canonical_sha256":"ce6619989c4d5af53a726c7a3ec563f8e5788bb4a7cc07af59386585f0074732","source":{"kind":"arxiv","id":"1107.3539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3539","created_at":"2026-05-18T04:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3539v1","created_at":"2026-05-18T04:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3539","created_at":"2026-05-18T04:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZZTBTGE4JVNP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZZTBTGE4JVNPKOTS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZZTBTGE4","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZZTBTGE4JVNPKOTSNR5D5RLD7D","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-07-18T19:44:11Z","cross_cats_sorted":[],"title_canon_sha256":"b39345cbe4594d44527f7bb4affa4af9f7375ac4397a70fcfb37caa3547b1f8f","abstract_canon_sha256":"8171cb3c7fec406c57f526da57b4e97ff407df807b757e9035ec13dcb9326a6a"},"schema_version":"1.0"},"canonical_sha256":"ce6619989c4d5af53a726c7a3ec563f8e5788bb4a7cc07af59386585f0074732","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:02.906907Z","signature_b64":"zVrsuyknsKbje/9BLqRoXMrxj/Eh2MKNDqUM+ydc05cPyQKw1iEA3EiqYHNRUMSJtZN8nxlbuQYGPOXA4CjpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce6619989c4d5af53a726c7a3ec563f8e5788bb4a7cc07af59386585f0074732","last_reissued_at":"2026-05-18T04:18:02.906251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:02.906251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3539","source_version":1,"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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hmv0NXekmzXLHwKSzgb2g6U7uaJ87mnx8DRfnKtxV3pDMoX+FAnQTE7k43VnXB6vtxZaIy9K0f3L8VGIVw1NBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:01:16.910043Z"},"content_sha256":"d32a971fb6814d54241686034876ec40bb23953e75401af0153d61183af856f3","schema_version":"1.0","event_id":"sha256:d32a971fb6814d54241686034876ec40bb23953e75401af0153d61183af856f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZZTBTGE4JVNPKOTSNR5D5RLD7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Systematic Abstraction of Abstract Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Van Horn, Matthew Might","submitted_at":"2011-07-18T19:44:11Z","abstract_excerpt":"We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines for higher-order and imperative programming languages. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine's machine, and the stack-inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack-inspection behavior; and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3539","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":""},"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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAIuZY6rQTir/Va3p9z8ZKHKr4Pxi9AVYin1OAB8Z5KXpSg+0QJrHxqB4exNoDxeBUplNSgQqK13Dnvy3cd9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:01:16.910504Z"},"content_sha256":"7e11e09405607115d03f3783fd3382a5a8147425c0cf912606b5ce1e44b408ce","schema_version":"1.0","event_id":"sha256:7e11e09405607115d03f3783fd3382a5a8147425c0cf912606b5ce1e44b408ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZTBTGE4JVNPKOTSNR5D5RLD7D/bundle.json","state_url":"https://pith.science/pith/ZZTBTGE4JVNPKOTSNR5D5RLD7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZTBTGE4JVNPKOTSNR5D5RLD7D/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-05-28T02:01:16Z","links":{"resolver":"https://pith.science/pith/ZZTBTGE4JVNPKOTSNR5D5RLD7D","bundle":"https://pith.science/pith/ZZTBTGE4JVNPKOTSNR5D5RLD7D/bundle.json","state":"https://pith.science/pith/ZZTBTGE4JVNPKOTSNR5D5RLD7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZTBTGE4JVNPKOTSNR5D5RLD7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZZTBTGE4JVNPKOTSNR5D5RLD7D","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":"8171cb3c7fec406c57f526da57b4e97ff407df807b757e9035ec13dcb9326a6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-07-18T19:44:11Z","title_canon_sha256":"b39345cbe4594d44527f7bb4affa4af9f7375ac4397a70fcfb37caa3547b1f8f"},"schema_version":"1.0","source":{"id":"1107.3539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3539","created_at":"2026-05-18T04:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3539v1","created_at":"2026-05-18T04:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3539","created_at":"2026-05-18T04:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZZTBTGE4JVNP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZZTBTGE4JVNPKOTS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZZTBTGE4","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:7e11e09405607115d03f3783fd3382a5a8147425c0cf912606b5ce1e44b408ce","target":"graph","created_at":"2026-05-18T04:18:02Z","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 describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines for higher-order and imperative programming languages. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine's machine, and the stack-inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack-inspection behavior; and ","authors_text":"David Van Horn, Matthew Might","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-07-18T19:44:11Z","title":"Systematic Abstraction of Abstract Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3539","kind":"arxiv","version":1},"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:d32a971fb6814d54241686034876ec40bb23953e75401af0153d61183af856f3","target":"record","created_at":"2026-05-18T04:18:02Z","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":"8171cb3c7fec406c57f526da57b4e97ff407df807b757e9035ec13dcb9326a6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-07-18T19:44:11Z","title_canon_sha256":"b39345cbe4594d44527f7bb4affa4af9f7375ac4397a70fcfb37caa3547b1f8f"},"schema_version":"1.0","source":{"id":"1107.3539","kind":"arxiv","version":1}},"canonical_sha256":"ce6619989c4d5af53a726c7a3ec563f8e5788bb4a7cc07af59386585f0074732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce6619989c4d5af53a726c7a3ec563f8e5788bb4a7cc07af59386585f0074732","first_computed_at":"2026-05-18T04:18:02.906251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:02.906251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zVrsuyknsKbje/9BLqRoXMrxj/Eh2MKNDqUM+ydc05cPyQKw1iEA3EiqYHNRUMSJtZN8nxlbuQYGPOXA4CjpDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:02.906907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d32a971fb6814d54241686034876ec40bb23953e75401af0153d61183af856f3","sha256:7e11e09405607115d03f3783fd3382a5a8147425c0cf912606b5ce1e44b408ce"],"state_sha256":"ba035e5ef55e6a6c97ad45465acb48886092276b0ce780a009f361a256b02979"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2eFo4Ww1s7dkUyqpMJYQdkSsuLMGy6krIT9lhsZcdB5dbv3ivQetsHxi4X54nHLyqDKJntp+wDVWoKWqYXEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:01:16.912607Z","bundle_sha256":"08bebfc8fc9530ca406c5c7a168596021599083133c1006a4ea637ad2bcaad81"}}