{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LOHM5TKWLY2CGRO3YSFSZYKJME","short_pith_number":"pith:LOHM5TKW","canonical_record":{"source":{"id":"2301.08657","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-01-20T16:06:57Z","cross_cats_sorted":[],"title_canon_sha256":"7cd7eea9374f8d0eee3dff52148304ebf31208e3c2eccbb9e129b6bbd10b85e0","abstract_canon_sha256":"1559a17a02888bda2acbd7ea700196dfd4cacb236e91ec2ad1b7025e67e2e552"},"schema_version":"1.0"},"canonical_sha256":"5b8ececd565e342345dbc48b2ce149612ba4e41f8fa7b678e04aa53fdb79c0d5","source":{"kind":"arxiv","id":"2301.08657","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08657","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08657v2","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08657","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"LOHM5TKWLY2C","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOHM5TKWLY2CGRO3","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOHM5TKW","created_at":"2026-07-05T05:45:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LOHM5TKWLY2CGRO3YSFSZYKJME","target":"record","payload":{"canonical_record":{"source":{"id":"2301.08657","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-01-20T16:06:57Z","cross_cats_sorted":[],"title_canon_sha256":"7cd7eea9374f8d0eee3dff52148304ebf31208e3c2eccbb9e129b6bbd10b85e0","abstract_canon_sha256":"1559a17a02888bda2acbd7ea700196dfd4cacb236e91ec2ad1b7025e67e2e552"},"schema_version":"1.0"},"canonical_sha256":"5b8ececd565e342345dbc48b2ce149612ba4e41f8fa7b678e04aa53fdb79c0d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:37.445519Z","signature_b64":"6csS3YFINBDoSRMXDnFhdy+8yPgDG+p5LjGQ3fpVMrgMa/Aww0zUriD6UZvztFhJsBPbo9h7R5jPPOLkBsYGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b8ececd565e342345dbc48b2ce149612ba4e41f8fa7b678e04aa53fdb79c0d5","last_reissued_at":"2026-07-05T05:45:37.445030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:37.445030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.08657","source_version":2,"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-05T05:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6F8O9AVzvoOsxmOTZVULo0JMEr81i81rx4LbMXRrjmtgPtnpAk4oGy/Lq1WfQtO/jyTs2kTvG8Mm+CntVobCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:52:02.660746Z"},"content_sha256":"24e6ee6615c35c455b2b7e3eddafe883e1159b5a1b721d6449e45be6f5b3c2db","schema_version":"1.0","event_id":"sha256:24e6ee6615c35c455b2b7e3eddafe883e1159b5a1b721d6449e45be6f5b3c2db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LOHM5TKWLY2CGRO3YSFSZYKJME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Joost-Pieter Katoen, Tobias Winkler","submitted_at":"2023-01-20T16:06:57Z","abstract_excerpt":"Probabilistic pushdown automata (pPDA) are a standard model for discrete probabilistic programs with procedures and recursion. In pPDA, many quantitative properties are characterized as least fixpoints of polynomial equation systems. In this paper, we study the problem of certifying that these quantities lie within certain bounds. To this end, we first characterize the polynomial systems that admit easy-to-check certificates for validating bounds on their least fixpoint. Second, we present a sound and complete Optimistic Value Iteration algorithm for computing such certificates. Third, we show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08657","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/2301.08657/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-05T05:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YG2rPBoOTSkT69skAKholi0EVXrCmy9RxNxEHgM4jwkPgjUhEMfoXPTIU/VVQolkaWgydeIG3kjS4AoOHh2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:52:02.661085Z"},"content_sha256":"03ca2825e43d8c53a0df1f11824391da21d552cfcba78aaf070908714d123072","schema_version":"1.0","event_id":"sha256:03ca2825e43d8c53a0df1f11824391da21d552cfcba78aaf070908714d123072"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOHM5TKWLY2CGRO3YSFSZYKJME/bundle.json","state_url":"https://pith.science/pith/LOHM5TKWLY2CGRO3YSFSZYKJME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOHM5TKWLY2CGRO3YSFSZYKJME/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-18T16:52:02Z","links":{"resolver":"https://pith.science/pith/LOHM5TKWLY2CGRO3YSFSZYKJME","bundle":"https://pith.science/pith/LOHM5TKWLY2CGRO3YSFSZYKJME/bundle.json","state":"https://pith.science/pith/LOHM5TKWLY2CGRO3YSFSZYKJME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOHM5TKWLY2CGRO3YSFSZYKJME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LOHM5TKWLY2CGRO3YSFSZYKJME","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":"1559a17a02888bda2acbd7ea700196dfd4cacb236e91ec2ad1b7025e67e2e552","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-01-20T16:06:57Z","title_canon_sha256":"7cd7eea9374f8d0eee3dff52148304ebf31208e3c2eccbb9e129b6bbd10b85e0"},"schema_version":"1.0","source":{"id":"2301.08657","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08657","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08657v2","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08657","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"LOHM5TKWLY2C","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOHM5TKWLY2CGRO3","created_at":"2026-07-05T05:45:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOHM5TKW","created_at":"2026-07-05T05:45:37Z"}],"graph_snapshots":[{"event_id":"sha256:03ca2825e43d8c53a0df1f11824391da21d552cfcba78aaf070908714d123072","target":"graph","created_at":"2026-07-05T05:45:37Z","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/2301.08657/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Probabilistic pushdown automata (pPDA) are a standard model for discrete probabilistic programs with procedures and recursion. In pPDA, many quantitative properties are characterized as least fixpoints of polynomial equation systems. In this paper, we study the problem of certifying that these quantities lie within certain bounds. To this end, we first characterize the polynomial systems that admit easy-to-check certificates for validating bounds on their least fixpoint. Second, we present a sound and complete Optimistic Value Iteration algorithm for computing such certificates. Third, we show","authors_text":"Joost-Pieter Katoen, Tobias Winkler","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-01-20T16:06:57Z","title":"Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08657","kind":"arxiv","version":2},"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:24e6ee6615c35c455b2b7e3eddafe883e1159b5a1b721d6449e45be6f5b3c2db","target":"record","created_at":"2026-07-05T05:45:37Z","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":"1559a17a02888bda2acbd7ea700196dfd4cacb236e91ec2ad1b7025e67e2e552","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-01-20T16:06:57Z","title_canon_sha256":"7cd7eea9374f8d0eee3dff52148304ebf31208e3c2eccbb9e129b6bbd10b85e0"},"schema_version":"1.0","source":{"id":"2301.08657","kind":"arxiv","version":2}},"canonical_sha256":"5b8ececd565e342345dbc48b2ce149612ba4e41f8fa7b678e04aa53fdb79c0d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b8ececd565e342345dbc48b2ce149612ba4e41f8fa7b678e04aa53fdb79c0d5","first_computed_at":"2026-07-05T05:45:37.445030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:37.445030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6csS3YFINBDoSRMXDnFhdy+8yPgDG+p5LjGQ3fpVMrgMa/Aww0zUriD6UZvztFhJsBPbo9h7R5jPPOLkBsYGDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:37.445519Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.08657","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24e6ee6615c35c455b2b7e3eddafe883e1159b5a1b721d6449e45be6f5b3c2db","sha256:03ca2825e43d8c53a0df1f11824391da21d552cfcba78aaf070908714d123072"],"state_sha256":"b8f6ae2fb58ab98eda944e27fa86b628c9acc3b1dfdfda2ca17844b557e68f07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BrYkBhrFX9qgnk+Wj8wOHuCaHzaEUjksDRy/QyCvOvEsvLsXBp1DTak6RmTZLLKkj3Ad8+FhDXAssKk9Oo2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T16:52:02.664876Z","bundle_sha256":"99360a6df751417e8588e26e008b9ca2f9781c83ddfbff000b6ac13a5c6c4b6f"}}