{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SL3QW7NOJB5OV7TKXA5O7VUPCL","short_pith_number":"pith:SL3QW7NO","canonical_record":{"source":{"id":"1710.02804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-08T08:31:49Z","cross_cats_sorted":[],"title_canon_sha256":"7d8a13a8f7d486a7d50c5bb112caf27a5beaf9a663f4afb18d52d4c57aaedaf9","abstract_canon_sha256":"76b7cdb03f31421181f1c18369cbb76d012387d1b18d4f85132d05e849d9f2ab"},"schema_version":"1.0"},"canonical_sha256":"92f70b7dae487aeafe6ab83aefd68f12c07b11fb9b4e60cd47dbc35dbcc6235f","source":{"kind":"arxiv","id":"1710.02804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02804","created_at":"2026-05-18T00:33:28Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02804v1","created_at":"2026-05-18T00:33:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02804","created_at":"2026-05-18T00:33:28Z"},{"alias_kind":"pith_short_12","alias_value":"SL3QW7NOJB5O","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SL3QW7NOJB5OV7TK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SL3QW7NO","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SL3QW7NOJB5OV7TKXA5O7VUPCL","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-08T08:31:49Z","cross_cats_sorted":[],"title_canon_sha256":"7d8a13a8f7d486a7d50c5bb112caf27a5beaf9a663f4afb18d52d4c57aaedaf9","abstract_canon_sha256":"76b7cdb03f31421181f1c18369cbb76d012387d1b18d4f85132d05e849d9f2ab"},"schema_version":"1.0"},"canonical_sha256":"92f70b7dae487aeafe6ab83aefd68f12c07b11fb9b4e60cd47dbc35dbcc6235f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:28.784047Z","signature_b64":"RljsybpOrFLyZuDi95+MQjy6wqrk+Kg2nPpusxpheTxvWkyQFkCYZ/wj8i8bVGSxnX8//3GeI2vyJ/ES5WjhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92f70b7dae487aeafe6ab83aefd68f12c07b11fb9b4e60cd47dbc35dbcc6235f","last_reissued_at":"2026-05-18T00:33:28.783537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:28.783537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02804","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:33:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tTZsC42xf3a2x+OTd/Hl5lnG66UwFXGMVOa8k4fhEFc8mOM6LBHfQucpiIydQREWEqeR7YNbyHDstAMbArgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:07.928304Z"},"content_sha256":"3a244fa763ecbee255e9e96e476e61b253d5488227c1b32357c4a019bf7e913f","schema_version":"1.0","event_id":"sha256:3a244fa763ecbee255e9e96e476e61b253d5488227c1b32357c4a019bf7e913f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SL3QW7NOJB5OV7TKXA5O7VUPCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reversible Computation in Term Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Adri\\'an Palacios, Germ\\'an Vidal, Naoki Nishida","submitted_at":"2017-10-08T08:31:49Z","abstract_excerpt":"Essentially, in a reversible programming language, for each forward computation from state $S$ to state $S'$, there exists a constructive method to go backwards from state $S'$ to state $S$. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or quantum computing, to name a few.\n  In this work, we focus on term rewriting, a computation model that underlies most rule-based programming languages. In general, term rewriting is not reversible, even for injective fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02804","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:33:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMqD3VJoIja36xcfpxtjMod3Y/xmcVmYkIQMH/wopAfO06F9X6W6mcudDSWt9uARRxzZRC52kEMwiw6fnQrTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:07.928824Z"},"content_sha256":"6cb860715c0c46e73a63ee11e8f1e41d4a8b4d5e8fe635889d3e83d1377dfd11","schema_version":"1.0","event_id":"sha256:6cb860715c0c46e73a63ee11e8f1e41d4a8b4d5e8fe635889d3e83d1377dfd11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/bundle.json","state_url":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/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-26T08:30:07Z","links":{"resolver":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL","bundle":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/bundle.json","state":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SL3QW7NOJB5OV7TKXA5O7VUPCL","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":"76b7cdb03f31421181f1c18369cbb76d012387d1b18d4f85132d05e849d9f2ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-08T08:31:49Z","title_canon_sha256":"7d8a13a8f7d486a7d50c5bb112caf27a5beaf9a663f4afb18d52d4c57aaedaf9"},"schema_version":"1.0","source":{"id":"1710.02804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02804","created_at":"2026-05-18T00:33:28Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02804v1","created_at":"2026-05-18T00:33:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02804","created_at":"2026-05-18T00:33:28Z"},{"alias_kind":"pith_short_12","alias_value":"SL3QW7NOJB5O","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SL3QW7NOJB5OV7TK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SL3QW7NO","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:6cb860715c0c46e73a63ee11e8f1e41d4a8b4d5e8fe635889d3e83d1377dfd11","target":"graph","created_at":"2026-05-18T00:33:28Z","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":"Essentially, in a reversible programming language, for each forward computation from state $S$ to state $S'$, there exists a constructive method to go backwards from state $S'$ to state $S$. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or quantum computing, to name a few.\n  In this work, we focus on term rewriting, a computation model that underlies most rule-based programming languages. In general, term rewriting is not reversible, even for injective fun","authors_text":"Adri\\'an Palacios, Germ\\'an Vidal, Naoki Nishida","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-08T08:31:49Z","title":"Reversible Computation in Term Rewriting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02804","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:3a244fa763ecbee255e9e96e476e61b253d5488227c1b32357c4a019bf7e913f","target":"record","created_at":"2026-05-18T00:33:28Z","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":"76b7cdb03f31421181f1c18369cbb76d012387d1b18d4f85132d05e849d9f2ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-08T08:31:49Z","title_canon_sha256":"7d8a13a8f7d486a7d50c5bb112caf27a5beaf9a663f4afb18d52d4c57aaedaf9"},"schema_version":"1.0","source":{"id":"1710.02804","kind":"arxiv","version":1}},"canonical_sha256":"92f70b7dae487aeafe6ab83aefd68f12c07b11fb9b4e60cd47dbc35dbcc6235f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92f70b7dae487aeafe6ab83aefd68f12c07b11fb9b4e60cd47dbc35dbcc6235f","first_computed_at":"2026-05-18T00:33:28.783537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:28.783537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RljsybpOrFLyZuDi95+MQjy6wqrk+Kg2nPpusxpheTxvWkyQFkCYZ/wj8i8bVGSxnX8//3GeI2vyJ/ES5WjhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:28.784047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a244fa763ecbee255e9e96e476e61b253d5488227c1b32357c4a019bf7e913f","sha256:6cb860715c0c46e73a63ee11e8f1e41d4a8b4d5e8fe635889d3e83d1377dfd11"],"state_sha256":"50b59c16281c0522d2df0207fdcf27ebd7cf72c1903d7dc270abe952e546b25e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xTde7/pf6RaZC+yVQRWbEee6jjDSiMFntRngPqtlBBWXUFetoVxfgBukuyKp50bhQZzO57+utyHzwSSvysKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:30:07.932609Z","bundle_sha256":"cefcb9faebb0481edd2ace5a7c73e69c12e72bb34127dbe5fe688df4c0671c8b"}}