{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TMZKYZLFOSSD73XHPBG3MXP7YX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4164822fad7a810621d423ad5b327f829353b8e40b0ae0490d7bc1152a72268d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-06T20:14:09Z","title_canon_sha256":"48d8f89472311df6973d1c8ed2a4bbd8f71fd2c58ddb710d157879658f95acf3"},"schema_version":"1.0","source":{"id":"2505.03954","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03954","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03954v2","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03954","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"TMZKYZLFOSSD","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"TMZKYZLFOSSD73XH","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"TMZKYZLF","created_at":"2026-07-05T11:56:56Z"}],"graph_snapshots":[{"event_id":"sha256:c726c339ddc4e5f9f4b7e966774155802fba8623a8ff568b90ef4728e7ea18b4","target":"graph","created_at":"2026-07-05T11:56:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.03954/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dhruv Mubayi, Matthew Kwan, Tuan Tran, Vishesh Jain","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-06T20:14:09Z","title":"The edge-statistics conjecture for hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03954","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:121812cc64d85a72d9193715c11070ca7033cd8b96222026d9e330d2af2b091c","target":"record","created_at":"2026-07-05T11:56:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4164822fad7a810621d423ad5b327f829353b8e40b0ae0490d7bc1152a72268d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-06T20:14:09Z","title_canon_sha256":"48d8f89472311df6973d1c8ed2a4bbd8f71fd2c58ddb710d157879658f95acf3"},"schema_version":"1.0","source":{"id":"2505.03954","kind":"arxiv","version":2}},"canonical_sha256":"9b32ac656574a43feee7784db65dffc5d3a08fe599c98e56ecc0566aeff69458","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b32ac656574a43feee7784db65dffc5d3a08fe599c98e56ecc0566aeff69458","first_computed_at":"2026-07-05T11:56:56.807704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:56:56.807704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TZss6uDPc2PrcYsY4RhDMdgYtq/tKDFActl9mQES/++4mxI3R2Xb2SxbZ6Ycrp3kqWNaCQZjcVfkXXBT/pCjAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:56:56.808201Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.03954","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:121812cc64d85a72d9193715c11070ca7033cd8b96222026d9e330d2af2b091c","sha256:c726c339ddc4e5f9f4b7e966774155802fba8623a8ff568b90ef4728e7ea18b4"],"state_sha256":"ed7f5f7f2d3cd532873cbd334300d630f54831ed1fbfd623fd9458cf4c2f86e2"}