{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BUMU653RGC7HXZPYPLBAIWAFGD","short_pith_number":"pith:BUMU653R","schema_version":"1.0","canonical_sha256":"0d194f777130be7be5f87ac204580530ef8539cd02cfe930c0b9d34b8095e1fc","source":{"kind":"arxiv","id":"1306.2697","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Concurrent Kleene Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Annabelle McIver (Macquarie University), Georg Struth (University of Sheffield), Tahiry Rabehaja (Macquarie University, University of Sheffield)","submitted_at":"2013-06-12T01:56:01Z","abstract_excerpt":"We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use the resulting algebra to generalise the algebraic formulation of a variant of Jones' rely/guarantee calculus."},"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":"1306.2697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-12T01:56:01Z","cross_cats_sorted":[],"title_canon_sha256":"19bce97a2ff2cbabb56cfdc242d400d0cffdcabb6497bf1c39f5ce856ce6d771","abstract_canon_sha256":"9159dd7378f18dad43b74ae42e4e3df5a197bf65196e8ded4ef512e5bd662d85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:09.683237Z","signature_b64":"orru0SrwXVVZXypQnkra2aF86rTk8paJQTSFRqpIRmJKW5FfO9rD2yAEdjSmj+t4asfIEGDXbW7GXzB51M84Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d194f777130be7be5f87ac204580530ef8539cd02cfe930c0b9d34b8095e1fc","last_reissued_at":"2026-05-18T03:21:09.682519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:09.682519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Concurrent Kleene Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Annabelle McIver (Macquarie University), Georg Struth (University of Sheffield), Tahiry Rabehaja (Macquarie University, University of Sheffield)","submitted_at":"2013-06-12T01:56:01Z","abstract_excerpt":"We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use the resulting algebra to generalise the algebraic formulation of a variant of Jones' rely/guarantee calculus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2697","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":"1306.2697","created_at":"2026-05-18T03:21:09.682629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2697v1","created_at":"2026-05-18T03:21:09.682629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2697","created_at":"2026-05-18T03:21:09.682629+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUMU653RGC7H","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUMU653RGC7HXZPY","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUMU653R","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2409.02595","citing_title":"Computation and Concurrency","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07373","citing_title":"Finitary Truly Concurrent Bisimulations","ref_index":93,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD","json":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD.json","graph_json":"https://pith.science/api/pith-number/BUMU653RGC7HXZPYPLBAIWAFGD/graph.json","events_json":"https://pith.science/api/pith-number/BUMU653RGC7HXZPYPLBAIWAFGD/events.json","paper":"https://pith.science/paper/BUMU653R"},"agent_actions":{"view_html":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD","download_json":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD.json","view_paper":"https://pith.science/paper/BUMU653R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2697&json=true","fetch_graph":"https://pith.science/api/pith-number/BUMU653RGC7HXZPYPLBAIWAFGD/graph.json","fetch_events":"https://pith.science/api/pith-number/BUMU653RGC7HXZPYPLBAIWAFGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD/action/storage_attestation","attest_author":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD/action/author_attestation","sign_citation":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD/action/citation_signature","submit_replication":"https://pith.science/pith/BUMU653RGC7HXZPYPLBAIWAFGD/action/replication_record"}},"created_at":"2026-05-18T03:21:09.682629+00:00","updated_at":"2026-05-18T03:21:09.682629+00:00"}