{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TMZKYZLFOSSD73XHPBG3MXP7YX","short_pith_number":"pith:TMZKYZLF","schema_version":"1.0","canonical_sha256":"9b32ac656574a43feee7784db65dffc5d3a08fe599c98e56ecc0566aeff69458","source":{"kind":"arxiv","id":"2505.03954","version":2},"attestation_state":"computed","paper":{"title":"The edge-statistics conjecture for hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Matthew Kwan, Tuan Tran, Vishesh Jain","submitted_at":"2025-05-06T20:14:09Z","abstract_excerpt":"Let $r,k,\\ell$ be integers such that $0\\le\\ell\\le\\binom{k}{r}$. Given a large $r$-uniform hypergraph $G$, we consider the fraction of $k$-vertex subsets which span exactly $\\ell$ edges. If $\\ell$ is 0 or $\\binom{k}{r}$, this fraction can be exactly 1 (by taking $G$ to be empty or complete), but for all other values of $\\ell$, one might suspect that this fraction is always significantly smaller than 1.\n  In this paper we prove an essentially optimal result along these lines: if $\\ell$ is not 0 or $\\binom{k}{r}$, then this fraction is at most $(1/e) + \\varepsilon$, assuming $k$ is sufficiently l"},"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":"2505.03954","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-06T20:14:09Z","cross_cats_sorted":[],"title_canon_sha256":"48d8f89472311df6973d1c8ed2a4bbd8f71fd2c58ddb710d157879658f95acf3","abstract_canon_sha256":"4164822fad7a810621d423ad5b327f829353b8e40b0ae0490d7bc1152a72268d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:56.808201Z","signature_b64":"TZss6uDPc2PrcYsY4RhDMdgYtq/tKDFActl9mQES/++4mxI3R2Xb2SxbZ6Ycrp3kqWNaCQZjcVfkXXBT/pCjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b32ac656574a43feee7784db65dffc5d3a08fe599c98e56ecc0566aeff69458","last_reissued_at":"2026-07-05T11:56:56.807704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:56.807704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The edge-statistics conjecture for hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Matthew Kwan, Tuan Tran, Vishesh Jain","submitted_at":"2025-05-06T20:14:09Z","abstract_excerpt":"Let $r,k,\\ell$ be integers such that $0\\le\\ell\\le\\binom{k}{r}$. Given a large $r$-uniform hypergraph $G$, we consider the fraction of $k$-vertex subsets which span exactly $\\ell$ edges. If $\\ell$ is 0 or $\\binom{k}{r}$, this fraction can be exactly 1 (by taking $G$ to be empty or complete), but for all other values of $\\ell$, one might suspect that this fraction is always significantly smaller than 1.\n  In this paper we prove an essentially optimal result along these lines: if $\\ell$ is not 0 or $\\binom{k}{r}$, then this fraction is at most $(1/e) + \\varepsilon$, assuming $k$ is sufficiently l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03954","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.03954/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":"2505.03954","created_at":"2026-07-05T11:56:56.807762+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.03954v2","created_at":"2026-07-05T11:56:56.807762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03954","created_at":"2026-07-05T11:56:56.807762+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMZKYZLFOSSD","created_at":"2026-07-05T11:56:56.807762+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMZKYZLFOSSD73XH","created_at":"2026-07-05T11:56:56.807762+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMZKYZLF","created_at":"2026-07-05T11:56:56.807762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.23264","citing_title":"Relative discrepancy of hypergraphs","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX","json":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX.json","graph_json":"https://pith.science/api/pith-number/TMZKYZLFOSSD73XHPBG3MXP7YX/graph.json","events_json":"https://pith.science/api/pith-number/TMZKYZLFOSSD73XHPBG3MXP7YX/events.json","paper":"https://pith.science/paper/TMZKYZLF"},"agent_actions":{"view_html":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX","download_json":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX.json","view_paper":"https://pith.science/paper/TMZKYZLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.03954&json=true","fetch_graph":"https://pith.science/api/pith-number/TMZKYZLFOSSD73XHPBG3MXP7YX/graph.json","fetch_events":"https://pith.science/api/pith-number/TMZKYZLFOSSD73XHPBG3MXP7YX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX/action/storage_attestation","attest_author":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX/action/author_attestation","sign_citation":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX/action/citation_signature","submit_replication":"https://pith.science/pith/TMZKYZLFOSSD73XHPBG3MXP7YX/action/replication_record"}},"created_at":"2026-07-05T11:56:56.807762+00:00","updated_at":"2026-07-05T11:56:56.807762+00:00"}