{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JQTIPXOE2NY4M2EBXZ5RJO4LAT","short_pith_number":"pith:JQTIPXOE","schema_version":"1.0","canonical_sha256":"4c2687ddc4d371c66881be7b14bb8b04d77d560f5c0d230e7678acb786d8be60","source":{"kind":"arxiv","id":"1410.5131","version":7},"attestation_state":"computed","paper":{"title":"An Algebra of Reversible Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Yong Wang","submitted_at":"2014-10-20T00:50:25Z","abstract_excerpt":"Process algebra ACP based on the interleaving semantics can not be reversed. We design a reversible version of APTC called RAPTC. It has algebraic laws of reversible choice, sequence, parallelism, communication, silent step and abstraction, and also the soundness and completeness modulo strongly forward-reverse truly concurrent bisimulations and weakly forward-reverse truly concurrent bisimulations."},"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":"1410.5131","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-20T00:50:25Z","cross_cats_sorted":[],"title_canon_sha256":"f1a5dbee82de6771b1f1eacf848beb9da504a54c00a269efb0f35c6c9639a8c8","abstract_canon_sha256":"ed22da706fb32563feafb67392d42a1f4c885637293d1ddbcf590050d8b6c8a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:02.251541Z","signature_b64":"ymznxpU8dIrE0uwtXu9SWllHYsHbIfTbPhFAGWtWLKkhpHZ5SfVpEibkrE6BNvKp/y2squ5+K8D1rbXeAmR+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2687ddc4d371c66881be7b14bb8b04d77d560f5c0d230e7678acb786d8be60","last_reissued_at":"2026-05-18T00:17:02.250978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:02.250978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algebra of Reversible Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Yong Wang","submitted_at":"2014-10-20T00:50:25Z","abstract_excerpt":"Process algebra ACP based on the interleaving semantics can not be reversed. We design a reversible version of APTC called RAPTC. It has algebraic laws of reversible choice, sequence, parallelism, communication, silent step and abstraction, and also the soundness and completeness modulo strongly forward-reverse truly concurrent bisimulations and weakly forward-reverse truly concurrent bisimulations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5131","kind":"arxiv","version":7},"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":"1410.5131","created_at":"2026-05-18T00:17:02.251065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5131v7","created_at":"2026-05-18T00:17:02.251065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5131","created_at":"2026-05-18T00:17:02.251065+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQTIPXOE2NY4","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQTIPXOE2NY4M2EB","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQTIPXOE","created_at":"2026-05-18T12:28:35.611951+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/JQTIPXOE2NY4M2EBXZ5RJO4LAT","json":"https://pith.science/pith/JQTIPXOE2NY4M2EBXZ5RJO4LAT.json","graph_json":"https://pith.science/api/pith-number/JQTIPXOE2NY4M2EBXZ5RJO4LAT/graph.json","events_json":"https://pith.science/api/pith-number/JQTIPXOE2NY4M2EBXZ5RJO4LAT/events.json","paper":"https://pith.science/paper/JQTIPXOE"},"agent_actions":{"view_html":"https://pith.science/pith/JQTIPXOE2NY4M2EBXZ5RJO4LAT","download_json":"https://pith.science/pith/JQTIPXOE2NY4M2EBXZ5RJO4LAT.json","view_paper":"https://pith.science/paper/JQTIPXOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5131&json=true","fetch_graph":"https://pith.science/api/pith-number/JQTIPXOE2NY4M2EBXZ5RJO4LAT/graph.json","fetch_events":"https://pith.science/api/pith-number/JQTIPXOE2NY4M2EBXZ5RJO4LAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQTIPXOE2NY4M2EBXZ5RJO4LAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQTIPXOE2NY4M2EBXZ5RJO4LAT/action/storage_attestation","attest_author":"https://pith.science/pith/JQTIPXOE2NY4M2EBXZ5RJO4LAT/action/author_attestation","sign_citation":"https://pith.science/pith/JQTIPXOE2NY4M2EBXZ5RJO4LAT/action/citation_signature","submit_replication":"https://pith.science/pith/JQTIPXOE2NY4M2EBXZ5RJO4LAT/action/replication_record"}},"created_at":"2026-05-18T00:17:02.251065+00:00","updated_at":"2026-05-18T00:17:02.251065+00:00"}