{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4EDVVGP4IC4E2RAI6XAL2ZFH6G","short_pith_number":"pith:4EDVVGP4","schema_version":"1.0","canonical_sha256":"e1075a99fc40b84d4408f5c0bd64a7f1895553d85bc1cc0cf023b50769e021e7","source":{"kind":"arxiv","id":"2305.15104","version":1},"attestation_state":"computed","paper":{"title":"Automated Tail Bound Analysis for Probabilistic Recurrence Relations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee, Yican Sun","submitted_at":"2023-05-24T12:47:50Z","abstract_excerpt":"Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit $\\kappa$, we consider the classical concept of tail probability $\\Pr[T \\ge \\kappa]$, i.e., the probability that the randomized runtime $T$ of the PRR exceeds the time limit $\\kappa$. Our focus is the formal analysis of tail bounds that aims at finding a tight asymptotic upper bound $u \\geq \\Pr[T\\ge\\kappa]$ in the time limit $\\kappa$. To address this problem, the classical and most well-known approach is the cookbook method by Karp (JACM 1994), 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":"2305.15104","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-24T12:47:50Z","cross_cats_sorted":[],"title_canon_sha256":"545d0794aa8487fcedd9c1738584c4e17eb1edf2312c3ff651fb239089bd11e6","abstract_canon_sha256":"f19ee383865fe9b01684e16dcdb33a751aeb2071ee7e30e60d74e475cb7014c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:31.262645Z","signature_b64":"khDUNShj3gBVYMqU+5b+NlkwB7+mMJqB+NCqnxUO6P8jxSxLDSyPMAsH+J/L6WSw/FjEWM4DmeiI3HSdG4D7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1075a99fc40b84d4408f5c0bd64a7f1895553d85bc1cc0cf023b50769e021e7","last_reissued_at":"2026-07-05T06:13:31.262118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:31.262118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Tail Bound Analysis for Probabilistic Recurrence Relations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee, Yican Sun","submitted_at":"2023-05-24T12:47:50Z","abstract_excerpt":"Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit $\\kappa$, we consider the classical concept of tail probability $\\Pr[T \\ge \\kappa]$, i.e., the probability that the randomized runtime $T$ of the PRR exceeds the time limit $\\kappa$. Our focus is the formal analysis of tail bounds that aims at finding a tight asymptotic upper bound $u \\geq \\Pr[T\\ge\\kappa]$ in the time limit $\\kappa$. To address this problem, the classical and most well-known approach is the cookbook method by Karp (JACM 1994), wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.15104","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/2305.15104/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":"2305.15104","created_at":"2026-07-05T06:13:31.262177+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.15104v1","created_at":"2026-07-05T06:13:31.262177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.15104","created_at":"2026-07-05T06:13:31.262177+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EDVVGP4IC4E","created_at":"2026-07-05T06:13:31.262177+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EDVVGP4IC4E2RAI","created_at":"2026-07-05T06:13:31.262177+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EDVVGP4","created_at":"2026-07-05T06:13:31.262177+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/4EDVVGP4IC4E2RAI6XAL2ZFH6G","json":"https://pith.science/pith/4EDVVGP4IC4E2RAI6XAL2ZFH6G.json","graph_json":"https://pith.science/api/pith-number/4EDVVGP4IC4E2RAI6XAL2ZFH6G/graph.json","events_json":"https://pith.science/api/pith-number/4EDVVGP4IC4E2RAI6XAL2ZFH6G/events.json","paper":"https://pith.science/paper/4EDVVGP4"},"agent_actions":{"view_html":"https://pith.science/pith/4EDVVGP4IC4E2RAI6XAL2ZFH6G","download_json":"https://pith.science/pith/4EDVVGP4IC4E2RAI6XAL2ZFH6G.json","view_paper":"https://pith.science/paper/4EDVVGP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.15104&json=true","fetch_graph":"https://pith.science/api/pith-number/4EDVVGP4IC4E2RAI6XAL2ZFH6G/graph.json","fetch_events":"https://pith.science/api/pith-number/4EDVVGP4IC4E2RAI6XAL2ZFH6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EDVVGP4IC4E2RAI6XAL2ZFH6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EDVVGP4IC4E2RAI6XAL2ZFH6G/action/storage_attestation","attest_author":"https://pith.science/pith/4EDVVGP4IC4E2RAI6XAL2ZFH6G/action/author_attestation","sign_citation":"https://pith.science/pith/4EDVVGP4IC4E2RAI6XAL2ZFH6G/action/citation_signature","submit_replication":"https://pith.science/pith/4EDVVGP4IC4E2RAI6XAL2ZFH6G/action/replication_record"}},"created_at":"2026-07-05T06:13:31.262177+00:00","updated_at":"2026-07-05T06:13:31.262177+00:00"}