{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6JFBV3U3R6B4OLYWBHPHZPFJI4","short_pith_number":"pith:6JFBV3U3","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"},"canonical_sha256":"f24a1aee9b8f83c72f1609de7cbca9470bd622301b1285d15dd4b75be6109409","source":{"kind":"arxiv","id":"1804.04607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04607","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04607v1","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04607","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"pith_short_12","alias_value":"6JFBV3U3R6B4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6JFBV3U3R6B4OLYW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6JFBV3U3","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6JFBV3U3R6B4OLYWBHPHZPFJI4","target":"record","payload":{"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"},"canonical_sha256":"f24a1aee9b8f83c72f1609de7cbca9470bd622301b1285d15dd4b75be6109409","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"},"source_kind":"arxiv","source_id":"1804.04607","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:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tAcqHeza9MmDyz/WZXwxME5yRA3KJhJ7rXxc2DeQ1ghrRJY1hJgJQB8hew7X3Lu6eqxXQZraG9nddZjDlnarAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:02:30.544261Z"},"content_sha256":"84cce6912bcfc08e2657e00d1ad94d7c2b699daf3110ec7285bc4ec5e77b7ac8","schema_version":"1.0","event_id":"sha256:84cce6912bcfc08e2657e00d1ad94d7c2b699daf3110ec7285bc4ec5e77b7ac8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6JFBV3U3R6B4OLYWBHPHZPFJI4","target":"graph","payload":{"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"},"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:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6arucyLZt8j9BhkcdIV9s0tQCMLlB08mn208ZrFWeGhSvhgS1jURiR21otslEjnXNS8NRLC20nqScQhWdPdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:02:30.544949Z"},"content_sha256":"9ae9aa6baed6a80cd4e3522c67815eb1bba45bc277064cf700f464ccf41b1b38","schema_version":"1.0","event_id":"sha256:9ae9aa6baed6a80cd4e3522c67815eb1bba45bc277064cf700f464ccf41b1b38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/bundle.json","state_url":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/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-06-08T20:02:30Z","links":{"resolver":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4","bundle":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/bundle.json","state":"https://pith.science/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JFBV3U3R6B4OLYWBHPHZPFJI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6JFBV3U3R6B4OLYWBHPHZPFJI4","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":"0bccef530d67466f762a80cf3128e527e3439eb1d813b928d1c0f9e23da24bf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:11:00Z","title_canon_sha256":"3f69a5660a7766b5cecd95edb551f18e468a9cbb525557c9eda83a25f64d1c7f"},"schema_version":"1.0","source":{"id":"1804.04607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04607","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04607v1","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04607","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"pith_short_12","alias_value":"6JFBV3U3R6B4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6JFBV3U3R6B4OLYW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6JFBV3U3","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:9ae9aa6baed6a80cd4e3522c67815eb1bba45bc277064cf700f464ccf41b1b38","target":"graph","created_at":"2026-05-18T00:18:36Z","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":"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","authors_text":"Anna Philippou, Kyriaki Psara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:11:00Z","title":"Reversible Computation in Petri Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04607","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:84cce6912bcfc08e2657e00d1ad94d7c2b699daf3110ec7285bc4ec5e77b7ac8","target":"record","created_at":"2026-05-18T00:18:36Z","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":"0bccef530d67466f762a80cf3128e527e3439eb1d813b928d1c0f9e23da24bf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:11:00Z","title_canon_sha256":"3f69a5660a7766b5cecd95edb551f18e468a9cbb525557c9eda83a25f64d1c7f"},"schema_version":"1.0","source":{"id":"1804.04607","kind":"arxiv","version":1}},"canonical_sha256":"f24a1aee9b8f83c72f1609de7cbca9470bd622301b1285d15dd4b75be6109409","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f24a1aee9b8f83c72f1609de7cbca9470bd622301b1285d15dd4b75be6109409","first_computed_at":"2026-05-18T00:18:36.795580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:36.795580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qZXCjHSdHZQLuQytd8EHOe/lhCL7RdZascY5PoFL6CzILUQWwtetvJ+qiEJCeSzb+mmAHDfP9kNyHCD2ZqMZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:36.796096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84cce6912bcfc08e2657e00d1ad94d7c2b699daf3110ec7285bc4ec5e77b7ac8","sha256:9ae9aa6baed6a80cd4e3522c67815eb1bba45bc277064cf700f464ccf41b1b38"],"state_sha256":"61a9e98bc22bb8ca05044a559c5425cdbe595c605601e1ac3b6eee5601d664db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cN/rWbKoCgkhrUYPohdZFknnSSETxXBInoILObiLici+u5jsj3vAYwEUHF/L7E9XQJ17PyqjHSP6vtiMD02gCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:02:30.549042Z","bundle_sha256":"2b85645d828f810d7f115f90277335be1271256d483ead37c2abd10cacdc41db"}}