{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LYIMLMQ7UERJSUKMASN246UNRD","short_pith_number":"pith:LYIMLMQ7","schema_version":"1.0","canonical_sha256":"5e10c5b21fa12299514c049bae7a8d88f20b7d050410bb2dcf3d9fcc484fa623","source":{"kind":"arxiv","id":"1405.2349","version":2},"attestation_state":"computed","paper":{"title":"Upper Tail Estimates with Combinatorial Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jan H\\k{a}z{\\l}a, Thomas Holenstein","submitted_at":"2014-05-09T20:29:00Z","abstract_excerpt":"We study generalisations of a simple, combinatorial proof of a Chernoff bound similar to the one by Impagliazzo and Kabanets (RANDOM, 2010).\n  In particular, we prove a randomized version of the hitting property of expander random walks and apply it to obtain a concentration bound for expander random walks which is essentially optimal for small deviations and a large number of steps. At the same time, we present a simpler proof that still yields a \"right\" bound settling a question asked by Impagliazzo and Kabanets.\n  Next, we obtain a simple upper tail bound for polynomials with input variable"},"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":"1405.2349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-09T20:29:00Z","cross_cats_sorted":[],"title_canon_sha256":"36df1991b7432383a6da72c05fa459a80462e4ef72186a1096fbfd1801b41de8","abstract_canon_sha256":"1590b4c811846a7497afea2b9e8edaacdb3d6dabd6633e6c33f880654026ef7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:23.465905Z","signature_b64":"zefSopxEK7eJ4F99eoGZURKTLyiCwiH0UHIX6rUQ8UU2fRmLq6OVVzHFB8B2SARtayHBLw22kPIvgBDAOzALDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e10c5b21fa12299514c049bae7a8d88f20b7d050410bb2dcf3d9fcc484fa623","last_reissued_at":"2026-05-18T02:29:23.465499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:23.465499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper Tail Estimates with Combinatorial Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jan H\\k{a}z{\\l}a, Thomas Holenstein","submitted_at":"2014-05-09T20:29:00Z","abstract_excerpt":"We study generalisations of a simple, combinatorial proof of a Chernoff bound similar to the one by Impagliazzo and Kabanets (RANDOM, 2010).\n  In particular, we prove a randomized version of the hitting property of expander random walks and apply it to obtain a concentration bound for expander random walks which is essentially optimal for small deviations and a large number of steps. At the same time, we present a simpler proof that still yields a \"right\" bound settling a question asked by Impagliazzo and Kabanets.\n  Next, we obtain a simple upper tail bound for polynomials with input variable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2349","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":"1405.2349","created_at":"2026-05-18T02:29:23.465558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2349v2","created_at":"2026-05-18T02:29:23.465558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2349","created_at":"2026-05-18T02:29:23.465558+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYIMLMQ7UERJ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYIMLMQ7UERJSUKM","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYIMLMQ7","created_at":"2026-05-18T12:28:38.356838+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/LYIMLMQ7UERJSUKMASN246UNRD","json":"https://pith.science/pith/LYIMLMQ7UERJSUKMASN246UNRD.json","graph_json":"https://pith.science/api/pith-number/LYIMLMQ7UERJSUKMASN246UNRD/graph.json","events_json":"https://pith.science/api/pith-number/LYIMLMQ7UERJSUKMASN246UNRD/events.json","paper":"https://pith.science/paper/LYIMLMQ7"},"agent_actions":{"view_html":"https://pith.science/pith/LYIMLMQ7UERJSUKMASN246UNRD","download_json":"https://pith.science/pith/LYIMLMQ7UERJSUKMASN246UNRD.json","view_paper":"https://pith.science/paper/LYIMLMQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2349&json=true","fetch_graph":"https://pith.science/api/pith-number/LYIMLMQ7UERJSUKMASN246UNRD/graph.json","fetch_events":"https://pith.science/api/pith-number/LYIMLMQ7UERJSUKMASN246UNRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYIMLMQ7UERJSUKMASN246UNRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYIMLMQ7UERJSUKMASN246UNRD/action/storage_attestation","attest_author":"https://pith.science/pith/LYIMLMQ7UERJSUKMASN246UNRD/action/author_attestation","sign_citation":"https://pith.science/pith/LYIMLMQ7UERJSUKMASN246UNRD/action/citation_signature","submit_replication":"https://pith.science/pith/LYIMLMQ7UERJSUKMASN246UNRD/action/replication_record"}},"created_at":"2026-05-18T02:29:23.465558+00:00","updated_at":"2026-05-18T02:29:23.465558+00:00"}