{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XWMM34QDEWLTPFOD75ELVKBTL3","short_pith_number":"pith:XWMM34QD","schema_version":"1.0","canonical_sha256":"bd98cdf20325973795c3ff48baa8335ec59a9fdcbac2a75527a74abff0e3cefc","source":{"kind":"arxiv","id":"1111.6687","version":2},"attestation_state":"computed","paper":{"title":"Upper Tails for Cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Bobby DeMarco, Jeff Kahn","submitted_at":"2011-11-29T04:25:14Z","abstract_excerpt":"With $\\xi_{k}=\\xi_{k}^{n,p}$ the number of copies of $K_k$ in the usual (Erd\\H{o}s-R\\'enyi) random graph $G(n,p)$, $p\\geq n^{-2/(k-1)}$ and $\\eta>0$, we show when $k>1$ $$\\Pr(\\xi_k> (1+\\eta)\\E \\xi_k) < \\exp [-\\gO_{\\eta,k} \\min\\{n^2p^{k-1}\\log(1/p), n^kp^{\\binom{k}{2}}\\}].$$ This is tight up to the value of the constant in the exponent."},"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":"1111.6687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-29T04:25:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"35eddff0f06ab9398353f545aba805eda001e46b57cfe66d6903d428210a6268","abstract_canon_sha256":"9e6ca464cda06f6617c2726c074f47955a992469620b14c2068bc1b5fc1ec81f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:12.644080Z","signature_b64":"tUnrMxA6aNf/Gq2Z3fWjVodPbqH/zitqT9ewV40V+U7mrjNi0MKP766Qq6meXCh/XB0t+dSkMYihf8R6yePSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd98cdf20325973795c3ff48baa8335ec59a9fdcbac2a75527a74abff0e3cefc","last_reissued_at":"2026-05-18T03:41:12.643282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:12.643282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper Tails for Cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Bobby DeMarco, Jeff Kahn","submitted_at":"2011-11-29T04:25:14Z","abstract_excerpt":"With $\\xi_{k}=\\xi_{k}^{n,p}$ the number of copies of $K_k$ in the usual (Erd\\H{o}s-R\\'enyi) random graph $G(n,p)$, $p\\geq n^{-2/(k-1)}$ and $\\eta>0$, we show when $k>1$ $$\\Pr(\\xi_k> (1+\\eta)\\E \\xi_k) < \\exp [-\\gO_{\\eta,k} \\min\\{n^2p^{k-1}\\log(1/p), n^kp^{\\binom{k}{2}}\\}].$$ This is tight up to the value of the constant in the exponent."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6687","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":"1111.6687","created_at":"2026-05-18T03:41:12.643424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.6687v2","created_at":"2026-05-18T03:41:12.643424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6687","created_at":"2026-05-18T03:41:12.643424+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWMM34QDEWLT","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWMM34QDEWLTPFOD","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWMM34QD","created_at":"2026-05-18T12:26:47.523578+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/XWMM34QDEWLTPFOD75ELVKBTL3","json":"https://pith.science/pith/XWMM34QDEWLTPFOD75ELVKBTL3.json","graph_json":"https://pith.science/api/pith-number/XWMM34QDEWLTPFOD75ELVKBTL3/graph.json","events_json":"https://pith.science/api/pith-number/XWMM34QDEWLTPFOD75ELVKBTL3/events.json","paper":"https://pith.science/paper/XWMM34QD"},"agent_actions":{"view_html":"https://pith.science/pith/XWMM34QDEWLTPFOD75ELVKBTL3","download_json":"https://pith.science/pith/XWMM34QDEWLTPFOD75ELVKBTL3.json","view_paper":"https://pith.science/paper/XWMM34QD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.6687&json=true","fetch_graph":"https://pith.science/api/pith-number/XWMM34QDEWLTPFOD75ELVKBTL3/graph.json","fetch_events":"https://pith.science/api/pith-number/XWMM34QDEWLTPFOD75ELVKBTL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWMM34QDEWLTPFOD75ELVKBTL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWMM34QDEWLTPFOD75ELVKBTL3/action/storage_attestation","attest_author":"https://pith.science/pith/XWMM34QDEWLTPFOD75ELVKBTL3/action/author_attestation","sign_citation":"https://pith.science/pith/XWMM34QDEWLTPFOD75ELVKBTL3/action/citation_signature","submit_replication":"https://pith.science/pith/XWMM34QDEWLTPFOD75ELVKBTL3/action/replication_record"}},"created_at":"2026-05-18T03:41:12.643424+00:00","updated_at":"2026-05-18T03:41:12.643424+00:00"}