{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7DKD3HE6LD3R3SSAQ2M2KBMVYX","short_pith_number":"pith:7DKD3HE6","canonical_record":{"source":{"id":"1211.6194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-27T02:37:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1363b7a5bab5edc82b803450c1d946910b60bf2a1a9378fbb965cbfe3c0c29ec","abstract_canon_sha256":"4b54d9673396d3c330b3bf30af1d98a6abddd2c7fb815e37b20d161951d8a3d5"},"schema_version":"1.0"},"canonical_sha256":"f8d43d9c9e58f71dca408699a50595c5ea64261794b1ea8caacda22af92b938f","source":{"kind":"arxiv","id":"1211.6194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6194","created_at":"2026-05-18T03:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6194v1","created_at":"2026-05-18T03:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6194","created_at":"2026-05-18T03:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"7DKD3HE6LD3R","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7DKD3HE6LD3R3SSA","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7DKD3HE6","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7DKD3HE6LD3R3SSAQ2M2KBMVYX","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-27T02:37:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1363b7a5bab5edc82b803450c1d946910b60bf2a1a9378fbb965cbfe3c0c29ec","abstract_canon_sha256":"4b54d9673396d3c330b3bf30af1d98a6abddd2c7fb815e37b20d161951d8a3d5"},"schema_version":"1.0"},"canonical_sha256":"f8d43d9c9e58f71dca408699a50595c5ea64261794b1ea8caacda22af92b938f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:52.301249Z","signature_b64":"XMrB3v1T3m1IUftLPmdelGRwkcwKsGez7z4qw8HlZApMey+3d8JdQpZLWA3qKAgFwL6WZ5F3ekkn/V6VAheIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8d43d9c9e58f71dca408699a50595c5ea64261794b1ea8caacda22af92b938f","last_reissued_at":"2026-05-18T03:39:52.300828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:52.300828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6194","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-18T03:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5O/AI4FjuWMStDqTabg8HrsdxrbiRGgthSsjheLt/rCUk/b7eklBivXP+l6RwmGdWWyWSZHAhCd6G8kuMDPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:50:40.913925Z"},"content_sha256":"0e370aed5c76bb9b1850c5220256b7459448547e3c389b9760daf23f6e222bbd","schema_version":"1.0","event_id":"sha256:0e370aed5c76bb9b1850c5220256b7459448547e3c389b9760daf23f6e222bbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7DKD3HE6LD3R3SSAQ2M2KBMVYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Alexandre David, Ji\\v{r}\\'i Srba, Lasse Jacobsen, Morten Jacobsen","submitted_at":"2012-11-27T02:37:14Z","abstract_excerpt":"Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We present a direct, DBM-based algorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants. We also give a complete proof of its correctness, including reduction techniques based on symmetries and extrapolation. Finally, we augment the algorithm with a novel state-space reduction technique introducing a monotonic ordering on markings and prove its soundness ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6194","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-18T03:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WClWK6gJS2yWKEHb4Jt9dXQJGuN7MhOzp6tEE3cJu3Xgj8ONlUpw7+ui5n+K5fO3ygey8uwYIc4ybFX52HBqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:50:40.914269Z"},"content_sha256":"4906934043efcc71bc765f261ef66ac05705cc9f657e769b060c68abed4c6928","schema_version":"1.0","event_id":"sha256:4906934043efcc71bc765f261ef66ac05705cc9f657e769b060c68abed4c6928"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/bundle.json","state_url":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/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-22T17:50:40Z","links":{"resolver":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX","bundle":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/bundle.json","state":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7DKD3HE6LD3R3SSAQ2M2KBMVYX","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":"4b54d9673396d3c330b3bf30af1d98a6abddd2c7fb815e37b20d161951d8a3d5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-27T02:37:14Z","title_canon_sha256":"1363b7a5bab5edc82b803450c1d946910b60bf2a1a9378fbb965cbfe3c0c29ec"},"schema_version":"1.0","source":{"id":"1211.6194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6194","created_at":"2026-05-18T03:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6194v1","created_at":"2026-05-18T03:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6194","created_at":"2026-05-18T03:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"7DKD3HE6LD3R","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7DKD3HE6LD3R3SSA","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7DKD3HE6","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:4906934043efcc71bc765f261ef66ac05705cc9f657e769b060c68abed4c6928","target":"graph","created_at":"2026-05-18T03:39:52Z","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":"Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We present a direct, DBM-based algorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants. We also give a complete proof of its correctness, including reduction techniques based on symmetries and extrapolation. Finally, we augment the algorithm with a novel state-space reduction technique introducing a monotonic ordering on markings and prove its soundness ev","authors_text":"Alexandre David, Ji\\v{r}\\'i Srba, Lasse Jacobsen, Morten Jacobsen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-27T02:37:14Z","title":"A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6194","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:0e370aed5c76bb9b1850c5220256b7459448547e3c389b9760daf23f6e222bbd","target":"record","created_at":"2026-05-18T03:39:52Z","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":"4b54d9673396d3c330b3bf30af1d98a6abddd2c7fb815e37b20d161951d8a3d5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-27T02:37:14Z","title_canon_sha256":"1363b7a5bab5edc82b803450c1d946910b60bf2a1a9378fbb965cbfe3c0c29ec"},"schema_version":"1.0","source":{"id":"1211.6194","kind":"arxiv","version":1}},"canonical_sha256":"f8d43d9c9e58f71dca408699a50595c5ea64261794b1ea8caacda22af92b938f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8d43d9c9e58f71dca408699a50595c5ea64261794b1ea8caacda22af92b938f","first_computed_at":"2026-05-18T03:39:52.300828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:52.300828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XMrB3v1T3m1IUftLPmdelGRwkcwKsGez7z4qw8HlZApMey+3d8JdQpZLWA3qKAgFwL6WZ5F3ekkn/V6VAheIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:52.301249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e370aed5c76bb9b1850c5220256b7459448547e3c389b9760daf23f6e222bbd","sha256:4906934043efcc71bc765f261ef66ac05705cc9f657e769b060c68abed4c6928"],"state_sha256":"e7d820de574da5be325be674b8efb722aa448a9c2c506923b11d9ae80c94a306"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2StEtrTLYM7lu2fKBWKI9Oas5DKqsby80A5pycR3qA43vBpJry4fDVob1xgo0qjUtqdeORg05PJS/lAujCtBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:50:40.916233Z","bundle_sha256":"7c03c82f742c336b1a47f08133054845236935e7c0b8ad7de5d8b2a239490cd4"}}