{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:E637YGIJNUEAOJDEEIQYJ56O3N","short_pith_number":"pith:E637YGIJ","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"},"canonical_sha256":"27b7fc19096d08072464222184f7cedb42ab0304c397629cf322f7ac8c0fb5a4","source":{"kind":"arxiv","id":"2203.04422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.04422","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2203.04422v1","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04422","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"E637YGIJNUEA","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"E637YGIJNUEAOJDE","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"E637YGIJ","created_at":"2026-07-05T04:03:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:E637YGIJNUEAOJDEEIQYJ56O3N","target":"record","payload":{"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"},"canonical_sha256":"27b7fc19096d08072464222184f7cedb42ab0304c397629cf322f7ac8c0fb5a4","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"},"source_kind":"arxiv","source_id":"2203.04422","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-07-05T04:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1s8FjeF3aiYbtGrHM4zMD4b7Ajj/XFT+cT8LbwHf8iPjQZjkRYz+DcKb3lq+S/89wmU7H65wr0jsJtK5IwJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:58:16.897295Z"},"content_sha256":"434ef09cf31be22057a7a94c4c22029dcd2f1dc0c3005f0133d8a615fc5ca0d6","schema_version":"1.0","event_id":"sha256:434ef09cf31be22057a7a94c4c22029dcd2f1dc0c3005f0133d8a615fc5ca0d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:E637YGIJNUEAOJDEEIQYJ56O3N","target":"graph","payload":{"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"},"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-07-05T04:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlDZjZlYrq+/d0Xh/VHbEHmcmRt5hKN7quzZmi1SWt/qgN16YjipZM2ALRzdVtjXMYNl+IATW+YnQxowzygAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:58:16.898084Z"},"content_sha256":"3e3db7fcc87219118bfa0c05a05045fb6bbc84fca26ecef640567bef28ccd153","schema_version":"1.0","event_id":"sha256:3e3db7fcc87219118bfa0c05a05045fb6bbc84fca26ecef640567bef28ccd153"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/bundle.json","state_url":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E637YGIJNUEAOJDEEIQYJ56O3N/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-08-06T05:58:16Z","links":{"resolver":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N","bundle":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/bundle.json","state":"https://pith.science/pith/E637YGIJNUEAOJDEEIQYJ56O3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E637YGIJNUEAOJDEEIQYJ56O3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:E637YGIJNUEAOJDEEIQYJ56O3N","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":"b38f98f444b968083464690150a57b1cb5937739d0b6211582db7d0f0ce5f68e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-03-08T21:56:31Z","title_canon_sha256":"7bd6abd8697089c5a21d88afd35d51f6a393ae67337582fbef4024fecd9f0bf4"},"schema_version":"1.0","source":{"id":"2203.04422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.04422","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2203.04422v1","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04422","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"E637YGIJNUEA","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"E637YGIJNUEAOJDE","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"E637YGIJ","created_at":"2026-07-05T04:03:18Z"}],"graph_snapshots":[{"event_id":"sha256:3e3db7fcc87219118bfa0c05a05045fb6bbc84fca26ecef640567bef28ccd153","target":"graph","created_at":"2026-07-05T04:03:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.04422/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fei He, Guanyan Li, Zhilei Han","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-03-08T21:56:31Z","title":"ProbTA: A sound and complete proof rule for probabilistic verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04422","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:434ef09cf31be22057a7a94c4c22029dcd2f1dc0c3005f0133d8a615fc5ca0d6","target":"record","created_at":"2026-07-05T04:03:18Z","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":"b38f98f444b968083464690150a57b1cb5937739d0b6211582db7d0f0ce5f68e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-03-08T21:56:31Z","title_canon_sha256":"7bd6abd8697089c5a21d88afd35d51f6a393ae67337582fbef4024fecd9f0bf4"},"schema_version":"1.0","source":{"id":"2203.04422","kind":"arxiv","version":1}},"canonical_sha256":"27b7fc19096d08072464222184f7cedb42ab0304c397629cf322f7ac8c0fb5a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27b7fc19096d08072464222184f7cedb42ab0304c397629cf322f7ac8c0fb5a4","first_computed_at":"2026-07-05T04:03:18.197092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:03:18.197092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1EmUzGTKsuqWGfPfWfB62LJq3yPFOEwGuhC+hpOlGyHp0I6MeGxnoih/NIM2FwWZ7Ax9hZTGZDcshzqLqWI3Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:03:18.197457Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.04422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:434ef09cf31be22057a7a94c4c22029dcd2f1dc0c3005f0133d8a615fc5ca0d6","sha256:3e3db7fcc87219118bfa0c05a05045fb6bbc84fca26ecef640567bef28ccd153"],"state_sha256":"3b80ae6609ec90f87cfb633cfb1aefae6c2a149154b8cfedda916a1e7cb20325"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wL6+2es2Ex3xfKWqmtXC80qPUkSaICTHv2S6EatvctLPYmRQPLlwcBsD1y7l8pvmAwM2wtcZ+9j+q7Gkp0XAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T05:58:16.902741Z","bundle_sha256":"d1eaacbde2e664245399a5704d55e089450450a49b449ab9b0241929b35bc5f7"}}