{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T2JOFXKDV3KTOOGB7HKSNQ7DU7","short_pith_number":"pith:T2JOFXKD","canonical_record":{"source":{"id":"1611.09606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-29T12:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"3e494d4266062040031aa26e774138b6f8764a36e2e355e8486977a73b48f0d8","abstract_canon_sha256":"0d978857cf882f781ecbf67169d43169b2f8e72dc4cb69dfd55186306a4b708a"},"schema_version":"1.0"},"canonical_sha256":"9e92e2dd43aed53738c1f9d526c3e3a7ffc2430a6cda176ecf8e51b008cad0de","source":{"kind":"arxiv","id":"1611.09606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09606","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09606v1","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09606","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"pith_short_12","alias_value":"T2JOFXKDV3KT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T2JOFXKDV3KTOOGB","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T2JOFXKD","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T2JOFXKDV3KTOOGB7HKSNQ7DU7","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-29T12:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"3e494d4266062040031aa26e774138b6f8764a36e2e355e8486977a73b48f0d8","abstract_canon_sha256":"0d978857cf882f781ecbf67169d43169b2f8e72dc4cb69dfd55186306a4b708a"},"schema_version":"1.0"},"canonical_sha256":"9e92e2dd43aed53738c1f9d526c3e3a7ffc2430a6cda176ecf8e51b008cad0de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:17.944248Z","signature_b64":"vk03WRxNQ9SJVgK92jYutmdth6/S3nG37CIfSTJlRdYflj6P+xrucj00pZtE0mdXBhrN3nN9Z7pbPeAkLE0zAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e92e2dd43aed53738c1f9d526c3e3a7ffc2430a6cda176ecf8e51b008cad0de","last_reissued_at":"2026-05-18T00:56:17.943665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:17.943665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09606","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-18T00:56:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pgTPbG8s9Yu56j4D2LIMnBMDB4cZlvybL2Szfa7DMCP6l6cRJEHmRLXSumrCKPtEl3ZkBA96MdYLh1Q4HICCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:24:52.289835Z"},"content_sha256":"a81c3a5283199b094b16c88f348d0b974ef5d930bea880fb5b7a921890c15a10","schema_version":"1.0","event_id":"sha256:a81c3a5283199b094b16c88f348d0b974ef5d930bea880fb5b7a921890c15a10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T2JOFXKDV3KTOOGB7HKSNQ7DU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Inductive Proof Method for Simulation-based Compiler Correctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Gert Smolka, Sebastian Hack, Sigurd Schneider","submitted_at":"2016-11-29T12:47:15Z","abstract_excerpt":"We study induction on the program structure as a proof method for bisimulation-based compiler correctness. We consider a first-order language with mutually recursive function definitions, system calls, and an environment semantics. The proof method relies on a generalization of compatibility of function definition with the bisimulation. We use the inductive method to show correctness of a form of dead code elimination. This is an interesting case study because the transformation removes function, variable, and parameter definitions from the program. While such transformations require modificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09606","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-18T00:56:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"duZY2ADCOROfnYBETPMy55uXYCkcRWqW0sjBTJKDplUrWUMy2s6QzEaa38b+SPc24LjzYx4C56+V2BhgJPjhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:24:52.290180Z"},"content_sha256":"a8b204caa49d072ecb349a059b3c7186144d00aba68fc7e42b4de4eab392320c","schema_version":"1.0","event_id":"sha256:a8b204caa49d072ecb349a059b3c7186144d00aba68fc7e42b4de4eab392320c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2JOFXKDV3KTOOGB7HKSNQ7DU7/bundle.json","state_url":"https://pith.science/pith/T2JOFXKDV3KTOOGB7HKSNQ7DU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2JOFXKDV3KTOOGB7HKSNQ7DU7/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-09T16:24:52Z","links":{"resolver":"https://pith.science/pith/T2JOFXKDV3KTOOGB7HKSNQ7DU7","bundle":"https://pith.science/pith/T2JOFXKDV3KTOOGB7HKSNQ7DU7/bundle.json","state":"https://pith.science/pith/T2JOFXKDV3KTOOGB7HKSNQ7DU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2JOFXKDV3KTOOGB7HKSNQ7DU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T2JOFXKDV3KTOOGB7HKSNQ7DU7","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":"0d978857cf882f781ecbf67169d43169b2f8e72dc4cb69dfd55186306a4b708a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-29T12:47:15Z","title_canon_sha256":"3e494d4266062040031aa26e774138b6f8764a36e2e355e8486977a73b48f0d8"},"schema_version":"1.0","source":{"id":"1611.09606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09606","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09606v1","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09606","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"pith_short_12","alias_value":"T2JOFXKDV3KT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T2JOFXKDV3KTOOGB","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T2JOFXKD","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:a8b204caa49d072ecb349a059b3c7186144d00aba68fc7e42b4de4eab392320c","target":"graph","created_at":"2026-05-18T00:56:17Z","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 study induction on the program structure as a proof method for bisimulation-based compiler correctness. We consider a first-order language with mutually recursive function definitions, system calls, and an environment semantics. The proof method relies on a generalization of compatibility of function definition with the bisimulation. We use the inductive method to show correctness of a form of dead code elimination. This is an interesting case study because the transformation removes function, variable, and parameter definitions from the program. While such transformations require modificat","authors_text":"Gert Smolka, Sebastian Hack, Sigurd Schneider","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-29T12:47:15Z","title":"An Inductive Proof Method for Simulation-based Compiler Correctness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09606","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:a81c3a5283199b094b16c88f348d0b974ef5d930bea880fb5b7a921890c15a10","target":"record","created_at":"2026-05-18T00:56:17Z","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":"0d978857cf882f781ecbf67169d43169b2f8e72dc4cb69dfd55186306a4b708a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-29T12:47:15Z","title_canon_sha256":"3e494d4266062040031aa26e774138b6f8764a36e2e355e8486977a73b48f0d8"},"schema_version":"1.0","source":{"id":"1611.09606","kind":"arxiv","version":1}},"canonical_sha256":"9e92e2dd43aed53738c1f9d526c3e3a7ffc2430a6cda176ecf8e51b008cad0de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e92e2dd43aed53738c1f9d526c3e3a7ffc2430a6cda176ecf8e51b008cad0de","first_computed_at":"2026-05-18T00:56:17.943665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:17.943665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vk03WRxNQ9SJVgK92jYutmdth6/S3nG37CIfSTJlRdYflj6P+xrucj00pZtE0mdXBhrN3nN9Z7pbPeAkLE0zAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:17.944248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a81c3a5283199b094b16c88f348d0b974ef5d930bea880fb5b7a921890c15a10","sha256:a8b204caa49d072ecb349a059b3c7186144d00aba68fc7e42b4de4eab392320c"],"state_sha256":"710f798da9b613fedbe4ba7d1b8b143acffe9d0bac9e24e7f4140c3c27989517"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEZundwGPeV7hbE9+W3xQHLixPBNAw1kzfmsHVrAYEHj1TxbB5lmvrdLTQ36DueIjonSRgxMN7IKl4KNLqTjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:24:52.292214Z","bundle_sha256":"699c2d0b22fbbfd7244ff3eb937d13512ad01f6d859434fbcaf5c05115fa7d87"}}