{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SL3QW7NOJB5OV7TKXA5O7VUPCL","short_pith_number":"pith:SL3QW7NO","schema_version":"1.0","canonical_sha256":"92f70b7dae487aeafe6ab83aefd68f12c07b11fb9b4e60cd47dbc35dbcc6235f","source":{"kind":"arxiv","id":"1710.02804","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.02804","created_at":"2026-05-18T00:33:28.783661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02804v1","created_at":"2026-05-18T00:33:28.783661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02804","created_at":"2026-05-18T00:33:28.783661+00:00"},{"alias_kind":"pith_short_12","alias_value":"SL3QW7NOJB5O","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SL3QW7NOJB5OV7TK","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SL3QW7NO","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.22844","citing_title":"Operational Inexpressibility at the Step-Duplicating Primitive Recursor Orientation Boundary","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2604.22844","citing_title":"Operational Inexpressibility at the Step-Duplicating Primitive Recursor Orientation Boundary","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL","json":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL.json","graph_json":"https://pith.science/api/pith-number/SL3QW7NOJB5OV7TKXA5O7VUPCL/graph.json","events_json":"https://pith.science/api/pith-number/SL3QW7NOJB5OV7TKXA5O7VUPCL/events.json","paper":"https://pith.science/paper/SL3QW7NO"},"agent_actions":{"view_html":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL","download_json":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL.json","view_paper":"https://pith.science/paper/SL3QW7NO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02804&json=true","fetch_graph":"https://pith.science/api/pith-number/SL3QW7NOJB5OV7TKXA5O7VUPCL/graph.json","fetch_events":"https://pith.science/api/pith-number/SL3QW7NOJB5OV7TKXA5O7VUPCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/action/storage_attestation","attest_author":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/action/author_attestation","sign_citation":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/action/citation_signature","submit_replication":"https://pith.science/pith/SL3QW7NOJB5OV7TKXA5O7VUPCL/action/replication_record"}},"created_at":"2026-05-18T00:33:28.783661+00:00","updated_at":"2026-05-18T00:33:28.783661+00:00"}