{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OILDHINTJWT2SARB2RWJZ52ZIM","short_pith_number":"pith:OILDHINT","canonical_record":{"source":{"id":"1111.7154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-30T13:27:34Z","cross_cats_sorted":["math.LO","quant-ph"],"title_canon_sha256":"0aa084330fbc4d8579256e915dc9bbd030b78dbde135b88ffad97649ebb46d67","abstract_canon_sha256":"414af1a5c8b7acd0ab45a006b6282721f2e343ca2fd9def6fed7d9d5f0bf7956"},"schema_version":"1.0"},"canonical_sha256":"721633a1b34da7a90221d46c9cf7594318aaae602a3c29f54fea45c50986a6b6","source":{"kind":"arxiv","id":"1111.7154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.7154","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.7154v1","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.7154","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"OILDHINTJWT2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OILDHINTJWT2SARB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OILDHINT","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OILDHINTJWT2SARB2RWJZ52ZIM","target":"record","payload":{"canonical_record":{"source":{"id":"1111.7154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-30T13:27:34Z","cross_cats_sorted":["math.LO","quant-ph"],"title_canon_sha256":"0aa084330fbc4d8579256e915dc9bbd030b78dbde135b88ffad97649ebb46d67","abstract_canon_sha256":"414af1a5c8b7acd0ab45a006b6282721f2e343ca2fd9def6fed7d9d5f0bf7956"},"schema_version":"1.0"},"canonical_sha256":"721633a1b34da7a90221d46c9cf7594318aaae602a3c29f54fea45c50986a6b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:18.690929Z","signature_b64":"rz1O38a0O24bjtv4yOvQvze2LoomTlvteGDk9QicUL6lAQt6SB5sDLw10kLDMMCITdKL/YCgN8zg4Rrurd1ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"721633a1b34da7a90221d46c9cf7594318aaae602a3c29f54fea45c50986a6b6","last_reissued_at":"2026-05-18T04:07:18.690257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:18.690257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.7154","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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K75M3MnLbFtaz5lJvM/TsQ0vwVI1Mvdha62xQC0kXKnA9dWvcTAetxivog0L6brp3mYx7pXDAW+8ieoZJPvOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:52:22.596942Z"},"content_sha256":"e2efec1bb7b2c1b204fdf9a3595e23a39fbc81194a5d0229cb0b7f692870076b","schema_version":"1.0","event_id":"sha256:e2efec1bb7b2c1b204fdf9a3595e23a39fbc81194a5d0229cb0b7f692870076b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OILDHINTJWT2SARB2RWJZ52ZIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Structural Approach to Reversible Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO","quant-ph"],"primary_cat":"cs.LO","authors_text":"Samson Abramsky","submitted_at":"2011-11-30T13:27:34Z","abstract_excerpt":"Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on simulations of low-level machine models. By contrast, we develop a more structural approach. We show how high-level functional programs can be mapped compositionally (i.e. in a syntax-directed fashion) into a simple kind of automata which are immediately seen to be reversible. The size of the automaton is linear in the size of the functional term. In mathematical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.7154","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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmdng0kqO0gO+g1xxmhdN/CgBLfJqoYOnMMcYfAdS73rHdxHDdNSGTQWYj5otVE3eaC/ae6wNw5xmaDZcMHDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:52:22.597649Z"},"content_sha256":"a2c857ec5368a7c96ac9d2a1d83442250d931286ce83f83224f5c15cff84a9cd","schema_version":"1.0","event_id":"sha256:a2c857ec5368a7c96ac9d2a1d83442250d931286ce83f83224f5c15cff84a9cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OILDHINTJWT2SARB2RWJZ52ZIM/bundle.json","state_url":"https://pith.science/pith/OILDHINTJWT2SARB2RWJZ52ZIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OILDHINTJWT2SARB2RWJZ52ZIM/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-26T16:52:22Z","links":{"resolver":"https://pith.science/pith/OILDHINTJWT2SARB2RWJZ52ZIM","bundle":"https://pith.science/pith/OILDHINTJWT2SARB2RWJZ52ZIM/bundle.json","state":"https://pith.science/pith/OILDHINTJWT2SARB2RWJZ52ZIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OILDHINTJWT2SARB2RWJZ52ZIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OILDHINTJWT2SARB2RWJZ52ZIM","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":"414af1a5c8b7acd0ab45a006b6282721f2e343ca2fd9def6fed7d9d5f0bf7956","cross_cats_sorted":["math.LO","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-30T13:27:34Z","title_canon_sha256":"0aa084330fbc4d8579256e915dc9bbd030b78dbde135b88ffad97649ebb46d67"},"schema_version":"1.0","source":{"id":"1111.7154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.7154","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.7154v1","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.7154","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"OILDHINTJWT2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OILDHINTJWT2SARB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OILDHINT","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:a2c857ec5368a7c96ac9d2a1d83442250d931286ce83f83224f5c15cff84a9cd","target":"graph","created_at":"2026-05-18T04:07:18Z","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":"Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on simulations of low-level machine models. By contrast, we develop a more structural approach. We show how high-level functional programs can be mapped compositionally (i.e. in a syntax-directed fashion) into a simple kind of automata which are immediately seen to be reversible. The size of the automaton is linear in the size of the functional term. In mathematical","authors_text":"Samson Abramsky","cross_cats":["math.LO","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-30T13:27:34Z","title":"A Structural Approach to Reversible Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.7154","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:e2efec1bb7b2c1b204fdf9a3595e23a39fbc81194a5d0229cb0b7f692870076b","target":"record","created_at":"2026-05-18T04:07:18Z","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":"414af1a5c8b7acd0ab45a006b6282721f2e343ca2fd9def6fed7d9d5f0bf7956","cross_cats_sorted":["math.LO","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-30T13:27:34Z","title_canon_sha256":"0aa084330fbc4d8579256e915dc9bbd030b78dbde135b88ffad97649ebb46d67"},"schema_version":"1.0","source":{"id":"1111.7154","kind":"arxiv","version":1}},"canonical_sha256":"721633a1b34da7a90221d46c9cf7594318aaae602a3c29f54fea45c50986a6b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"721633a1b34da7a90221d46c9cf7594318aaae602a3c29f54fea45c50986a6b6","first_computed_at":"2026-05-18T04:07:18.690257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:18.690257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rz1O38a0O24bjtv4yOvQvze2LoomTlvteGDk9QicUL6lAQt6SB5sDLw10kLDMMCITdKL/YCgN8zg4Rrurd1ZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:18.690929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.7154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2efec1bb7b2c1b204fdf9a3595e23a39fbc81194a5d0229cb0b7f692870076b","sha256:a2c857ec5368a7c96ac9d2a1d83442250d931286ce83f83224f5c15cff84a9cd"],"state_sha256":"4c4e33fcba72fac64df1032f9875ef3994ed7cfb0ea7f586fa88f71baea2b356"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKy1y2UiLLfCW5qffePd6jTO2/0A5IP7CVWVxBd1msfq5e96Yqh+WgenbQEk/BrgA/7GmrtaCDO6ywL9LmNBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:52:22.601149Z","bundle_sha256":"d8e5bb40749210dd84389c24aa3a1823b1741e19e44f5697b3fc909878d0f1d2"}}