{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UM7M5NK7BZAPRRFYGY6W2HL6FM","short_pith_number":"pith:UM7M5NK7","canonical_record":{"source":{"id":"1806.07100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-06-19T08:35:51Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d77760792f5bba13320e391a8ec930bfbf46abaf88d0861052d22e69372d9ff2","abstract_canon_sha256":"6914894c0d50a3c502371e7fa9a897c44f7b99e7d1fc1a3ad50fe401c5ee8550"},"schema_version":"1.0"},"canonical_sha256":"a33eceb55f0e40f8c4b8363d6d1d7e2b3e3d2536fe48d81410fd74c48b97051d","source":{"kind":"arxiv","id":"1806.07100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07100","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07100v1","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07100","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"UM7M5NK7BZAP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UM7M5NK7BZAPRRFY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UM7M5NK7","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UM7M5NK7BZAPRRFYGY6W2HL6FM","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-06-19T08:35:51Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d77760792f5bba13320e391a8ec930bfbf46abaf88d0861052d22e69372d9ff2","abstract_canon_sha256":"6914894c0d50a3c502371e7fa9a897c44f7b99e7d1fc1a3ad50fe401c5ee8550"},"schema_version":"1.0"},"canonical_sha256":"a33eceb55f0e40f8c4b8363d6d1d7e2b3e3d2536fe48d81410fd74c48b97051d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:51.875628Z","signature_b64":"LT+/8jjFNPxQ4IMV11AWvxr7VyMLH7MBE5BTJSnDfyyoBeKssw92+ePXM9w4oQDPQ0M1q+6bMHVfZ/NChQ9iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a33eceb55f0e40f8c4b8363d6d1d7e2b3e3d2536fe48d81410fd74c48b97051d","last_reissued_at":"2026-05-18T00:12:51.874986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:51.874986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07100","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:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yf1NOfPCVtLAMZBM7Q85USO1X/jrG9A+izficuiFOKVJBZGxOVL/6XaM4nz2e26+FtcgcIEBrLizqYSxbRI3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T12:25:00.602179Z"},"content_sha256":"ff7e62240670b6a1e6e171c49a7ae8c7c3fd774254d929dea13ce2a758883a93","schema_version":"1.0","event_id":"sha256:ff7e62240670b6a1e6e171c49a7ae8c7c3fd774254d929dea13ce2a758883a93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UM7M5NK7BZAPRRFYGY6W2HL6FM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Theory of Reversibility for 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, Ivan Lanese, Naoki Nishida","submitted_at":"2018-06-19T08:35:51Z","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 testing and verification, among others. In this paper, we consider a subset of Erlang, a functional and concurrent programming language based on the actor model. We present a formal semantics for reversible computation in this language and prove its main properties, including its causal consistency. We also build on top of it a rollback operator that can be used "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07100","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:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HrxV1fiKLRPiFrwDIB/6WxNoBGf5FToBWZfEDGSbwSe0MZg9v4xYqWgXRkh3Fn9cXrV+jeQhAM7eEP3FLx+bBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T12:25:00.602538Z"},"content_sha256":"0b2cf3475bac70579b2e107b03760884bc4b520d5fcda48bdffd0749127aa882","schema_version":"1.0","event_id":"sha256:0b2cf3475bac70579b2e107b03760884bc4b520d5fcda48bdffd0749127aa882"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UM7M5NK7BZAPRRFYGY6W2HL6FM/bundle.json","state_url":"https://pith.science/pith/UM7M5NK7BZAPRRFYGY6W2HL6FM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UM7M5NK7BZAPRRFYGY6W2HL6FM/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-07-04T12:25:00Z","links":{"resolver":"https://pith.science/pith/UM7M5NK7BZAPRRFYGY6W2HL6FM","bundle":"https://pith.science/pith/UM7M5NK7BZAPRRFYGY6W2HL6FM/bundle.json","state":"https://pith.science/pith/UM7M5NK7BZAPRRFYGY6W2HL6FM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UM7M5NK7BZAPRRFYGY6W2HL6FM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UM7M5NK7BZAPRRFYGY6W2HL6FM","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":"6914894c0d50a3c502371e7fa9a897c44f7b99e7d1fc1a3ad50fe401c5ee8550","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-06-19T08:35:51Z","title_canon_sha256":"d77760792f5bba13320e391a8ec930bfbf46abaf88d0861052d22e69372d9ff2"},"schema_version":"1.0","source":{"id":"1806.07100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07100","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07100v1","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07100","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"UM7M5NK7BZAP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UM7M5NK7BZAPRRFY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UM7M5NK7","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:0b2cf3475bac70579b2e107b03760884bc4b520d5fcda48bdffd0749127aa882","target":"graph","created_at":"2026-05-18T00:12:51Z","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 testing and verification, among others. In this paper, we consider a subset of Erlang, a functional and concurrent programming language based on the actor model. We present a formal semantics for reversible computation in this language and prove its main properties, including its causal consistency. We also build on top of it a rollback operator that can be used ","authors_text":"Adri\\'an Palacios, Germ\\'an Vidal, Ivan Lanese, Naoki Nishida","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-06-19T08:35:51Z","title":"A Theory of Reversibility for Erlang"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07100","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:ff7e62240670b6a1e6e171c49a7ae8c7c3fd774254d929dea13ce2a758883a93","target":"record","created_at":"2026-05-18T00:12:51Z","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":"6914894c0d50a3c502371e7fa9a897c44f7b99e7d1fc1a3ad50fe401c5ee8550","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-06-19T08:35:51Z","title_canon_sha256":"d77760792f5bba13320e391a8ec930bfbf46abaf88d0861052d22e69372d9ff2"},"schema_version":"1.0","source":{"id":"1806.07100","kind":"arxiv","version":1}},"canonical_sha256":"a33eceb55f0e40f8c4b8363d6d1d7e2b3e3d2536fe48d81410fd74c48b97051d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a33eceb55f0e40f8c4b8363d6d1d7e2b3e3d2536fe48d81410fd74c48b97051d","first_computed_at":"2026-05-18T00:12:51.874986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:51.874986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LT+/8jjFNPxQ4IMV11AWvxr7VyMLH7MBE5BTJSnDfyyoBeKssw92+ePXM9w4oQDPQ0M1q+6bMHVfZ/NChQ9iBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:51.875628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff7e62240670b6a1e6e171c49a7ae8c7c3fd774254d929dea13ce2a758883a93","sha256:0b2cf3475bac70579b2e107b03760884bc4b520d5fcda48bdffd0749127aa882"],"state_sha256":"4e19a3282d04ce09ed63f9e7b287aa12fe18e5f63d284a28200586a8440ecbf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2EO5B+Qu0rccoAYy1lNbCt0ZxHqVCX85mVJQxoyZPecbEat6D3tMTktyFVoYHhug7VXaTgCGkBofanV/Y6LHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T12:25:00.604421Z","bundle_sha256":"3f535d87c118f7a73cbfcdbcd166dd19cb480535c56868db5f77f36ef07c806a"}}