{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IWONC2CDVHM4CUYEKCJ6PRJLXU","short_pith_number":"pith:IWONC2CD","schema_version":"1.0","canonical_sha256":"459cd16843a9d9c153045093e7c52bbd1e2adc7daa9721b8053a6af42369cbc3","source":{"kind":"arxiv","id":"1807.05202","version":5},"attestation_state":"computed","paper":{"title":"Anticoncentration for subgraph statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matthew Kwan, Tuan Tran","submitted_at":"2018-07-13T17:37:56Z","abstract_excerpt":"Consider integers $k,\\ell$ such that $0\\le \\ell \\le \\binom{k}2$. Given a large graph $G$, what is the fraction of $k$-vertex subsets of $G$ which span exactly $\\ell$ edges? When $G$ is empty or complete, and $\\ell$ is zero or $\\binom{k}{2}$, this fraction can be exactly 1. On the other hand, if $\\ell$ is far from these extreme values, one might expect that this fraction is substantially smaller than 1. This was recently proved by Alon, Hefetz, Krivelevich and Tyomkyn who intiated the systematic study of this question and proposed several natural conjectures.\n  Let $\\ell^{*}=\\min\\{\\ell,\\binom{k"},"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":"1807.05202","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T17:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"b3837c32108be8804f02789673b21e9b63c49188dcbc923b54d61c1bec64afcb","abstract_canon_sha256":"4873f31c86d5be2f416dc76977c797a06a434f67f291c9a6a5233d258815f099"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:52.218246Z","signature_b64":"Ex6WhJvXo/MXlEoqJUAOTCPOHWrvr/Ny7o9tEbP1SyVtXvfzQIZTJTIMzqAi+u0GkcOYoRamQ0lS4JfArEFMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"459cd16843a9d9c153045093e7c52bbd1e2adc7daa9721b8053a6af42369cbc3","last_reissued_at":"2026-05-17T23:59:52.217757Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:52.217757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anticoncentration for subgraph statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matthew Kwan, Tuan Tran","submitted_at":"2018-07-13T17:37:56Z","abstract_excerpt":"Consider integers $k,\\ell$ such that $0\\le \\ell \\le \\binom{k}2$. Given a large graph $G$, what is the fraction of $k$-vertex subsets of $G$ which span exactly $\\ell$ edges? When $G$ is empty or complete, and $\\ell$ is zero or $\\binom{k}{2}$, this fraction can be exactly 1. On the other hand, if $\\ell$ is far from these extreme values, one might expect that this fraction is substantially smaller than 1. This was recently proved by Alon, Hefetz, Krivelevich and Tyomkyn who intiated the systematic study of this question and proposed several natural conjectures.\n  Let $\\ell^{*}=\\min\\{\\ell,\\binom{k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05202","kind":"arxiv","version":5},"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":"1807.05202","created_at":"2026-05-17T23:59:52.217822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05202v5","created_at":"2026-05-17T23:59:52.217822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05202","created_at":"2026-05-17T23:59:52.217822+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWONC2CDVHM4","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWONC2CDVHM4CUYE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWONC2CD","created_at":"2026-05-18T12:32:31.084164+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/IWONC2CDVHM4CUYEKCJ6PRJLXU","json":"https://pith.science/pith/IWONC2CDVHM4CUYEKCJ6PRJLXU.json","graph_json":"https://pith.science/api/pith-number/IWONC2CDVHM4CUYEKCJ6PRJLXU/graph.json","events_json":"https://pith.science/api/pith-number/IWONC2CDVHM4CUYEKCJ6PRJLXU/events.json","paper":"https://pith.science/paper/IWONC2CD"},"agent_actions":{"view_html":"https://pith.science/pith/IWONC2CDVHM4CUYEKCJ6PRJLXU","download_json":"https://pith.science/pith/IWONC2CDVHM4CUYEKCJ6PRJLXU.json","view_paper":"https://pith.science/paper/IWONC2CD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05202&json=true","fetch_graph":"https://pith.science/api/pith-number/IWONC2CDVHM4CUYEKCJ6PRJLXU/graph.json","fetch_events":"https://pith.science/api/pith-number/IWONC2CDVHM4CUYEKCJ6PRJLXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWONC2CDVHM4CUYEKCJ6PRJLXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWONC2CDVHM4CUYEKCJ6PRJLXU/action/storage_attestation","attest_author":"https://pith.science/pith/IWONC2CDVHM4CUYEKCJ6PRJLXU/action/author_attestation","sign_citation":"https://pith.science/pith/IWONC2CDVHM4CUYEKCJ6PRJLXU/action/citation_signature","submit_replication":"https://pith.science/pith/IWONC2CDVHM4CUYEKCJ6PRJLXU/action/replication_record"}},"created_at":"2026-05-17T23:59:52.217822+00:00","updated_at":"2026-05-17T23:59:52.217822+00:00"}