{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WN7JAFW6K25IQ4LDXEFBWZ72KN","short_pith_number":"pith:WN7JAFW6","canonical_record":{"source":{"id":"1608.05521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-19T08:01:25Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ea1d6187899e90ede221452842f204088d36cc360eb146f2b401be5264522ff7","abstract_canon_sha256":"dc13f4d4286452e4533b5694deb9c5365c95c08ed3c1abe523df23f242a15e86"},"schema_version":"1.0"},"canonical_sha256":"b37e9016de56ba887163b90a1b67fa537a5094552034c64048799d824a066f74","source":{"kind":"arxiv","id":"1608.05521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05521","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05521v1","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05521","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"WN7JAFW6K25I","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WN7JAFW6K25IQ4LD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WN7JAFW6","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WN7JAFW6K25IQ4LDXEFBWZ72KN","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-19T08:01:25Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ea1d6187899e90ede221452842f204088d36cc360eb146f2b401be5264522ff7","abstract_canon_sha256":"dc13f4d4286452e4533b5694deb9c5365c95c08ed3c1abe523df23f242a15e86"},"schema_version":"1.0"},"canonical_sha256":"b37e9016de56ba887163b90a1b67fa537a5094552034c64048799d824a066f74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:28.273033Z","signature_b64":"nnYpoCJi/bjlQt/edrOxZKjRnvRdbfXcO7c/JfxtrN2tQUb/Iog563EyPf5XDtw9r5O/RSNdvFANAvAf04SwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b37e9016de56ba887163b90a1b67fa537a5094552034c64048799d824a066f74","last_reissued_at":"2026-05-18T01:08:28.272558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:28.272558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05521","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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6OX+Dg989WuNxdMt+oDrJOU9DOi7oJoP07w9UJgCvaW0Op1WcJoj5mx2TPRHgEL+6qPjTCytKT0/RSKQQlHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:38:00.842061Z"},"content_sha256":"f739bb22f1f6342d0e70f046cbd3be57efb434b4d56c437f38da3d2e6c511380","schema_version":"1.0","event_id":"sha256:f739bb22f1f6342d0e70f046cbd3be57efb434b4d56c437f38da3d2e6c511380"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WN7JAFW6K25IQ4LDXEFBWZ72KN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Reversible Computation in Erlang","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Adri\\'an Palacios, Germ\\'an Vidal, Naoki Nishida","submitted_at":"2016-08-19T08:01:25Z","abstract_excerpt":"In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for debugging and for enforcing fault-tolerance, among others. In this paper, we consider a subset of Erlang, a concurrent language based on the actor model. We formally introduce a reversible semantics for this language. To the best of our knowledge, this is the first attempt to define a reversible semantics for Erlang."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05521","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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGltbsaYFrSHNrOAgxBuAOQ+dX613Wp3IGUhDzOR8C1jIeaYMeoHvaPXarsqpICf7irbDdCYolPCWzM2+nccBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:38:00.842736Z"},"content_sha256":"0a6b0bbc2dc35bf0458e18467226d1d4ecb5c1a1d0e87fa24925e2a0673665a8","schema_version":"1.0","event_id":"sha256:0a6b0bbc2dc35bf0458e18467226d1d4ecb5c1a1d0e87fa24925e2a0673665a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WN7JAFW6K25IQ4LDXEFBWZ72KN/bundle.json","state_url":"https://pith.science/pith/WN7JAFW6K25IQ4LDXEFBWZ72KN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WN7JAFW6K25IQ4LDXEFBWZ72KN/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-27T17:38:00Z","links":{"resolver":"https://pith.science/pith/WN7JAFW6K25IQ4LDXEFBWZ72KN","bundle":"https://pith.science/pith/WN7JAFW6K25IQ4LDXEFBWZ72KN/bundle.json","state":"https://pith.science/pith/WN7JAFW6K25IQ4LDXEFBWZ72KN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WN7JAFW6K25IQ4LDXEFBWZ72KN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WN7JAFW6K25IQ4LDXEFBWZ72KN","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":"dc13f4d4286452e4533b5694deb9c5365c95c08ed3c1abe523df23f242a15e86","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-19T08:01:25Z","title_canon_sha256":"ea1d6187899e90ede221452842f204088d36cc360eb146f2b401be5264522ff7"},"schema_version":"1.0","source":{"id":"1608.05521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05521","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05521v1","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05521","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"WN7JAFW6K25I","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WN7JAFW6K25IQ4LD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WN7JAFW6","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:0a6b0bbc2dc35bf0458e18467226d1d4ecb5c1a1d0e87fa24925e2a0673665a8","target":"graph","created_at":"2026-05-18T01:08: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":"In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for debugging and for enforcing fault-tolerance, among others. In this paper, we consider a subset of Erlang, a concurrent language based on the actor model. We formally introduce a reversible semantics for this language. To the best of our knowledge, this is the first attempt to define a reversible semantics for Erlang.","authors_text":"Adri\\'an Palacios, Germ\\'an Vidal, Naoki Nishida","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-19T08:01:25Z","title":"Towards Reversible Computation in Erlang"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05521","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:f739bb22f1f6342d0e70f046cbd3be57efb434b4d56c437f38da3d2e6c511380","target":"record","created_at":"2026-05-18T01:08: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":"dc13f4d4286452e4533b5694deb9c5365c95c08ed3c1abe523df23f242a15e86","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-19T08:01:25Z","title_canon_sha256":"ea1d6187899e90ede221452842f204088d36cc360eb146f2b401be5264522ff7"},"schema_version":"1.0","source":{"id":"1608.05521","kind":"arxiv","version":1}},"canonical_sha256":"b37e9016de56ba887163b90a1b67fa537a5094552034c64048799d824a066f74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b37e9016de56ba887163b90a1b67fa537a5094552034c64048799d824a066f74","first_computed_at":"2026-05-18T01:08:28.272558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:28.272558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nnYpoCJi/bjlQt/edrOxZKjRnvRdbfXcO7c/JfxtrN2tQUb/Iog563EyPf5XDtw9r5O/RSNdvFANAvAf04SwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:28.273033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f739bb22f1f6342d0e70f046cbd3be57efb434b4d56c437f38da3d2e6c511380","sha256:0a6b0bbc2dc35bf0458e18467226d1d4ecb5c1a1d0e87fa24925e2a0673665a8"],"state_sha256":"5c2b00d742146c71a271944b7705d80a7aeca113e61855e1b048912d55d2eb55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0i6zyTixL50Kvd602460KOpfxvGGXOqZMN97gxb/8ooA+fTWsv6M0UQWbWtSvuGx4OHNfcJAUvBHn2J88g5tDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:38:00.846171Z","bundle_sha256":"fd2cd6b4fb02b28153d175e0e95adff25bac3ca5dbb6d64be4706ca31fc9b141"}}