{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4K7J2IFJK2GMIP7WGFHBQLNCVA","short_pith_number":"pith:4K7J2IFJ","schema_version":"1.0","canonical_sha256":"e2be9d20a9568cc43ff6314e182da2a8245015a82bbd776f1a397922cf2292f5","source":{"kind":"arxiv","id":"2508.09969","version":1},"attestation_state":"computed","paper":{"title":"Regularity for hypergraphs with bounded VC$_2$ dimension","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Lior Gishboliner, Yuval Wigderson","submitted_at":"2025-08-13T17:36:13Z","abstract_excerpt":"While Szemer\\'edi's graph regularity lemma is an indispensable tool for studying extremal problems in graph theory, using it comes with a hefty price, since a worst-case graph may only have regular partitions of tower-type size. It is thus sensible to ask if there is some natural restriction which forces graphs to have much smaller regular partitions. A celebrated result of this type, due to Alon-Fischer-Newman and Lov\\'asz-Szegedy, states that for graphs of bounded VC dimension, one can reduce the tower-type bounds to polynomial.\n  The graph regularity lemma has been extended to the setting o"},"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":"2508.09969","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-13T17:36:13Z","cross_cats_sorted":[],"title_canon_sha256":"96dbef67004dc5a1864c0a1b5bcae61bcb16d8665675421c721525475901cd25","abstract_canon_sha256":"51a4bdff406d1b66b71a73e63a3f81eb7005d6ba28b862de2b3ce9efd8edd6fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:25.845029Z","signature_b64":"W+jWRLRtVQhjYD/jaHExm2SermC3VeqQu25GtDONIYPuL7yzt47qjTxOD/3/RT+Ez1mNZ4ZmPk3OjjrT/AhwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2be9d20a9568cc43ff6314e182da2a8245015a82bbd776f1a397922cf2292f5","last_reissued_at":"2026-07-05T11:53:25.844516Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:25.844516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularity for hypergraphs with bounded VC$_2$ dimension","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Lior Gishboliner, Yuval Wigderson","submitted_at":"2025-08-13T17:36:13Z","abstract_excerpt":"While Szemer\\'edi's graph regularity lemma is an indispensable tool for studying extremal problems in graph theory, using it comes with a hefty price, since a worst-case graph may only have regular partitions of tower-type size. It is thus sensible to ask if there is some natural restriction which forces graphs to have much smaller regular partitions. A celebrated result of this type, due to Alon-Fischer-Newman and Lov\\'asz-Szegedy, states that for graphs of bounded VC dimension, one can reduce the tower-type bounds to polynomial.\n  The graph regularity lemma has been extended to the setting o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09969","kind":"arxiv","version":1},"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/2508.09969/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":"2508.09969","created_at":"2026-07-05T11:53:25.844579+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.09969v1","created_at":"2026-07-05T11:53:25.844579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09969","created_at":"2026-07-05T11:53:25.844579+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K7J2IFJK2GM","created_at":"2026-07-05T11:53:25.844579+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K7J2IFJK2GMIP7W","created_at":"2026-07-05T11:53:25.844579+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K7J2IFJ","created_at":"2026-07-05T11:53:25.844579+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04714","citing_title":"On n-distality, n-triviality and hypergraph regularity in NIP theories","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA","json":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA.json","graph_json":"https://pith.science/api/pith-number/4K7J2IFJK2GMIP7WGFHBQLNCVA/graph.json","events_json":"https://pith.science/api/pith-number/4K7J2IFJK2GMIP7WGFHBQLNCVA/events.json","paper":"https://pith.science/paper/4K7J2IFJ"},"agent_actions":{"view_html":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA","download_json":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA.json","view_paper":"https://pith.science/paper/4K7J2IFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.09969&json=true","fetch_graph":"https://pith.science/api/pith-number/4K7J2IFJK2GMIP7WGFHBQLNCVA/graph.json","fetch_events":"https://pith.science/api/pith-number/4K7J2IFJK2GMIP7WGFHBQLNCVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA/action/storage_attestation","attest_author":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA/action/author_attestation","sign_citation":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA/action/citation_signature","submit_replication":"https://pith.science/pith/4K7J2IFJK2GMIP7WGFHBQLNCVA/action/replication_record"}},"created_at":"2026-07-05T11:53:25.844579+00:00","updated_at":"2026-07-05T11:53:25.844579+00:00"}