{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6JFBV3U3R6B4OLYWBHPHZPFJI4","short_pith_number":"pith:6JFBV3U3","schema_version":"1.0","canonical_sha256":"f24a1aee9b8f83c72f1609de7cbca9470bd622301b1285d15dd4b75be6109409","source":{"kind":"arxiv","id":"1804.04607","version":1},"attestation_state":"computed","paper":{"title":"Reversible Computation in Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anna Philippou, Kyriaki Psara","submitted_at":"2018-04-10T11:11:00Z","abstract_excerpt":"Reversible computation is an unconventional form of computing where any executed sequence of operations can be executed in reverse at any point during computation. It has recently been attracting increasing attention in various research communities as on the one hand it promises low-power computation and on the other hand it is inherent or of interest in a variety of applications. In this paper, we propose a reversible approach to Petri nets by introducing machinery and associated operational semantics to tackle the challenges of the three main forms of reversibility, namely, backtracking, cau"},"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":"1804.04607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:11:00Z","cross_cats_sorted":[],"title_canon_sha256":"3f69a5660a7766b5cecd95edb551f18e468a9cbb525557c9eda83a25f64d1c7f","abstract_canon_sha256":"0bccef530d67466f762a80cf3128e527e3439eb1d813b928d1c0f9e23da24bf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:36.796096Z","signature_b64":"qZXCjHSdHZQLuQytd8EHOe/lhCL7RdZascY5PoFL6CzILUQWwtetvJ+qiEJCeSzb+mmAHDfP9kNyHCD2ZqMZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f24a1aee9b8f83c72f1609de7cbca9470bd622301b1285d15dd4b75be6109409","last_reissued_at":"2026-05-18T00:18:36.795580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:36.795580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reversible Computation in Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anna Philippou, Kyriaki Psara","submitted_at":"2018-04-10T11:11:00Z","abstract_excerpt":"Reversible computation is an unconventional form of computing where any executed sequence of operations can be executed in reverse at any point during computation. It has recently been attracting increasing attention in various research communities as on the one hand it promises low-power computation and on the other hand it is inherent or of interest in a variety of applications. In this paper, we propose a reversible approach to Petri nets by introducing machinery and associated operational semantics to tackle the challenges of the three main forms of reversibility, namely, backtracking, cau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04607","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":"1804.04607","created_at":"2026-05-18T00:18:36.795655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04607v1","created_at":"2026-05-18T00:18:36.795655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04607","created_at":"2026-05-18T00:18:36.795655+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JFBV3U3R6B4","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JFBV3U3R6B4OLYW","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JFBV3U3","created_at":"2026-05-18T12:32:08.215937+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/6JFBV3U3R6B4OLYWBHPHZPFJI4","json":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4.json","graph_json":"https://pith.science/api/pith-number/6JFBV3U3R6B4OLYWBHPHZPFJI4/graph.json","events_json":"https://pith.science/api/pith-number/6JFBV3U3R6B4OLYWBHPHZPFJI4/events.json","paper":"https://pith.science/paper/6JFBV3U3"},"agent_actions":{"view_html":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4","download_json":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4.json","view_paper":"https://pith.science/paper/6JFBV3U3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04607&json=true","fetch_graph":"https://pith.science/api/pith-number/6JFBV3U3R6B4OLYWBHPHZPFJI4/graph.json","fetch_events":"https://pith.science/api/pith-number/6JFBV3U3R6B4OLYWBHPHZPFJI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/action/storage_attestation","attest_author":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/action/author_attestation","sign_citation":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/action/citation_signature","submit_replication":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/action/replication_record"}},"created_at":"2026-05-18T00:18:36.795655+00:00","updated_at":"2026-05-18T00:18:36.795655+00:00"}