{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z5REOGYINATKKXIHLMUYTCPPZQ","short_pith_number":"pith:Z5REOGYI","schema_version":"1.0","canonical_sha256":"cf62471b086826a55d075b298989efcc2705edd7198a22266e5d656ee5d9765c","source":{"kind":"arxiv","id":"1811.06779","version":2},"attestation_state":"computed","paper":{"title":"Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ichiro Hasuo, Natsuki Urabe, Satoshi Kura","submitted_at":"2018-11-16T12:24:35Z","abstract_excerpt":"Programs with randomization constructs is an active research topic, especially after the recent introduction of martingale-based analysis methods for their termination and runtimes. Unlike most of the existing works that focus on proving almost-sure termination or estimating the expected runtime, in this work we study the tail probabilities of runtimes-such as \"the execution takes more than 100 steps with probability at most 1%.\" To this goal, we devise a theory of supermartingales that overapproximate higher moments of runtime. These higher moments, combined with a suitable concentration ineq"},"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":"1811.06779","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T12:24:35Z","cross_cats_sorted":[],"title_canon_sha256":"38dd30afbf0ea08dcc1c3157edbcab8c2352c175f9d352114f84a594fbd3d501","abstract_canon_sha256":"545815ef004b559531b2c15cf20a0d86678944833b09c5b2243eb946814f1137"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:57.275857Z","signature_b64":"NnAsougZs5xWOAXLFePbOm5JBUOBulqgli9lLsq5q+mD4X1dCuOP5ZfbokmXlMj0Vhpjx6aEjJwaIyDTLk7TAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf62471b086826a55d075b298989efcc2705edd7198a22266e5d656ee5d9765c","last_reissued_at":"2026-05-17T23:53:57.275142Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:57.275142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ichiro Hasuo, Natsuki Urabe, Satoshi Kura","submitted_at":"2018-11-16T12:24:35Z","abstract_excerpt":"Programs with randomization constructs is an active research topic, especially after the recent introduction of martingale-based analysis methods for their termination and runtimes. Unlike most of the existing works that focus on proving almost-sure termination or estimating the expected runtime, in this work we study the tail probabilities of runtimes-such as \"the execution takes more than 100 steps with probability at most 1%.\" To this goal, we devise a theory of supermartingales that overapproximate higher moments of runtime. These higher moments, combined with a suitable concentration ineq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06779","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.06779","created_at":"2026-05-17T23:53:57.275254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06779v2","created_at":"2026-05-17T23:53:57.275254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06779","created_at":"2026-05-17T23:53:57.275254+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5REOGYINATK","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5REOGYINATKKXIH","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5REOGYI","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ","json":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ.json","graph_json":"https://pith.science/api/pith-number/Z5REOGYINATKKXIHLMUYTCPPZQ/graph.json","events_json":"https://pith.science/api/pith-number/Z5REOGYINATKKXIHLMUYTCPPZQ/events.json","paper":"https://pith.science/paper/Z5REOGYI"},"agent_actions":{"view_html":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ","download_json":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ.json","view_paper":"https://pith.science/paper/Z5REOGYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06779&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5REOGYINATKKXIHLMUYTCPPZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5REOGYINATKKXIHLMUYTCPPZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ/action/storage_attestation","attest_author":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ/action/author_attestation","sign_citation":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ/action/citation_signature","submit_replication":"https://pith.science/pith/Z5REOGYINATKKXIHLMUYTCPPZQ/action/replication_record"}},"created_at":"2026-05-17T23:53:57.275254+00:00","updated_at":"2026-05-17T23:53:57.275254+00:00"}