{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2LEGKCCZ3GYMZ3AVSPIDQIFJWP","short_pith_number":"pith:2LEGKCCZ","canonical_record":{"source":{"id":"1102.2529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-02-12T17:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"50cd270a2c1c48b5bd92edc8ca75bc09b10b81b3062bd5d4259dd3f7a8869949","abstract_canon_sha256":"7c475d2bc6e165feb7847f216daa4c7ea7ab9d4b023fa0e65ba03fac2b64b9d5"},"schema_version":"1.0"},"canonical_sha256":"d2c8650859d9b0ccec1593d03820a9b3c75f7a7f7e232e46b423b53ba2a3cf18","source":{"kind":"arxiv","id":"1102.2529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2529","created_at":"2026-05-18T04:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2529v1","created_at":"2026-05-18T04:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2529","created_at":"2026-05-18T04:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"2LEGKCCZ3GYM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2LEGKCCZ3GYMZ3AV","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2LEGKCCZ","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2LEGKCCZ3GYMZ3AVSPIDQIFJWP","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-02-12T17:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"50cd270a2c1c48b5bd92edc8ca75bc09b10b81b3062bd5d4259dd3f7a8869949","abstract_canon_sha256":"7c475d2bc6e165feb7847f216daa4c7ea7ab9d4b023fa0e65ba03fac2b64b9d5"},"schema_version":"1.0"},"canonical_sha256":"d2c8650859d9b0ccec1593d03820a9b3c75f7a7f7e232e46b423b53ba2a3cf18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:47.185433Z","signature_b64":"gXiPHNRbMbT92DwQrPtbvztioutkojN+SLiR0dNjJjPpLEDwMe6CJYEOU+ncewTtMS/7soJ312xwqlvyOKlHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c8650859d9b0ccec1593d03820a9b3c75f7a7f7e232e46b423b53ba2a3cf18","last_reissued_at":"2026-05-18T04:28:47.184875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:47.184875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2529","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-05-18T04:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xCZUi6KhPM0R/cxrpZjwy5NC7gN3HJNG6ffLTdrNYf+o2BMGscLIMq6wQtGeLTUCvl/ubzNYKfkijlLRo192AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T18:27:50.181703Z"},"content_sha256":"819e3781b3e09ed12e46d3d6d4d10384e3059b90e1adada21494372de8f320aa","schema_version":"1.0","event_id":"sha256:819e3781b3e09ed12e46d3d6d4d10384e3059b90e1adada21494372de8f320aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2LEGKCCZ3GYMZ3AVSPIDQIFJWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Analysis of Probabilistic Programs with an Unbounded Counter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Antonin Kucera, Stefan Kiefer, Tomas Brazdil","submitted_at":"2011-02-12T17:01:56Z","abstract_excerpt":"We show that a subclass of infinite-state probabilistic programs that can be modeled by probabilistic one-counter automata (pOC) admits an efficient quantitative analysis. In particular, we show that the expected termination time can be approximated up to an arbitrarily small relative error with polynomially many arithmetic operations, and the same holds for the probability of all runs that satisfy a given omega-regular property. Further, our results establish a powerful link between pOC and martingale theory, which leads to fundamental observations about quantitative properties of runs in pOC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2529","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":""},"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-05-18T04:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irLWJBQ88M/uFqinW8ualj75mVs6kzUBbgubBG6YStfoZa3cD6sf4zCFHhtegUrbbtRv2rkt3bSa7szSojewAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T18:27:50.182358Z"},"content_sha256":"5f91705b063bc37bbfd842ef4f0ff1392e97b1c22f5efdbd34f1b6c3bdae5f34","schema_version":"1.0","event_id":"sha256:5f91705b063bc37bbfd842ef4f0ff1392e97b1c22f5efdbd34f1b6c3bdae5f34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LEGKCCZ3GYMZ3AVSPIDQIFJWP/bundle.json","state_url":"https://pith.science/pith/2LEGKCCZ3GYMZ3AVSPIDQIFJWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LEGKCCZ3GYMZ3AVSPIDQIFJWP/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-05-24T18:27:50Z","links":{"resolver":"https://pith.science/pith/2LEGKCCZ3GYMZ3AVSPIDQIFJWP","bundle":"https://pith.science/pith/2LEGKCCZ3GYMZ3AVSPIDQIFJWP/bundle.json","state":"https://pith.science/pith/2LEGKCCZ3GYMZ3AVSPIDQIFJWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LEGKCCZ3GYMZ3AVSPIDQIFJWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2LEGKCCZ3GYMZ3AVSPIDQIFJWP","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":"7c475d2bc6e165feb7847f216daa4c7ea7ab9d4b023fa0e65ba03fac2b64b9d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-02-12T17:01:56Z","title_canon_sha256":"50cd270a2c1c48b5bd92edc8ca75bc09b10b81b3062bd5d4259dd3f7a8869949"},"schema_version":"1.0","source":{"id":"1102.2529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2529","created_at":"2026-05-18T04:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2529v1","created_at":"2026-05-18T04:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2529","created_at":"2026-05-18T04:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"2LEGKCCZ3GYM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2LEGKCCZ3GYMZ3AV","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2LEGKCCZ","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:5f91705b063bc37bbfd842ef4f0ff1392e97b1c22f5efdbd34f1b6c3bdae5f34","target":"graph","created_at":"2026-05-18T04:28:47Z","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"},"paper":{"abstract_excerpt":"We show that a subclass of infinite-state probabilistic programs that can be modeled by probabilistic one-counter automata (pOC) admits an efficient quantitative analysis. In particular, we show that the expected termination time can be approximated up to an arbitrarily small relative error with polynomially many arithmetic operations, and the same holds for the probability of all runs that satisfy a given omega-regular property. Further, our results establish a powerful link between pOC and martingale theory, which leads to fundamental observations about quantitative properties of runs in pOC","authors_text":"Antonin Kucera, Stefan Kiefer, Tomas Brazdil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-02-12T17:01:56Z","title":"Efficient Analysis of Probabilistic Programs with an Unbounded Counter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2529","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:819e3781b3e09ed12e46d3d6d4d10384e3059b90e1adada21494372de8f320aa","target":"record","created_at":"2026-05-18T04:28:47Z","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":"7c475d2bc6e165feb7847f216daa4c7ea7ab9d4b023fa0e65ba03fac2b64b9d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-02-12T17:01:56Z","title_canon_sha256":"50cd270a2c1c48b5bd92edc8ca75bc09b10b81b3062bd5d4259dd3f7a8869949"},"schema_version":"1.0","source":{"id":"1102.2529","kind":"arxiv","version":1}},"canonical_sha256":"d2c8650859d9b0ccec1593d03820a9b3c75f7a7f7e232e46b423b53ba2a3cf18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2c8650859d9b0ccec1593d03820a9b3c75f7a7f7e232e46b423b53ba2a3cf18","first_computed_at":"2026-05-18T04:28:47.184875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:47.184875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXiPHNRbMbT92DwQrPtbvztioutkojN+SLiR0dNjJjPpLEDwMe6CJYEOU+ncewTtMS/7soJ312xwqlvyOKlHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:47.185433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:819e3781b3e09ed12e46d3d6d4d10384e3059b90e1adada21494372de8f320aa","sha256:5f91705b063bc37bbfd842ef4f0ff1392e97b1c22f5efdbd34f1b6c3bdae5f34"],"state_sha256":"d4bde357ee3f894c262c51e8d1cf15da6db600cab200c034481f47b9c260a50a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ef7MVviO4xYTGFSm7OXcO5PJ79iVmH+cpcbrTEWbjG46ED2j5FQiom2Q7VXcAELjjmMDQTt7fupKLZwLia4YBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T18:27:50.185596Z","bundle_sha256":"adbd66a9c926796be4e0b324f741cc2baee024085df9b671ad5fecb31c3ac5c9"}}