{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TCNRX5DKQ7QEAWEHC4XNOLLJP3","short_pith_number":"pith:TCNRX5DK","schema_version":"1.0","canonical_sha256":"989b1bf46a87e0405887172ed72d697eed92ba6f52cc9c0536b66db242883231","source":{"kind":"arxiv","id":"1809.02576","version":3},"attestation_state":"computed","paper":{"title":"The edge-statistics conjecture for $\\ell \\ll k^{6/5}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Anders Martinsson, Andreas Noever, Frank Mousset, Milo\\v{s} Truji\\'c","submitted_at":"2018-09-07T17:04:52Z","abstract_excerpt":"Let $k$ and $\\ell$ be positive integers. We prove that if $1 \\leq \\ell \\leq o_k(k^{6/5})$, then in every large enough graph $G$, the fraction of $k$-vertex subsets that induce exactly $\\ell$ edges is at most $1/e + o_k(1)$. Together with a recent result of Kwan, Sudakov, and Tran, this settles a conjecture of Alon, Hefetz, Krivelevich, and Tyomkyn."},"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.02576","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-07T17:04:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ca2fe5190df40604bc0104172756db49c7f8772a4ca47484854e8e862e6a8f8a","abstract_canon_sha256":"d93d7f4dae173fc711c93299f9708b4a28145d72bb913c6bcd27bac8ddbfb1d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:04:57.768609Z","signature_b64":"Kvq+7NKVgDgLpbHdzowVb9XJpY/NFb2Ss5Mdd0ulgdErJN/ZnhsXT5ehlhmHTurQtlPu9QWmAP+536UbrdgcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"989b1bf46a87e0405887172ed72d697eed92ba6f52cc9c0536b66db242883231","last_reissued_at":"2026-07-05T03:04:57.768186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:04:57.768186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The edge-statistics conjecture for $\\ell \\ll k^{6/5}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Anders Martinsson, Andreas Noever, Frank Mousset, Milo\\v{s} Truji\\'c","submitted_at":"2018-09-07T17:04:52Z","abstract_excerpt":"Let $k$ and $\\ell$ be positive integers. We prove that if $1 \\leq \\ell \\leq o_k(k^{6/5})$, then in every large enough graph $G$, the fraction of $k$-vertex subsets that induce exactly $\\ell$ edges is at most $1/e + o_k(1)$. Together with a recent result of Kwan, Sudakov, and Tran, this settles a conjecture of Alon, Hefetz, Krivelevich, and Tyomkyn."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02576","kind":"arxiv","version":3},"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.02576/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.02576","created_at":"2026-07-05T03:04:57.768238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02576v3","created_at":"2026-07-05T03:04:57.768238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02576","created_at":"2026-07-05T03:04:57.768238+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCNRX5DKQ7QE","created_at":"2026-07-05T03:04:57.768238+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCNRX5DKQ7QEAWEH","created_at":"2026-07-05T03:04:57.768238+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCNRX5DK","created_at":"2026-07-05T03:04:57.768238+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":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3","json":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3.json","graph_json":"https://pith.science/api/pith-number/TCNRX5DKQ7QEAWEHC4XNOLLJP3/graph.json","events_json":"https://pith.science/api/pith-number/TCNRX5DKQ7QEAWEHC4XNOLLJP3/events.json","paper":"https://pith.science/paper/TCNRX5DK"},"agent_actions":{"view_html":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3","download_json":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3.json","view_paper":"https://pith.science/paper/TCNRX5DK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02576&json=true","fetch_graph":"https://pith.science/api/pith-number/TCNRX5DKQ7QEAWEHC4XNOLLJP3/graph.json","fetch_events":"https://pith.science/api/pith-number/TCNRX5DKQ7QEAWEHC4XNOLLJP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3/action/storage_attestation","attest_author":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3/action/author_attestation","sign_citation":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3/action/citation_signature","submit_replication":"https://pith.science/pith/TCNRX5DKQ7QEAWEHC4XNOLLJP3/action/replication_record"}},"created_at":"2026-07-05T03:04:57.768238+00:00","updated_at":"2026-07-05T03:04:57.768238+00:00"}