{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G4VZYC7VSKJ77Z5LAQTLAADA66","short_pith_number":"pith:G4VZYC7V","schema_version":"1.0","canonical_sha256":"372b9c0bf59293ffe7ab0426b00060f7bd79487eb05066dd527ce1f80803f1a4","source":{"kind":"arxiv","id":"1602.03594","version":1},"attestation_state":"computed","paper":{"title":"Reversible Communicating Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Amr Sabry (Indiana University School of Informatics, Computing), Geoffrey Brown (Indiana University School of Informatics","submitted_at":"2016-02-11T01:20:19Z","abstract_excerpt":"Reversible distributed programs have the ability to abort unproductive computation paths and backtrack, while unwinding communication that occurred in the aborted paths.  While it is natural to assume that reversibility implies full state recovery (as with traditional roll-back recovery protocols), an interesting alternative is to separate backtracking from local state recovery. For example, such a model could be used to create complex transactions out of nested compensable transactions where a programmer-supplied compensation defines the work required to  \"unwind\" a transaction.\n  Reversible "},"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":"1602.03594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-02-11T01:20:19Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ae51d17d8f220b25a084479f2fcdc343e1b48978ea05697a0ab3de1a6a1ab3bd","abstract_canon_sha256":"eadcb50f4c3d60ee0cf984bd3273c81287fb3d05b8b8ba64baa32482ee184da8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:57.034453Z","signature_b64":"7pLmt+R/Wpc+MnR50/72c1LOmI1BtnpIE30O1BGiEBSax4z248oAuM6VTPpI2lTn9Jy1UkPsNhRs6Td0OeJCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"372b9c0bf59293ffe7ab0426b00060f7bd79487eb05066dd527ce1f80803f1a4","last_reissued_at":"2026-05-18T01:20:57.034007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:57.034007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reversible Communicating Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Amr Sabry (Indiana University School of Informatics, Computing), Geoffrey Brown (Indiana University School of Informatics","submitted_at":"2016-02-11T01:20:19Z","abstract_excerpt":"Reversible distributed programs have the ability to abort unproductive computation paths and backtrack, while unwinding communication that occurred in the aborted paths.  While it is natural to assume that reversibility implies full state recovery (as with traditional roll-back recovery protocols), an interesting alternative is to separate backtracking from local state recovery. For example, such a model could be used to create complex transactions out of nested compensable transactions where a programmer-supplied compensation defines the work required to  \"unwind\" a transaction.\n  Reversible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03594","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":"1602.03594","created_at":"2026-05-18T01:20:57.034084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03594v1","created_at":"2026-05-18T01:20:57.034084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03594","created_at":"2026-05-18T01:20:57.034084+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4VZYC7VSKJ7","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4VZYC7VSKJ77Z5L","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4VZYC7V","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66","json":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66.json","graph_json":"https://pith.science/api/pith-number/G4VZYC7VSKJ77Z5LAQTLAADA66/graph.json","events_json":"https://pith.science/api/pith-number/G4VZYC7VSKJ77Z5LAQTLAADA66/events.json","paper":"https://pith.science/paper/G4VZYC7V"},"agent_actions":{"view_html":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66","download_json":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66.json","view_paper":"https://pith.science/paper/G4VZYC7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03594&json=true","fetch_graph":"https://pith.science/api/pith-number/G4VZYC7VSKJ77Z5LAQTLAADA66/graph.json","fetch_events":"https://pith.science/api/pith-number/G4VZYC7VSKJ77Z5LAQTLAADA66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66/action/storage_attestation","attest_author":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66/action/author_attestation","sign_citation":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66/action/citation_signature","submit_replication":"https://pith.science/pith/G4VZYC7VSKJ77Z5LAQTLAADA66/action/replication_record"}},"created_at":"2026-05-18T01:20:57.034084+00:00","updated_at":"2026-05-18T01:20:57.034084+00:00"}