{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WH4HYJ35YFIH3D3AB36WAM7A5T","short_pith_number":"pith:WH4HYJ35","schema_version":"1.0","canonical_sha256":"b1f87c277dc1507d8f600efd6033e0eccef2052a5c5d6c117ad3b4103f90fd05","source":{"kind":"arxiv","id":"2311.06889","version":2},"attestation_state":"computed","paper":{"title":"Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Joost-Pieter Katoen, Kevin Batz, Tobias Winkler, Tom Jannik Biskup","submitted_at":"2023-11-12T16:26:34Z","abstract_excerpt":"We consider imperative programs that involve both randomization and pure nondeterminism. The central question is how to find a strategy resolving the pure nondeterminism such that the so-obtained determinized program satisfies a given quantitative specification, i.e., bounds on expected outcomes such as the expected final value of a program variable or the probability to terminate in a given set of states. We show how memoryless and deterministic (MD) strategies can be obtained in a semi-automatic fashion using deductive verification techniques. For loop-free programs, the MD strategies result"},"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":"2311.06889","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-11-12T16:26:34Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"fd3e14db45a3640d849855f9fece609b4305fe83fc6d97c0c9beed4c2d170a28","abstract_canon_sha256":"900a8ff201868c581c42a43db41956a67cda09ee604e873d74abe800cb0507ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:38.494349Z","signature_b64":"Xplz564V0Bg2AJK4eF+Gd7/94JFB9/XTO5O3cnOLmSGwwx9NhX6y0gRf9bdp5byzQtpEourDiD+A4XDC94SrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1f87c277dc1507d8f600efd6033e0eccef2052a5c5d6c117ad3b4103f90fd05","last_reissued_at":"2026-07-05T07:12:38.493997Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:38.493997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Joost-Pieter Katoen, Kevin Batz, Tobias Winkler, Tom Jannik Biskup","submitted_at":"2023-11-12T16:26:34Z","abstract_excerpt":"We consider imperative programs that involve both randomization and pure nondeterminism. The central question is how to find a strategy resolving the pure nondeterminism such that the so-obtained determinized program satisfies a given quantitative specification, i.e., bounds on expected outcomes such as the expected final value of a program variable or the probability to terminate in a given set of states. We show how memoryless and deterministic (MD) strategies can be obtained in a semi-automatic fashion using deductive verification techniques. For loop-free programs, the MD strategies result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06889","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.06889/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.06889","created_at":"2026-07-05T07:12:38.494058+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.06889v2","created_at":"2026-07-05T07:12:38.494058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06889","created_at":"2026-07-05T07:12:38.494058+00:00"},{"alias_kind":"pith_short_12","alias_value":"WH4HYJ35YFIH","created_at":"2026-07-05T07:12:38.494058+00:00"},{"alias_kind":"pith_short_16","alias_value":"WH4HYJ35YFIH3D3A","created_at":"2026-07-05T07:12:38.494058+00:00"},{"alias_kind":"pith_short_8","alias_value":"WH4HYJ35","created_at":"2026-07-05T07:12:38.494058+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T","json":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T.json","graph_json":"https://pith.science/api/pith-number/WH4HYJ35YFIH3D3AB36WAM7A5T/graph.json","events_json":"https://pith.science/api/pith-number/WH4HYJ35YFIH3D3AB36WAM7A5T/events.json","paper":"https://pith.science/paper/WH4HYJ35"},"agent_actions":{"view_html":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T","download_json":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T.json","view_paper":"https://pith.science/paper/WH4HYJ35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.06889&json=true","fetch_graph":"https://pith.science/api/pith-number/WH4HYJ35YFIH3D3AB36WAM7A5T/graph.json","fetch_events":"https://pith.science/api/pith-number/WH4HYJ35YFIH3D3AB36WAM7A5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T/action/storage_attestation","attest_author":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T/action/author_attestation","sign_citation":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T/action/citation_signature","submit_replication":"https://pith.science/pith/WH4HYJ35YFIH3D3AB36WAM7A5T/action/replication_record"}},"created_at":"2026-07-05T07:12:38.494058+00:00","updated_at":"2026-07-05T07:12:38.494058+00:00"}