{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:E637YGIJNUEAOJDEEIQYJ56O3N","short_pith_number":"pith:E637YGIJ","schema_version":"1.0","canonical_sha256":"27b7fc19096d08072464222184f7cedb42ab0304c397629cf322f7ac8c0fb5a4","source":{"kind":"arxiv","id":"2203.04422","version":1},"attestation_state":"computed","paper":{"title":"ProbTA: A sound and complete proof rule for probabilistic verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Fei He, Guanyan Li, Zhilei Han","submitted_at":"2022-03-08T21:56:31Z","abstract_excerpt":"We propose a sound and complete proof rule ProbTA for quantitative analysis of violation probability of probabilistic programs. Our approach extends the technique of trace abstraction with probability in the control-flow randomness style, in contrast to previous work of combining trace abstraction and probabilisitic verification which adopts the data randomness style. In our method, a program specification is proved or disproved by decomposing the program into different modules of traces. Precise quantitative analysis is enabled by novel models proposed to bridge program verification and proba"},"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":"2203.04422","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-03-08T21:56:31Z","cross_cats_sorted":[],"title_canon_sha256":"7bd6abd8697089c5a21d88afd35d51f6a393ae67337582fbef4024fecd9f0bf4","abstract_canon_sha256":"b38f98f444b968083464690150a57b1cb5937739d0b6211582db7d0f0ce5f68e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:18.197457Z","signature_b64":"1EmUzGTKsuqWGfPfWfB62LJq3yPFOEwGuhC+hpOlGyHp0I6MeGxnoih/NIM2FwWZ7Ax9hZTGZDcshzqLqWI3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27b7fc19096d08072464222184f7cedb42ab0304c397629cf322f7ac8c0fb5a4","last_reissued_at":"2026-07-05T04:03:18.197092Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:18.197092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ProbTA: A sound and complete proof rule for probabilistic verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Fei He, Guanyan Li, Zhilei Han","submitted_at":"2022-03-08T21:56:31Z","abstract_excerpt":"We propose a sound and complete proof rule ProbTA for quantitative analysis of violation probability of probabilistic programs. Our approach extends the technique of trace abstraction with probability in the control-flow randomness style, in contrast to previous work of combining trace abstraction and probabilisitic verification which adopts the data randomness style. In our method, a program specification is proved or disproved by decomposing the program into different modules of traces. Precise quantitative analysis is enabled by novel models proposed to bridge program verification and proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04422","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.04422/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":"2203.04422","created_at":"2026-07-05T04:03:18.197157+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.04422v1","created_at":"2026-07-05T04:03:18.197157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04422","created_at":"2026-07-05T04:03:18.197157+00:00"},{"alias_kind":"pith_short_12","alias_value":"E637YGIJNUEA","created_at":"2026-07-05T04:03:18.197157+00:00"},{"alias_kind":"pith_short_16","alias_value":"E637YGIJNUEAOJDE","created_at":"2026-07-05T04:03:18.197157+00:00"},{"alias_kind":"pith_short_8","alias_value":"E637YGIJ","created_at":"2026-07-05T04:03:18.197157+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.15043","citing_title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","ref_index":73,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N","json":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N.json","graph_json":"https://pith.science/api/pith-number/E637YGIJNUEAOJDEEIQYJ56O3N/graph.json","events_json":"https://pith.science/api/pith-number/E637YGIJNUEAOJDEEIQYJ56O3N/events.json","paper":"https://pith.science/paper/E637YGIJ"},"agent_actions":{"view_html":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N","download_json":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N.json","view_paper":"https://pith.science/paper/E637YGIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.04422&json=true","fetch_graph":"https://pith.science/api/pith-number/E637YGIJNUEAOJDEEIQYJ56O3N/graph.json","fetch_events":"https://pith.science/api/pith-number/E637YGIJNUEAOJDEEIQYJ56O3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/action/storage_attestation","attest_author":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/action/author_attestation","sign_citation":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/action/citation_signature","submit_replication":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/action/replication_record"}},"created_at":"2026-07-05T04:03:18.197157+00:00","updated_at":"2026-07-05T04:03:18.197157+00:00"}