{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q4WZM462HNLOMCBETNHSLORDEP","short_pith_number":"pith:Q4WZM462","schema_version":"1.0","canonical_sha256":"872d9673da3b56e608249b4f25ba2323cc102170b0514282d72ddc10d452ee92","source":{"kind":"arxiv","id":"1809.01352","version":4},"attestation_state":"computed","paper":{"title":"A Completion of the Proof of the Edge-statistics Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jacob Fox, Lisa Sauermann","submitted_at":"2018-09-05T06:46:41Z","abstract_excerpt":"For given integers $k$ and $\\ell$ with $0<\\ell< {k \\choose 2}$, Alon, Hefetz, Krivelevich and Tyomkyn formulated the following conjecture: When sampling a $k$-vertex subset uniformly at random from a very large graph $G$, then the probability to have exactly $\\ell$ edges within the sampled $k$-vertex subset is at most $e^{-1}+o_k(1)$. This conjecture was proved in the case $\\Omega(k)\\leq \\ell\\leq {k \\choose 2}-\\Omega(k)$ by Kwan, Sudakov and Tran. In this paper, we complete the proof of the conjecture by resolving the remaining cases. We furthermore give nearly tight upper bounds for the proba"},"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":"1809.01352","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-05T06:46:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"30a3aa22fcb6a5acd360acc9e515028421cea729853c1e0cd1e2a360f860393e","abstract_canon_sha256":"02dbcb8152ec8b9dc0260360bf959f95411197906a00a38c07948476688be629"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:18.145128Z","signature_b64":"4dLmVr6uzCX2KayIAGvWGtftMRP3rXXtaBNzEL0T48INoArBFPUiSmYcP9VUT1sKXAT/eNPJsNos9biS6F3oCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"872d9673da3b56e608249b4f25ba2323cc102170b0514282d72ddc10d452ee92","last_reissued_at":"2026-07-05T00:43:18.144718Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:18.144718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Completion of the Proof of the Edge-statistics Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jacob Fox, Lisa Sauermann","submitted_at":"2018-09-05T06:46:41Z","abstract_excerpt":"For given integers $k$ and $\\ell$ with $0<\\ell< {k \\choose 2}$, Alon, Hefetz, Krivelevich and Tyomkyn formulated the following conjecture: When sampling a $k$-vertex subset uniformly at random from a very large graph $G$, then the probability to have exactly $\\ell$ edges within the sampled $k$-vertex subset is at most $e^{-1}+o_k(1)$. This conjecture was proved in the case $\\Omega(k)\\leq \\ell\\leq {k \\choose 2}-\\Omega(k)$ by Kwan, Sudakov and Tran. In this paper, we complete the proof of the conjecture by resolving the remaining cases. We furthermore give nearly tight upper bounds for the proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01352","kind":"arxiv","version":4},"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/1809.01352/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":"1809.01352","created_at":"2026-07-05T00:43:18.144780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01352v4","created_at":"2026-07-05T00:43:18.144780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01352","created_at":"2026-07-05T00:43:18.144780+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4WZM462HNLO","created_at":"2026-07-05T00:43:18.144780+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4WZM462HNLOMCBE","created_at":"2026-07-05T00:43:18.144780+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4WZM462","created_at":"2026-07-05T00:43:18.144780+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02089","citing_title":"An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP","json":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP.json","graph_json":"https://pith.science/api/pith-number/Q4WZM462HNLOMCBETNHSLORDEP/graph.json","events_json":"https://pith.science/api/pith-number/Q4WZM462HNLOMCBETNHSLORDEP/events.json","paper":"https://pith.science/paper/Q4WZM462"},"agent_actions":{"view_html":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP","download_json":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP.json","view_paper":"https://pith.science/paper/Q4WZM462","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01352&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4WZM462HNLOMCBETNHSLORDEP/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4WZM462HNLOMCBETNHSLORDEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP/action/storage_attestation","attest_author":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP/action/author_attestation","sign_citation":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP/action/citation_signature","submit_replication":"https://pith.science/pith/Q4WZM462HNLOMCBETNHSLORDEP/action/replication_record"}},"created_at":"2026-07-05T00:43:18.144780+00:00","updated_at":"2026-07-05T00:43:18.144780+00:00"}