{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F4WNIE6LWFGED43C52XUS6MHCS","short_pith_number":"pith:F4WNIE6L","schema_version":"1.0","canonical_sha256":"2f2cd413cbb14c41f362eeaf49798714b7e6928b0c555dde44a484df4220fa72","source":{"kind":"arxiv","id":"1803.08462","version":3},"attestation_state":"computed","paper":{"title":"Hypergraph cuts above the average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox, Matthew Kwan","submitted_at":"2018-03-22T17:04:29Z","abstract_excerpt":"An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut of size $m/2 + \\Omega(\\sqrt{m})$, and this is best possible. That is, there exist cuts which exceed the expected size of a random cut by some multiple of the standard deviation. We study analogues of this and related results in hypergraphs. First, we observe that similarly to graphs, every m-edge k-uniform hypergraph has an r-cut whose size is $\\Omega(\\sqrt "},"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":"1803.08462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-22T17:04:29Z","cross_cats_sorted":[],"title_canon_sha256":"f1e63a07b82feeca799afd2e00b5ffec51e21533c5076cb60be62a6b3c6fe949","abstract_canon_sha256":"276bdb5d6a5949c4450b3703592be3a58bfc1deae1283c1652c56e6943708021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:03.222408Z","signature_b64":"f5plCZVjg6ALmqglFkluwdxRp3Q6wzCS8UMEXmhTio2/iBEwxCZkAG3JaVShq78NGlkQx26TQ3OtuvQS8S+zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f2cd413cbb14c41f362eeaf49798714b7e6928b0c555dde44a484df4220fa72","last_reissued_at":"2026-05-17T23:42:03.221753Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:03.221753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph cuts above the average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox, Matthew Kwan","submitted_at":"2018-03-22T17:04:29Z","abstract_excerpt":"An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut of size $m/2 + \\Omega(\\sqrt{m})$, and this is best possible. That is, there exist cuts which exceed the expected size of a random cut by some multiple of the standard deviation. We study analogues of this and related results in hypergraphs. First, we observe that similarly to graphs, every m-edge k-uniform hypergraph has an r-cut whose size is $\\Omega(\\sqrt "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08462","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":""},"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":"1803.08462","created_at":"2026-05-17T23:42:03.221852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08462v3","created_at":"2026-05-17T23:42:03.221852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08462","created_at":"2026-05-17T23:42:03.221852+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4WNIE6LWFGE","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4WNIE6LWFGED43C","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4WNIE6L","created_at":"2026-05-18T12:32:22.470017+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/F4WNIE6LWFGED43C52XUS6MHCS","json":"https://pith.science/pith/F4WNIE6LWFGED43C52XUS6MHCS.json","graph_json":"https://pith.science/api/pith-number/F4WNIE6LWFGED43C52XUS6MHCS/graph.json","events_json":"https://pith.science/api/pith-number/F4WNIE6LWFGED43C52XUS6MHCS/events.json","paper":"https://pith.science/paper/F4WNIE6L"},"agent_actions":{"view_html":"https://pith.science/pith/F4WNIE6LWFGED43C52XUS6MHCS","download_json":"https://pith.science/pith/F4WNIE6LWFGED43C52XUS6MHCS.json","view_paper":"https://pith.science/paper/F4WNIE6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08462&json=true","fetch_graph":"https://pith.science/api/pith-number/F4WNIE6LWFGED43C52XUS6MHCS/graph.json","fetch_events":"https://pith.science/api/pith-number/F4WNIE6LWFGED43C52XUS6MHCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4WNIE6LWFGED43C52XUS6MHCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4WNIE6LWFGED43C52XUS6MHCS/action/storage_attestation","attest_author":"https://pith.science/pith/F4WNIE6LWFGED43C52XUS6MHCS/action/author_attestation","sign_citation":"https://pith.science/pith/F4WNIE6LWFGED43C52XUS6MHCS/action/citation_signature","submit_replication":"https://pith.science/pith/F4WNIE6LWFGED43C52XUS6MHCS/action/replication_record"}},"created_at":"2026-05-17T23:42:03.221852+00:00","updated_at":"2026-05-17T23:42:03.221852+00:00"}