{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:57L5G6QWXN6GVNNLBH2KJWCZYZ","short_pith_number":"pith:57L5G6QW","canonical_record":{"source":{"id":"1907.07639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-17T16:53:55Z","cross_cats_sorted":[],"title_canon_sha256":"a990e5d71e5eeaf421809db66bff4dbe3a6c42924a9288ac2e535c90a0e98963","abstract_canon_sha256":"95180568ee6bc79cefc9bb617d38ff2d8b28c759a14f7434e2bc993476a92b8f"},"schema_version":"1.0"},"canonical_sha256":"efd7d37a16bb7c6ab5ab09f4a4d859c6528976f1d58a2482594e1cc0f3a9e2a5","source":{"kind":"arxiv","id":"1907.07639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07639","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07639v1","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07639","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"57L5G6QWXN6G","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"57L5G6QWXN6GVNNL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"57L5G6QW","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:57L5G6QWXN6GVNNLBH2KJWCZYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-17T16:53:55Z","cross_cats_sorted":[],"title_canon_sha256":"a990e5d71e5eeaf421809db66bff4dbe3a6c42924a9288ac2e535c90a0e98963","abstract_canon_sha256":"95180568ee6bc79cefc9bb617d38ff2d8b28c759a14f7434e2bc993476a92b8f"},"schema_version":"1.0"},"canonical_sha256":"efd7d37a16bb7c6ab5ab09f4a4d859c6528976f1d58a2482594e1cc0f3a9e2a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:21.477481Z","signature_b64":"Iiipvrc4LlbSL6jQO9pmPntBcHp8OHu+lQqfzQ/t13sG5ozLOnGvKDyLa4br+PDlCykfaU4ogP/6WqWjmyJwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd7d37a16bb7c6ab5ab09f4a4d859c6528976f1d58a2482594e1cc0f3a9e2a5","last_reissued_at":"2026-05-17T23:40:21.476804Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:21.476804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07639","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yta4u3Zb+pk4TorbwcaFSNgl7qVwp6xOhg+LpG38LdnqPz/yotWyl42fRn4kI0Ce6rDYtIX6hvQAT+iUSChoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:10:17.157653Z"},"content_sha256":"2185f1a9d7483eb7f4584d306b63825e9117a4f47cee333df9615b9e121d4f58","schema_version":"1.0","event_id":"sha256:2185f1a9d7483eb7f4584d306b63825e9117a4f47cee333df9615b9e121d4f58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:57L5G6QWXN6GVNNLBH2KJWCZYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tight Bound for Hyperaph Regularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Guy Moshkovitz","submitted_at":"2019-07-17T16:53:55Z","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.\n  We show that such Ackermann-type bounds are unavoidable for every $k \\ge 2$, thus confirming a prediction of Ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07639","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNLsDqO0puxdcl13B3/OGvH078E1P2IcsyJe/DRFsc29EIaDDhluq2CFIj25SfT6Ldjkf/DIQ3N4i1AA29NmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:10:17.158013Z"},"content_sha256":"c40b11de034b648db6bdc9acd87d147583dfaf77dc807d3384bc310112fe16be","schema_version":"1.0","event_id":"sha256:c40b11de034b648db6bdc9acd87d147583dfaf77dc807d3384bc310112fe16be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57L5G6QWXN6GVNNLBH2KJWCZYZ/bundle.json","state_url":"https://pith.science/pith/57L5G6QWXN6GVNNLBH2KJWCZYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57L5G6QWXN6GVNNLBH2KJWCZYZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T03:10:17Z","links":{"resolver":"https://pith.science/pith/57L5G6QWXN6GVNNLBH2KJWCZYZ","bundle":"https://pith.science/pith/57L5G6QWXN6GVNNLBH2KJWCZYZ/bundle.json","state":"https://pith.science/pith/57L5G6QWXN6GVNNLBH2KJWCZYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57L5G6QWXN6GVNNLBH2KJWCZYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:57L5G6QWXN6GVNNLBH2KJWCZYZ","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":"95180568ee6bc79cefc9bb617d38ff2d8b28c759a14f7434e2bc993476a92b8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-17T16:53:55Z","title_canon_sha256":"a990e5d71e5eeaf421809db66bff4dbe3a6c42924a9288ac2e535c90a0e98963"},"schema_version":"1.0","source":{"id":"1907.07639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07639","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07639v1","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07639","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"57L5G6QWXN6G","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"57L5G6QWXN6GVNNL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"57L5G6QW","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c40b11de034b648db6bdc9acd87d147583dfaf77dc807d3384bc310112fe16be","target":"graph","created_at":"2026-05-17T23:40:21Z","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"},"paper":{"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.\n  We show that such Ackermann-type bounds are unavoidable for every $k \\ge 2$, thus confirming a prediction of Ta","authors_text":"Asaf Shapira, Guy Moshkovitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-17T16:53:55Z","title":"A Tight Bound for Hyperaph Regularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07639","kind":"arxiv","version":1},"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:2185f1a9d7483eb7f4584d306b63825e9117a4f47cee333df9615b9e121d4f58","target":"record","created_at":"2026-05-17T23:40:21Z","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":"95180568ee6bc79cefc9bb617d38ff2d8b28c759a14f7434e2bc993476a92b8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-17T16:53:55Z","title_canon_sha256":"a990e5d71e5eeaf421809db66bff4dbe3a6c42924a9288ac2e535c90a0e98963"},"schema_version":"1.0","source":{"id":"1907.07639","kind":"arxiv","version":1}},"canonical_sha256":"efd7d37a16bb7c6ab5ab09f4a4d859c6528976f1d58a2482594e1cc0f3a9e2a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efd7d37a16bb7c6ab5ab09f4a4d859c6528976f1d58a2482594e1cc0f3a9e2a5","first_computed_at":"2026-05-17T23:40:21.476804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:21.476804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iiipvrc4LlbSL6jQO9pmPntBcHp8OHu+lQqfzQ/t13sG5ozLOnGvKDyLa4br+PDlCykfaU4ogP/6WqWjmyJwBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:21.477481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2185f1a9d7483eb7f4584d306b63825e9117a4f47cee333df9615b9e121d4f58","sha256:c40b11de034b648db6bdc9acd87d147583dfaf77dc807d3384bc310112fe16be"],"state_sha256":"21211c5ed31d8b8d896d0019257a703a7327d42604e9f4607fb82f978e4f8e90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XYn7WOEyXUrCyKIg9fftVQyp0RLoUCBTF7qvuLmtdaXGpkhVfwevH7sGT/E0Qb1eE7YaxItFuiJG/Vqjz+OCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:10:17.160348Z","bundle_sha256":"2c6ac3741b38a8aac7da06130f7225effbb7d44a5bab3159490c54879d572a95"}}