{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:25R2LUVJKRHECEKEP6NMCVL55L","short_pith_number":"pith:25R2LUVJ","schema_version":"1.0","canonical_sha256":"d763a5d2a9544e4111447f9ac1557deae7a1025e5bcb3c52ec341fbb9e8d8e08","source":{"kind":"arxiv","id":"2508.12344","version":1},"attestation_state":"computed","paper":{"title":"Structural Abstraction and Refinement for Probabilistic Programs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Fei He, Guanyan Li, Hongfei Fu, Juanen Li, Peixin Wang, Zhilei Han","submitted_at":"2025-08-17T12:23:34Z","abstract_excerpt":"In this paper, we present structural abstraction refinement, a novel framework for verifying the threshold problem of probabilistic programs. Our approach represents the structure of a Probabilistic Control-Flow Automaton (PCFA) as a Markov Decision Process (MDP) by abstracting away statement semantics. The maximum reachability of the MDP naturally provides a proper upper bound of the violation probability, termed the structural upper bound. This introduces a fresh ``structural'' characterization of the relationship between PCFA and MDP, contrasting with the traditional ``semantical'' view, wh"},"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":"2508.12344","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.FL","submitted_at":"2025-08-17T12:23:34Z","cross_cats_sorted":[],"title_canon_sha256":"1b250260b5bf44dc1136b1ce45bb9c4915c4d1d1e7f7e607e9e69fa1508c34a3","abstract_canon_sha256":"b4ed0770e28510dca49740302c42979a7f6c7b7c4e1ed6d671ffbc149704ae54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:03.936606Z","signature_b64":"bdRN/o5xzMt3xcLMQYeL6BDdwl/GlrEQKCVCmxPRDqnGw2WP97b+K0bjgktA8hQ73/cHjWQWcDDmOJX99zUCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d763a5d2a9544e4111447f9ac1557deae7a1025e5bcb3c52ec341fbb9e8d8e08","last_reissued_at":"2026-07-05T11:55:03.936118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:03.936118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural Abstraction and Refinement for Probabilistic Programs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Fei He, Guanyan Li, Hongfei Fu, Juanen Li, Peixin Wang, Zhilei Han","submitted_at":"2025-08-17T12:23:34Z","abstract_excerpt":"In this paper, we present structural abstraction refinement, a novel framework for verifying the threshold problem of probabilistic programs. Our approach represents the structure of a Probabilistic Control-Flow Automaton (PCFA) as a Markov Decision Process (MDP) by abstracting away statement semantics. The maximum reachability of the MDP naturally provides a proper upper bound of the violation probability, termed the structural upper bound. This introduces a fresh ``structural'' characterization of the relationship between PCFA and MDP, contrasting with the traditional ``semantical'' view, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12344","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/2508.12344/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":"2508.12344","created_at":"2026-07-05T11:55:03.936176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.12344v1","created_at":"2026-07-05T11:55:03.936176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12344","created_at":"2026-07-05T11:55:03.936176+00:00"},{"alias_kind":"pith_short_12","alias_value":"25R2LUVJKRHE","created_at":"2026-07-05T11:55:03.936176+00:00"},{"alias_kind":"pith_short_16","alias_value":"25R2LUVJKRHECEKE","created_at":"2026-07-05T11:55:03.936176+00:00"},{"alias_kind":"pith_short_8","alias_value":"25R2LUVJ","created_at":"2026-07-05T11:55:03.936176+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":74,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L","json":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L.json","graph_json":"https://pith.science/api/pith-number/25R2LUVJKRHECEKEP6NMCVL55L/graph.json","events_json":"https://pith.science/api/pith-number/25R2LUVJKRHECEKEP6NMCVL55L/events.json","paper":"https://pith.science/paper/25R2LUVJ"},"agent_actions":{"view_html":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L","download_json":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L.json","view_paper":"https://pith.science/paper/25R2LUVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.12344&json=true","fetch_graph":"https://pith.science/api/pith-number/25R2LUVJKRHECEKEP6NMCVL55L/graph.json","fetch_events":"https://pith.science/api/pith-number/25R2LUVJKRHECEKEP6NMCVL55L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L/action/storage_attestation","attest_author":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L/action/author_attestation","sign_citation":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L/action/citation_signature","submit_replication":"https://pith.science/pith/25R2LUVJKRHECEKEP6NMCVL55L/action/replication_record"}},"created_at":"2026-07-05T11:55:03.936176+00:00","updated_at":"2026-07-05T11:55:03.936176+00:00"}