{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:POUPTVVNFEJIQNX5Y5RRSGVRC7","short_pith_number":"pith:POUPTVVN","schema_version":"1.0","canonical_sha256":"7ba8f9d6ad29128836fdc763191ab117e1a2301ec9e9e6551a626dcfd4a69c64","source":{"kind":"arxiv","id":"1602.03547","version":1},"attestation_state":"computed","paper":{"title":"On maximal tail probability of sums of nonnegative, independent and identically distributed random variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Katarzyna Mieczkowska, Matas \\v{S}ileikis, Tomasz {\\L}uczak","submitted_at":"2016-02-10T21:53:12Z","abstract_excerpt":"We consider the problem of finding the optimal upper bound for the tail probability of a sum of $k$ nonnegative, independent and identically distributed random variables with given mean $x$. For $k=1$ the answer is given by Markov's inequality and for $k=2$ the solution was found by Hoeffding and Shrikhande in 1955. We solve the problem for $k=3$ as well as for general $k$ and $x\\leq1/(2k-1)$ by showing that it follows from the fractional version of an extremal graph theory problem of Erd\\H{o}s on matchings in hypergraphs."},"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":"1602.03547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-10T21:53:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a2608032599b451877faacc6bda64004af61a9eae05ed3ab0f68916af57dc88","abstract_canon_sha256":"b71e087af85f7dc8d552c92500ded64966f17152c6a0bfa0c7625fd8088e00b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:58.519540Z","signature_b64":"pcDnvYVo3mus9zwJ4v+CJ0wv7IQgEf9i0P++F11QlJpyYlfyCReNjLhXHOjd0uEImwsjXS/XpcI4f+LJ6cEjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ba8f9d6ad29128836fdc763191ab117e1a2301ec9e9e6551a626dcfd4a69c64","last_reissued_at":"2026-05-18T01:20:58.519040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:58.519040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On maximal tail probability of sums of nonnegative, independent and identically distributed random variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Katarzyna Mieczkowska, Matas \\v{S}ileikis, Tomasz {\\L}uczak","submitted_at":"2016-02-10T21:53:12Z","abstract_excerpt":"We consider the problem of finding the optimal upper bound for the tail probability of a sum of $k$ nonnegative, independent and identically distributed random variables with given mean $x$. For $k=1$ the answer is given by Markov's inequality and for $k=2$ the solution was found by Hoeffding and Shrikhande in 1955. We solve the problem for $k=3$ as well as for general $k$ and $x\\leq1/(2k-1)$ by showing that it follows from the fractional version of an extremal graph theory problem of Erd\\H{o}s on matchings in hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03547","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.03547","created_at":"2026-05-18T01:20:58.519122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03547v1","created_at":"2026-05-18T01:20:58.519122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03547","created_at":"2026-05-18T01:20:58.519122+00:00"},{"alias_kind":"pith_short_12","alias_value":"POUPTVVNFEJI","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"POUPTVVNFEJIQNX5","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"POUPTVVN","created_at":"2026-05-18T12:30:39.010887+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/POUPTVVNFEJIQNX5Y5RRSGVRC7","json":"https://pith.science/pith/POUPTVVNFEJIQNX5Y5RRSGVRC7.json","graph_json":"https://pith.science/api/pith-number/POUPTVVNFEJIQNX5Y5RRSGVRC7/graph.json","events_json":"https://pith.science/api/pith-number/POUPTVVNFEJIQNX5Y5RRSGVRC7/events.json","paper":"https://pith.science/paper/POUPTVVN"},"agent_actions":{"view_html":"https://pith.science/pith/POUPTVVNFEJIQNX5Y5RRSGVRC7","download_json":"https://pith.science/pith/POUPTVVNFEJIQNX5Y5RRSGVRC7.json","view_paper":"https://pith.science/paper/POUPTVVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03547&json=true","fetch_graph":"https://pith.science/api/pith-number/POUPTVVNFEJIQNX5Y5RRSGVRC7/graph.json","fetch_events":"https://pith.science/api/pith-number/POUPTVVNFEJIQNX5Y5RRSGVRC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POUPTVVNFEJIQNX5Y5RRSGVRC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POUPTVVNFEJIQNX5Y5RRSGVRC7/action/storage_attestation","attest_author":"https://pith.science/pith/POUPTVVNFEJIQNX5Y5RRSGVRC7/action/author_attestation","sign_citation":"https://pith.science/pith/POUPTVVNFEJIQNX5Y5RRSGVRC7/action/citation_signature","submit_replication":"https://pith.science/pith/POUPTVVNFEJIQNX5Y5RRSGVRC7/action/replication_record"}},"created_at":"2026-05-18T01:20:58.519122+00:00","updated_at":"2026-05-18T01:20:58.519122+00:00"}