{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HORNYUWCVAVME4TV77W3XNLIRM","short_pith_number":"pith:HORNYUWC","schema_version":"1.0","canonical_sha256":"3ba2dc52c2a82ac27275ffedbbb5688b2cbc4ebc6b53fcc192036c6b18b7b185","source":{"kind":"arxiv","id":"1804.05511","version":2},"attestation_state":"computed","paper":{"title":"A Tight Bound for Hypergraph Regularity I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Guy Moshkovitz","submitted_at":"2018-04-16T06:12:58Z","abstract_excerpt":"The hypergraph regularity lemma -- the extension of Szemer\\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several (very different) proofs of this lemma, obtained by Gowers, by Nagle-R\\\"odl-Schacht-Skokan and by Tao. Unfortunately, what all these proofs have in common is that they yield regular partitions whose order is given by the $k$-th Ackermann function. We show that such Ackermann-type bounds are unavoidable for every $k \\ge 2$, thus confirming a prediction of Tao."},"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":"1804.05511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-16T06:12:58Z","cross_cats_sorted":[],"title_canon_sha256":"b552f0f339096206edcbba3466e5ce4ffda900dd78aba3b05f139fada6c079d5","abstract_canon_sha256":"615e39db785130927feabddc74c979f80699bb21a076e585c451d98b8d7ade7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:20.794670Z","signature_b64":"KH0CtIU7HmmG1xTeKyjLXMgvlQNJwUYMzXteX/JxPKqd5Trx6cntT4QmxVJzvv6MzVgN31zI8AH4IDWESsSXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba2dc52c2a82ac27275ffedbbb5688b2cbc4ebc6b53fcc192036c6b18b7b185","last_reissued_at":"2026-05-17T23:40:20.793937Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:20.793937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Bound for Hypergraph Regularity I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Guy Moshkovitz","submitted_at":"2018-04-16T06:12:58Z","abstract_excerpt":"The hypergraph regularity lemma -- the extension of Szemer\\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several (very different) proofs of this lemma, obtained by Gowers, by Nagle-R\\\"odl-Schacht-Skokan and by Tao. Unfortunately, what all these proofs have in common is that they yield regular partitions whose order is given by the $k$-th Ackermann function. We show that such Ackermann-type bounds are unavoidable for every $k \\ge 2$, thus confirming a prediction of Tao."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05511","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":""},"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":"1804.05511","created_at":"2026-05-17T23:40:20.794050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05511v2","created_at":"2026-05-17T23:40:20.794050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05511","created_at":"2026-05-17T23:40:20.794050+00:00"},{"alias_kind":"pith_short_12","alias_value":"HORNYUWCVAVM","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HORNYUWCVAVME4TV","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HORNYUWC","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07639","citing_title":"A Tight Bound for Hyperaph Regularity","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM","json":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM.json","graph_json":"https://pith.science/api/pith-number/HORNYUWCVAVME4TV77W3XNLIRM/graph.json","events_json":"https://pith.science/api/pith-number/HORNYUWCVAVME4TV77W3XNLIRM/events.json","paper":"https://pith.science/paper/HORNYUWC"},"agent_actions":{"view_html":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM","download_json":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM.json","view_paper":"https://pith.science/paper/HORNYUWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05511&json=true","fetch_graph":"https://pith.science/api/pith-number/HORNYUWCVAVME4TV77W3XNLIRM/graph.json","fetch_events":"https://pith.science/api/pith-number/HORNYUWCVAVME4TV77W3XNLIRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM/action/storage_attestation","attest_author":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM/action/author_attestation","sign_citation":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM/action/citation_signature","submit_replication":"https://pith.science/pith/HORNYUWCVAVME4TV77W3XNLIRM/action/replication_record"}},"created_at":"2026-05-17T23:40:20.794050+00:00","updated_at":"2026-05-17T23:40:20.794050+00:00"}