{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JMVRCRLWSVUBMWAP3ALWRRHM67","short_pith_number":"pith:JMVRCRLW","canonical_record":{"source":{"id":"1401.4130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T18:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"f97a1d0ffea537b95be8a9d31f55d99bfb7a751f99ca4650597b0734e03e53e4","abstract_canon_sha256":"14521b5353343fe83e6ed9be58004b9f228d98fd5e434f9f35ff166d7d8f326f"},"schema_version":"1.0"},"canonical_sha256":"4b2b114576956816580fd81768c4ecf7cc824e97fd62aa14efcad0cf35d1f197","source":{"kind":"arxiv","id":"1401.4130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4130","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4130v1","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4130","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"pith_short_12","alias_value":"JMVRCRLWSVUB","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JMVRCRLWSVUBMWAP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JMVRCRLW","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JMVRCRLWSVUBMWAP3ALWRRHM67","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T18:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"f97a1d0ffea537b95be8a9d31f55d99bfb7a751f99ca4650597b0734e03e53e4","abstract_canon_sha256":"14521b5353343fe83e6ed9be58004b9f228d98fd5e434f9f35ff166d7d8f326f"},"schema_version":"1.0"},"canonical_sha256":"4b2b114576956816580fd81768c4ecf7cc824e97fd62aa14efcad0cf35d1f197","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:57.120695Z","signature_b64":"I2Je0gIum0rx3AHf/8GrulUm0F5pHOXMCd866OW+fi44XQMXdzEra6HnauBlBypAw08kv6obzBjKbVUGL4CrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b2b114576956816580fd81768c4ecf7cc824e97fd62aa14efcad0cf35d1f197","last_reissued_at":"2026-05-18T03:01:57.119922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:57.119922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4130","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:01:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MO5hUxmPbEO2OoJPWHg2PoxqpAwQIdrYiOyNY3oujusWv3bsMf/N8M0ip1RAWE4jqTAx7AsWHRNYEK4RxUl0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:51:20.663706Z"},"content_sha256":"da429a3e06e49f7d028cb26b438f94cfaadd4dc5eecf52727d3a17501f8e1062","schema_version":"1.0","event_id":"sha256:da429a3e06e49f7d028cb26b438f94cfaadd4dc5eecf52727d3a17501f8e1062"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JMVRCRLWSVUBMWAP3ALWRRHM67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Probabilistic Basic Parallel Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anthony W. Lin, R\\'emi Bonnet, Stefan Kiefer","submitted_at":"2014-01-16T18:56:38Z","abstract_excerpt":"Basic Parallel Processes (BPPs) are a well-known subclass of Petri Nets. They are the simplest common model of concurrent programs that allows unbounded spawning of processes. In the probabilistic version of BPPs, every process generates other processes according to a probability distribution. We study the decidability and complexity of fundamental qualitative problems over probabilistic BPPs -- in particular reachability with probability 1 of different classes of target sets (e.g. upward-closed sets). Our results concern both the Markov-chain model, where processes are scheduled randomly, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4130","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:01:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCgGyVBtdLa+4u4owHwt2r1pcYL3rpKGeTDt8Ux7xiU9rWrdZ+DBLE96NKh1NzPjoomzDeFI3C//ODISxki2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:51:20.664058Z"},"content_sha256":"fc1336e23be9aae7b434b7521cab374a98d1e9d7893e14d0a8935f5b602751d4","schema_version":"1.0","event_id":"sha256:fc1336e23be9aae7b434b7521cab374a98d1e9d7893e14d0a8935f5b602751d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMVRCRLWSVUBMWAP3ALWRRHM67/bundle.json","state_url":"https://pith.science/pith/JMVRCRLWSVUBMWAP3ALWRRHM67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMVRCRLWSVUBMWAP3ALWRRHM67/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-24T11:51:20Z","links":{"resolver":"https://pith.science/pith/JMVRCRLWSVUBMWAP3ALWRRHM67","bundle":"https://pith.science/pith/JMVRCRLWSVUBMWAP3ALWRRHM67/bundle.json","state":"https://pith.science/pith/JMVRCRLWSVUBMWAP3ALWRRHM67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMVRCRLWSVUBMWAP3ALWRRHM67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JMVRCRLWSVUBMWAP3ALWRRHM67","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":"14521b5353343fe83e6ed9be58004b9f228d98fd5e434f9f35ff166d7d8f326f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T18:56:38Z","title_canon_sha256":"f97a1d0ffea537b95be8a9d31f55d99bfb7a751f99ca4650597b0734e03e53e4"},"schema_version":"1.0","source":{"id":"1401.4130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4130","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4130v1","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4130","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"pith_short_12","alias_value":"JMVRCRLWSVUB","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JMVRCRLWSVUBMWAP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JMVRCRLW","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:fc1336e23be9aae7b434b7521cab374a98d1e9d7893e14d0a8935f5b602751d4","target":"graph","created_at":"2026-05-18T03:01:57Z","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":"Basic Parallel Processes (BPPs) are a well-known subclass of Petri Nets. They are the simplest common model of concurrent programs that allows unbounded spawning of processes. In the probabilistic version of BPPs, every process generates other processes according to a probability distribution. We study the decidability and complexity of fundamental qualitative problems over probabilistic BPPs -- in particular reachability with probability 1 of different classes of target sets (e.g. upward-closed sets). Our results concern both the Markov-chain model, where processes are scheduled randomly, and","authors_text":"Anthony W. Lin, R\\'emi Bonnet, Stefan Kiefer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T18:56:38Z","title":"Analysis of Probabilistic Basic Parallel Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4130","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:da429a3e06e49f7d028cb26b438f94cfaadd4dc5eecf52727d3a17501f8e1062","target":"record","created_at":"2026-05-18T03:01:57Z","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":"14521b5353343fe83e6ed9be58004b9f228d98fd5e434f9f35ff166d7d8f326f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T18:56:38Z","title_canon_sha256":"f97a1d0ffea537b95be8a9d31f55d99bfb7a751f99ca4650597b0734e03e53e4"},"schema_version":"1.0","source":{"id":"1401.4130","kind":"arxiv","version":1}},"canonical_sha256":"4b2b114576956816580fd81768c4ecf7cc824e97fd62aa14efcad0cf35d1f197","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b2b114576956816580fd81768c4ecf7cc824e97fd62aa14efcad0cf35d1f197","first_computed_at":"2026-05-18T03:01:57.119922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:57.119922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I2Je0gIum0rx3AHf/8GrulUm0F5pHOXMCd866OW+fi44XQMXdzEra6HnauBlBypAw08kv6obzBjKbVUGL4CrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:57.120695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da429a3e06e49f7d028cb26b438f94cfaadd4dc5eecf52727d3a17501f8e1062","sha256:fc1336e23be9aae7b434b7521cab374a98d1e9d7893e14d0a8935f5b602751d4"],"state_sha256":"8e700818113a990510bf2cbc9e5c24096fb94ddf943ba442ad67995f93a89a26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASvdn6eJM4QJ5w58IOug4ZGaE0zQtKRQ0DsvLUx5b3UfESUu98Wb0W1NwBuQzMRKp0UxSVLwbMhAITOAEf6+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:51:20.666864Z","bundle_sha256":"0f794c6c09f42de861a2fbf335000e69ab8bc47e6293a131063f28f01fc97b50"}}