{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RYBJLHE7AXWBR2JB7SXJ4E3BA5","short_pith_number":"pith:RYBJLHE7","canonical_record":{"source":{"id":"1907.01240","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-07-02T08:52:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"46b17502c503444881f6f78d8bcf7b5da6832628bc3a6cb4bf37635b0aa0b335","abstract_canon_sha256":"ea791d83c406c7e0155217ce2430f4a0a15557f010a07ea5dcdb9553cba6c955"},"schema_version":"1.0"},"canonical_sha256":"8e02959c9f05ec18e921fcae9e1361074eb5576933b2e72f9945ec00cb2bf83d","source":{"kind":"arxiv","id":"1907.01240","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01240","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01240v2","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01240","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"RYBJLHE7AXWB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYBJLHE7AXWBR2JB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYBJLHE7","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RYBJLHE7AXWBR2JB7SXJ4E3BA5","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01240","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-07-02T08:52:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"46b17502c503444881f6f78d8bcf7b5da6832628bc3a6cb4bf37635b0aa0b335","abstract_canon_sha256":"ea791d83c406c7e0155217ce2430f4a0a15557f010a07ea5dcdb9553cba6c955"},"schema_version":"1.0"},"canonical_sha256":"8e02959c9f05ec18e921fcae9e1361074eb5576933b2e72f9945ec00cb2bf83d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:17.006973Z","signature_b64":"C602bMAM+m6tWwf4nGVhXxVuS/N1MTCV7cAegpBK9/KhoRGbaLxgL3K6u0KcPSI0gqUOMAiLiIqdX9GwKlRaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e02959c9f05ec18e921fcae9e1361074eb5576933b2e72f9945ec00cb2bf83d","last_reissued_at":"2026-05-17T23:41:17.006362Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:17.006362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01240","source_version":2,"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-17T23:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vb4B0GZ3OL1TOo0hEqazTiEzgk++x+IPytaTJyc/vIOVkqHJvzUH++S5wa67Bnrp3/Ju9uioZyoAzG2R2K2BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:20:19.774912Z"},"content_sha256":"e0bf856b1c159cfd51a3efcf58af5aa3715cef81f60995442934adb622b99458","schema_version":"1.0","event_id":"sha256:e0bf856b1c159cfd51a3efcf58af5aa3715cef81f60995442934adb622b99458"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RYBJLHE7AXWBR2JB7SXJ4E3BA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Timed Basic Parallel Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Lorenzo Clemente, Patrick Totzke, Piotr Hofman","submitted_at":"2019-07-02T08:52:36Z","abstract_excerpt":"Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extension of timed automata (TA) with context-free branching rules, and as such may be used to model networks of independent timed automata with process creation.\n  We show that the coverability and reachability problems (with unary encoded target multiplicities) are PSPACE-complete and EXPTIME-complete, respectively. For the special case of 1-clock TBPP, both are NP-complete and hence not more complex than for untimed BPP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01240","kind":"arxiv","version":2},"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-17T23:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/cUcH5hs5crJ8ixnKAK0kr0IrKK0ptntNij5KxrFbuf04y/b8oOTPLqEH6IWXFhNhehKwOfgh867i1eHjPDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:20:19.775261Z"},"content_sha256":"4d179a342a056b51d6e3ebc45557ea9b7c43f866c35000eee775c5430d80ee6a","schema_version":"1.0","event_id":"sha256:4d179a342a056b51d6e3ebc45557ea9b7c43f866c35000eee775c5430d80ee6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/bundle.json","state_url":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/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-05-30T09:20:19Z","links":{"resolver":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5","bundle":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/bundle.json","state":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RYBJLHE7AXWBR2JB7SXJ4E3BA5","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":"ea791d83c406c7e0155217ce2430f4a0a15557f010a07ea5dcdb9553cba6c955","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-07-02T08:52:36Z","title_canon_sha256":"46b17502c503444881f6f78d8bcf7b5da6832628bc3a6cb4bf37635b0aa0b335"},"schema_version":"1.0","source":{"id":"1907.01240","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01240","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01240v2","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01240","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"RYBJLHE7AXWB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYBJLHE7AXWBR2JB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYBJLHE7","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:4d179a342a056b51d6e3ebc45557ea9b7c43f866c35000eee775c5430d80ee6a","target":"graph","created_at":"2026-05-17T23:41:17Z","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 basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extension of timed automata (TA) with context-free branching rules, and as such may be used to model networks of independent timed automata with process creation.\n  We show that the coverability and reachability problems (with unary encoded target multiplicities) are PSPACE-complete and EXPTIME-complete, respectively. For the special case of 1-clock TBPP, both are NP-complete and hence not more complex than for untimed BPP","authors_text":"Lorenzo Clemente, Patrick Totzke, Piotr Hofman","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-07-02T08:52:36Z","title":"Timed Basic Parallel Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01240","kind":"arxiv","version":2},"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:e0bf856b1c159cfd51a3efcf58af5aa3715cef81f60995442934adb622b99458","target":"record","created_at":"2026-05-17T23:41:17Z","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":"ea791d83c406c7e0155217ce2430f4a0a15557f010a07ea5dcdb9553cba6c955","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-07-02T08:52:36Z","title_canon_sha256":"46b17502c503444881f6f78d8bcf7b5da6832628bc3a6cb4bf37635b0aa0b335"},"schema_version":"1.0","source":{"id":"1907.01240","kind":"arxiv","version":2}},"canonical_sha256":"8e02959c9f05ec18e921fcae9e1361074eb5576933b2e72f9945ec00cb2bf83d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e02959c9f05ec18e921fcae9e1361074eb5576933b2e72f9945ec00cb2bf83d","first_computed_at":"2026-05-17T23:41:17.006362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:17.006362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C602bMAM+m6tWwf4nGVhXxVuS/N1MTCV7cAegpBK9/KhoRGbaLxgL3K6u0KcPSI0gqUOMAiLiIqdX9GwKlRaBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:17.006973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01240","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0bf856b1c159cfd51a3efcf58af5aa3715cef81f60995442934adb622b99458","sha256:4d179a342a056b51d6e3ebc45557ea9b7c43f866c35000eee775c5430d80ee6a"],"state_sha256":"3dba7731cbf10559ad6b6d355a5ab7fa2d6ba2d349144497fd3ea0a15d8bf703"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoSOHSzOT+rZWz0vvNXjnOoUE2H5MszdzLquQLsigS7Xm80K0kXmmhKRhbYt2kxpVfpdFMt0LHBq5MGfb3W8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:20:19.777287Z","bundle_sha256":"7acecfb524f7b24b342cfadd45001e12e9bcda2c2ef69ee071da9373ecc23354"}}