{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KJS3EGM5RV7KTZMVCGK2VVEK4G","short_pith_number":"pith:KJS3EGM5","canonical_record":{"source":{"id":"1012.4893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-12-22T07:07:59Z","cross_cats_sorted":[],"title_canon_sha256":"7524bffdcd9f2f2c92c7221ecb1a07e1643e695cd0b9cebd1446f2173761fc7e","abstract_canon_sha256":"b5cfaf75ce39ab1f2f12f5265563eb037388885866467952a87c1f40cb2a6b6a"},"schema_version":"1.0"},"canonical_sha256":"5265b2199d8d7ea9e5951195aad48ae193e0a15c1471a9236ea63285935fb650","source":{"kind":"arxiv","id":"1012.4893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4893","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4893v1","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4893","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"KJS3EGM5RV7K","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KJS3EGM5RV7KTZMV","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KJS3EGM5","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KJS3EGM5RV7KTZMVCGK2VVEK4G","target":"record","payload":{"canonical_record":{"source":{"id":"1012.4893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-12-22T07:07:59Z","cross_cats_sorted":[],"title_canon_sha256":"7524bffdcd9f2f2c92c7221ecb1a07e1643e695cd0b9cebd1446f2173761fc7e","abstract_canon_sha256":"b5cfaf75ce39ab1f2f12f5265563eb037388885866467952a87c1f40cb2a6b6a"},"schema_version":"1.0"},"canonical_sha256":"5265b2199d8d7ea9e5951195aad48ae193e0a15c1471a9236ea63285935fb650","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:45.007455Z","signature_b64":"uW7fcOafecshOFnUEbkz9ttdwS3/KIoK6vTosk6MJFqfikvti4GY9UT31mCPT5zotGFuGk05SIxlbwyvTjQrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5265b2199d8d7ea9e5951195aad48ae193e0a15c1471a9236ea63285935fb650","last_reissued_at":"2026-05-18T04:32:45.006937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:45.006937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.4893","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:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYhKDwTIpuNzAR9W/TxOWaPIeNnHJTYTW0LbXc0gxfH6Q4LgC2p+Nz3hBZp+uJU+oS5Bi3Ni9qxNdTKsHNJADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:18:40.925444Z"},"content_sha256":"7ee5d74b2c9e5cd8e1b05c9f4fbf99490178ba03e80409d9e98514442dbfc358","schema_version":"1.0","event_id":"sha256:7ee5d74b2c9e5cd8e1b05c9f4fbf99490178ba03e80409d9e98514442dbfc358"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KJS3EGM5RV7KTZMVCGK2VVEK4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Correctness of Program Transformations Through Unification and Critical Pair Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Conrad Rau, Manfred Schmidt-Schau{\\ss}","submitted_at":"2010-12-22T07:07:59Z","abstract_excerpt":"Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, and then of so-called complete sets of diagrams.  The method is similar to the computation of critical pairs for the completion of term rewriting systems. We explore cases where the computation of these overlaps can be done in a first order "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4893","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:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jBcNp8lGpCUpAp2q6k1b0NDToqUZ3dtIpoiAtZNbz8O0fFxFhPPu/Z+1c62o6QGQxm0KhoE4kl6RgjsTQilDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:18:40.926120Z"},"content_sha256":"e218513152d08488fa8f2efda1e64698ba4765ba9bb938147e1bcfdfc53b7a80","schema_version":"1.0","event_id":"sha256:e218513152d08488fa8f2efda1e64698ba4765ba9bb938147e1bcfdfc53b7a80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJS3EGM5RV7KTZMVCGK2VVEK4G/bundle.json","state_url":"https://pith.science/pith/KJS3EGM5RV7KTZMVCGK2VVEK4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJS3EGM5RV7KTZMVCGK2VVEK4G/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-30T07:18:40Z","links":{"resolver":"https://pith.science/pith/KJS3EGM5RV7KTZMVCGK2VVEK4G","bundle":"https://pith.science/pith/KJS3EGM5RV7KTZMVCGK2VVEK4G/bundle.json","state":"https://pith.science/pith/KJS3EGM5RV7KTZMVCGK2VVEK4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJS3EGM5RV7KTZMVCGK2VVEK4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KJS3EGM5RV7KTZMVCGK2VVEK4G","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":"b5cfaf75ce39ab1f2f12f5265563eb037388885866467952a87c1f40cb2a6b6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-12-22T07:07:59Z","title_canon_sha256":"7524bffdcd9f2f2c92c7221ecb1a07e1643e695cd0b9cebd1446f2173761fc7e"},"schema_version":"1.0","source":{"id":"1012.4893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4893","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4893v1","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4893","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"KJS3EGM5RV7K","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KJS3EGM5RV7KTZMV","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KJS3EGM5","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:e218513152d08488fa8f2efda1e64698ba4765ba9bb938147e1bcfdfc53b7a80","target":"graph","created_at":"2026-05-18T04:32:45Z","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":"Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, and then of so-called complete sets of diagrams.  The method is similar to the computation of critical pairs for the completion of term rewriting systems. We explore cases where the computation of these overlaps can be done in a first order ","authors_text":"Conrad Rau, Manfred Schmidt-Schau{\\ss}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-12-22T07:07:59Z","title":"Towards Correctness of Program Transformations Through Unification and Critical Pair Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4893","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:7ee5d74b2c9e5cd8e1b05c9f4fbf99490178ba03e80409d9e98514442dbfc358","target":"record","created_at":"2026-05-18T04:32:45Z","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":"b5cfaf75ce39ab1f2f12f5265563eb037388885866467952a87c1f40cb2a6b6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-12-22T07:07:59Z","title_canon_sha256":"7524bffdcd9f2f2c92c7221ecb1a07e1643e695cd0b9cebd1446f2173761fc7e"},"schema_version":"1.0","source":{"id":"1012.4893","kind":"arxiv","version":1}},"canonical_sha256":"5265b2199d8d7ea9e5951195aad48ae193e0a15c1471a9236ea63285935fb650","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5265b2199d8d7ea9e5951195aad48ae193e0a15c1471a9236ea63285935fb650","first_computed_at":"2026-05-18T04:32:45.006937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:45.006937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uW7fcOafecshOFnUEbkz9ttdwS3/KIoK6vTosk6MJFqfikvti4GY9UT31mCPT5zotGFuGk05SIxlbwyvTjQrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:45.007455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ee5d74b2c9e5cd8e1b05c9f4fbf99490178ba03e80409d9e98514442dbfc358","sha256:e218513152d08488fa8f2efda1e64698ba4765ba9bb938147e1bcfdfc53b7a80"],"state_sha256":"d03f33c97ec6b2dd28b373a20d0f0f30a99d16e0e90fedcb5ea835518c57ecff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UMX+voSCDL3HJKQTcLZeoU2WoBdLYzwmb9gGApaI6ijRsqJ0yeapxYUFyIrS1HtJnLr7i40UDJa26yM9N5jBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:18:40.931527Z","bundle_sha256":"c9abb74dcefea73ee83ec31249a2a281f406c4a0a97b8b656c264f0a4a2ce26b"}}