{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FK5TNGKZKXMT7G4N7AC5TSVRIO","short_pith_number":"pith:FK5TNGKZ","schema_version":"1.0","canonical_sha256":"2abb36995955d93f9b8df805d9cab143a74d42a3d37bbf917d0d864b89beeb20","source":{"kind":"arxiv","id":"2605.18362","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic imperative process algebra","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"An extension adds probabilistic choice operators to imperative process algebra, with probabilistic choices resolved before those in alternative and parallel composition.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"C. A. Middelburg","submitted_at":"2026-05-18T13:13:32Z","abstract_excerpt":"In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension of that process algebra with probabilistic choice operators is presented that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved. This extension can be useful, among other things, for specifying the patterns of behaviour expressed by algorithms that a"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.18362","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-18T13:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"06ea23539980e294376f527cd3719ce12d879dd5683ff48988c827d39b4cd03d","abstract_canon_sha256":"e1fc066befeae7de3b5e18a40328921bf05f360edd1bbedf04322485dc24e445"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:57.206016Z","signature_b64":"B3hx05fbnlmyQqeQpIJ+hsqgZhaXmHxYssVqDeBA3HYqwFg5DIH554g+sFG2E3V0hF18fBHcN/kdEOZmSXNzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2abb36995955d93f9b8df805d9cab143a74d42a3d37bbf917d0d864b89beeb20","last_reissued_at":"2026-05-20T00:05:57.203355Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:57.203355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic imperative process algebra","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"An extension adds probabilistic choice operators to imperative process algebra, with probabilistic choices resolved before those in alternative and parallel composition.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"C. A. Middelburg","submitted_at":"2026-05-18T13:13:32Z","abstract_excerpt":"In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension of that process algebra with probabilistic choice operators is presented that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved. This extension can be useful, among other things, for specifying the patterns of behaviour expressed by algorithms that a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"An extension of that process algebra with probabilistic choice operators is presented that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the proposed resolution ordering for probabilistic choices can be defined consistently within the existing imperative process algebra and yields a useful framework for specifying and verifying probabilistic algorithms in distributed computing.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Extends imperative process algebra with probabilistic choice operators resolved before alternative and parallel compositions to model distributed computing algorithms such as leader election and consensus.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An extension adds probabilistic choice operators to imperative process algebra, with probabilistic choices resolved before those in alternative and parallel composition.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8d967623f9cfd053a2d164dcec1cecec1c49c72e239f5194b663186b9f4728c8"},"source":{"id":"2605.18362","kind":"arxiv","version":1},"verdict":{"id":"bb7b8df5-b352-49ae-9e28-0f5a9307eeaa","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:32:21.333767Z","strongest_claim":"An extension of that process algebra with probabilistic choice operators is presented that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved.","one_line_summary":"Extends imperative process algebra with probabilistic choice operators resolved before alternative and parallel compositions to model distributed computing algorithms such as leader election and consensus.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the proposed resolution ordering for probabilistic choices can be defined consistently within the existing imperative process algebra and yields a useful framework for specifying and verifying probabilistic algorithms in distributed computing.","pith_extraction_headline":"An extension adds probabilistic choice operators to imperative process algebra, with probabilistic choices resolved before those in alternative and parallel composition."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18362/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.380969Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:40:55.606535Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:30.710242Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T23:31:51.757898Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.790541Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"76ecdb384199db141accbaf77266fc6c9677c8070b93f0e34fe3087f9ee355d6"},"references":{"count":25,"sample":[{"doi":"","year":2009,"title":"In: Nielsen, M., et al","work_id":"4002d8ec-10d8-46d0-845b-c6ad8301aa86","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"John Wiley and Sons, Hoboken, NJ, second edn","work_id":"8a98cfd7-ea30-4cbe-a6eb-1d3e85a055fe","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1988,"title":"Information and Control78(3), 205–245 (1988)","work_id":"4c942072-8ad4-460a-afe1-33291cb009a6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1992,"title":"Baeten, J.C.M., Bergstra, J.A.: Process algebra with signals and conditions. In: Broy, M. (ed.) Programming and Mathematical Methods. NATO ASI Series, vol. F88, pp. 273–323. Springer-Verlag (1992)","work_id":"f15b3568-5c38-40bb-869d-770544e2b98e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1990,"title":"Baeten, J.C.M., Weijland, W.P.: Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge (1990)","work_id":"62303db3-2e62-4d8e-ba0d-4a4515d57a2b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"b71d6a8546bf7c5d24d78470ec4518c29fb99b95a2b0c1163685900fa9d95a06","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d9948a476749eb5a6321add53ebfc37302d05d274bbbbd4b72d4400c1cd95513"},"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":"2605.18362","created_at":"2026-05-20T00:05:57.205340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18362v1","created_at":"2026-05-20T00:05:57.205340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18362","created_at":"2026-05-20T00:05:57.205340+00:00"},{"alias_kind":"pith_short_12","alias_value":"FK5TNGKZKXMT","created_at":"2026-05-20T00:05:57.205340+00:00"},{"alias_kind":"pith_short_16","alias_value":"FK5TNGKZKXMT7G4N","created_at":"2026-05-20T00:05:57.205340+00:00"},{"alias_kind":"pith_short_8","alias_value":"FK5TNGKZ","created_at":"2026-05-20T00:05:57.205340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO","json":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO.json","graph_json":"https://pith.science/api/pith-number/FK5TNGKZKXMT7G4N7AC5TSVRIO/graph.json","events_json":"https://pith.science/api/pith-number/FK5TNGKZKXMT7G4N7AC5TSVRIO/events.json","paper":"https://pith.science/paper/FK5TNGKZ"},"agent_actions":{"view_html":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO","download_json":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO.json","view_paper":"https://pith.science/paper/FK5TNGKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18362&json=true","fetch_graph":"https://pith.science/api/pith-number/FK5TNGKZKXMT7G4N7AC5TSVRIO/graph.json","fetch_events":"https://pith.science/api/pith-number/FK5TNGKZKXMT7G4N7AC5TSVRIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO/action/storage_attestation","attest_author":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO/action/author_attestation","sign_citation":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO/action/citation_signature","submit_replication":"https://pith.science/pith/FK5TNGKZKXMT7G4N7AC5TSVRIO/action/replication_record"}},"created_at":"2026-05-20T00:05:57.205340+00:00","updated_at":"2026-05-20T00:05:57.205340+00:00"}