{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5MCOUDMMTHQLX7JLY7TJHL7A23","short_pith_number":"pith:5MCOUDMM","canonical_record":{"source":{"id":"1007.1710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-10T09:49:19Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"32e52528619daa3ae31b090d93333899c1406350d734f12d005012335c714cd8","abstract_canon_sha256":"421d0cbacd07b6302703b128d9dd85eeaca884fb5968ddb395c0b9e52900ebc6"},"schema_version":"1.0"},"canonical_sha256":"eb04ea0d8c99e0bbfd2bc7e693afe0d6dc1cbfe651ee9616c00767b0f6cf9791","source":{"kind":"arxiv","id":"1007.1710","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1710","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1710v2","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1710","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"5MCOUDMMTHQL","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5MCOUDMMTHQLX7JL","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5MCOUDMM","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5MCOUDMMTHQLX7JLY7TJHL7A23","target":"record","payload":{"canonical_record":{"source":{"id":"1007.1710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-10T09:49:19Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"32e52528619daa3ae31b090d93333899c1406350d734f12d005012335c714cd8","abstract_canon_sha256":"421d0cbacd07b6302703b128d9dd85eeaca884fb5968ddb395c0b9e52900ebc6"},"schema_version":"1.0"},"canonical_sha256":"eb04ea0d8c99e0bbfd2bc7e693afe0d6dc1cbfe651ee9616c00767b0f6cf9791","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:37.842652Z","signature_b64":"C0wdjZCl+L0WgrpulyZ/rSdJ22WgYB4PAunBkDtQRSr1e5/qJX3SoWC3PM6MQ8MxDC+dxrc0C2Ds7s6/AxHfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb04ea0d8c99e0bbfd2bc7e693afe0d6dc1cbfe651ee9616c00767b0f6cf9791","last_reissued_at":"2026-05-18T03:54:37.841814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:37.841814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.1710","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-05-18T03:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bW8S68CW18888PV2Ycnjawaj9qRP08fvv/h9FuT3qmoitUsJDR52VHmhX84Go/fY9JChzGQomsD3Hnt/D7JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:55:49.396374Z"},"content_sha256":"93d123e11795effa6c23db1dc7e2121a42770ccb45f8301d608dc0986570de99","schema_version":"1.0","event_id":"sha256:93d123e11795effa6c23db1dc7e2121a42770ccb45f8301d608dc0986570de99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5MCOUDMMTHQLX7JLY7TJHL7A23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Runtime Analysis of Probabilistic Programs with Unbounded Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Antonin Kucera, Ivana Hutarova Varekova, Stefan Kiefer, Tomas Brazdil","submitted_at":"2010-07-10T09:49:19Z","abstract_excerpt":"We study termination time and recurrence time in programs with unbounded recursion, which are either randomized or operate on some statistically quantified inputs. As the underlying formal model for such programs we use probabilistic pushdown automata (pPDA) which are equivalent to probabilistic recursive state machines. We obtain tail bounds for the distribution of termination time for pPDA. We also study the recurrence time for probabilistic recursive programs that are not supposed to terminate (such as system daemons, network servers, etc.). Typically, such programs react to certain request"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1710","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":""},"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-18T03:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BspVlAHJhSgNW8Q/B88ZcAAZYpWZ89tVVcJEKWWi+Fkwtb3rAFuY1dPu0wy2VAPpLAITBqo5fw8VLYTygh3pDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:55:49.397025Z"},"content_sha256":"8609d1d3b2e91dec92d3d5d51902cf9e8f2caebe13667c29dfff8c1b846790c2","schema_version":"1.0","event_id":"sha256:8609d1d3b2e91dec92d3d5d51902cf9e8f2caebe13667c29dfff8c1b846790c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MCOUDMMTHQLX7JLY7TJHL7A23/bundle.json","state_url":"https://pith.science/pith/5MCOUDMMTHQLX7JLY7TJHL7A23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MCOUDMMTHQLX7JLY7TJHL7A23/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-23T21:55:49Z","links":{"resolver":"https://pith.science/pith/5MCOUDMMTHQLX7JLY7TJHL7A23","bundle":"https://pith.science/pith/5MCOUDMMTHQLX7JLY7TJHL7A23/bundle.json","state":"https://pith.science/pith/5MCOUDMMTHQLX7JLY7TJHL7A23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MCOUDMMTHQLX7JLY7TJHL7A23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5MCOUDMMTHQLX7JLY7TJHL7A23","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":"421d0cbacd07b6302703b128d9dd85eeaca884fb5968ddb395c0b9e52900ebc6","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-10T09:49:19Z","title_canon_sha256":"32e52528619daa3ae31b090d93333899c1406350d734f12d005012335c714cd8"},"schema_version":"1.0","source":{"id":"1007.1710","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1710","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1710v2","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1710","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"5MCOUDMMTHQL","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5MCOUDMMTHQLX7JL","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5MCOUDMM","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:8609d1d3b2e91dec92d3d5d51902cf9e8f2caebe13667c29dfff8c1b846790c2","target":"graph","created_at":"2026-05-18T03:54: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"},"paper":{"abstract_excerpt":"We study termination time and recurrence time in programs with unbounded recursion, which are either randomized or operate on some statistically quantified inputs. As the underlying formal model for such programs we use probabilistic pushdown automata (pPDA) which are equivalent to probabilistic recursive state machines. We obtain tail bounds for the distribution of termination time for pPDA. We also study the recurrence time for probabilistic recursive programs that are not supposed to terminate (such as system daemons, network servers, etc.). Typically, such programs react to certain request","authors_text":"Antonin Kucera, Ivana Hutarova Varekova, Stefan Kiefer, Tomas Brazdil","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-10T09:49:19Z","title":"Runtime Analysis of Probabilistic Programs with Unbounded Recursion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1710","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:93d123e11795effa6c23db1dc7e2121a42770ccb45f8301d608dc0986570de99","target":"record","created_at":"2026-05-18T03:54: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":"421d0cbacd07b6302703b128d9dd85eeaca884fb5968ddb395c0b9e52900ebc6","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-10T09:49:19Z","title_canon_sha256":"32e52528619daa3ae31b090d93333899c1406350d734f12d005012335c714cd8"},"schema_version":"1.0","source":{"id":"1007.1710","kind":"arxiv","version":2}},"canonical_sha256":"eb04ea0d8c99e0bbfd2bc7e693afe0d6dc1cbfe651ee9616c00767b0f6cf9791","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb04ea0d8c99e0bbfd2bc7e693afe0d6dc1cbfe651ee9616c00767b0f6cf9791","first_computed_at":"2026-05-18T03:54:37.841814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:37.841814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C0wdjZCl+L0WgrpulyZ/rSdJ22WgYB4PAunBkDtQRSr1e5/qJX3SoWC3PM6MQ8MxDC+dxrc0C2Ds7s6/AxHfAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:37.842652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1710","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93d123e11795effa6c23db1dc7e2121a42770ccb45f8301d608dc0986570de99","sha256:8609d1d3b2e91dec92d3d5d51902cf9e8f2caebe13667c29dfff8c1b846790c2"],"state_sha256":"b58b8acc9bd809489f61fdcc4bb72d4518829532d725052dd99815d05c344a95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhByxhyY31jZTUZhQXoMObkMXRLOI3xF8S/8AqyFd/Mq0I4eicd3zxTsQHnCZ39hH78+ZxolfZP7l/cWluwaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:55:49.400748Z","bundle_sha256":"9cc4499f99ac59313b4fe72b2d023dbd25c9e65237052f940eed733109eedab2"}}