{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:E7O2ZZLX6NQJ7TKNQZU77O2455","short_pith_number":"pith:E7O2ZZLX","canonical_record":{"source":{"id":"2202.14032","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-28T18:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"3d44d136879109ec508077c8b63aa0d2edea990d5e759f51296e00c68cadb39d","abstract_canon_sha256":"0a1294b5a05152fec109a9b04da775efd085a2b52f9ffde3ffb0f67b17a71b93"},"schema_version":"1.0"},"canonical_sha256":"27ddace577f3609fcd4d8669ffbb5cef52f6d3425622be0c78f1818ec7e0a311","source":{"kind":"arxiv","id":"2202.14032","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.14032","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"2202.14032v2","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.14032","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"E7O2ZZLX6NQJ","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"pith_short_16","alias_value":"E7O2ZZLX6NQJ7TKN","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"pith_short_8","alias_value":"E7O2ZZLX","created_at":"2026-07-05T06:52:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:E7O2ZZLX6NQJ7TKNQZU77O2455","target":"record","payload":{"canonical_record":{"source":{"id":"2202.14032","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-28T18:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"3d44d136879109ec508077c8b63aa0d2edea990d5e759f51296e00c68cadb39d","abstract_canon_sha256":"0a1294b5a05152fec109a9b04da775efd085a2b52f9ffde3ffb0f67b17a71b93"},"schema_version":"1.0"},"canonical_sha256":"27ddace577f3609fcd4d8669ffbb5cef52f6d3425622be0c78f1818ec7e0a311","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:42.866597Z","signature_b64":"0SYP+WaMUyZB9DBgAv6VSQxXBiSv1vVeQkB/LhGYYMccqzfZzvStRvqPePKpnsNhkWr6+3G7XNXEadIULTw8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27ddace577f3609fcd4d8669ffbb5cef52f6d3425622be0c78f1818ec7e0a311","last_reissued_at":"2026-07-05T06:52:42.865966Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:42.865966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.14032","source_version":2,"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-07-05T06:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSv0zOu0wh8wEj3KMKXyCopkOnL2azKeCmZykAvzc5+9kuWvQkTcpyVARkhJz2vrK1gJdnVOg6hXrF6+cFGZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:49:04.083370Z"},"content_sha256":"1502f32e45f9108c9d3bccbb4b3cdb33a61486924176d8c1fe2cd01eed606577","schema_version":"1.0","event_id":"sha256:1502f32e45f9108c9d3bccbb4b3cdb33a61486924176d8c1fe2cd01eed606577"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:E7O2ZZLX6NQJ7TKNQZU77O2455","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tower Gaps in Multicolour Ramsey Numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Corrine Yap, Eoin Hurley, Quentin Dubroff","submitted_at":"2022-02-28T18:56:19Z","abstract_excerpt":"Resolving a problem of Conlon, Fox, and R\\\"{o}dl, we construct a family of hypergraphs with arbitrarily large tower height separation between their $2$-colour and $q$-colour Ramsey numbers. The main lemma underlying this construction is a new variant of the Erd\\H{o}s--Hajnal stepping-up lemma for a generalized Ramsey number $r_k(t;q,p)$, which we define as the smallest integer $n$ such that every $q$-colouring of the $k$-sets on $n$ vertices contains a set of $t$ vertices spanning fewer than $p$ colours. Our results provide the first tower-type lower bounds on these numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.14032","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.14032/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"},"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-07-05T06:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7yJSkYNkhdfOt8MKQ+ku9e0wmDsmbRO6yi3SqkuDWEHd1CIcjvhUThvfgQogrLMyRgXMxZ8t1afP2mLjJrHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:49:04.083749Z"},"content_sha256":"b0236f83d9e030f851b302c4c338445a99383dd7c8e09153abf819d1818058be","schema_version":"1.0","event_id":"sha256:b0236f83d9e030f851b302c4c338445a99383dd7c8e09153abf819d1818058be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/bundle.json","state_url":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/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-07-06T20:49:04Z","links":{"resolver":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455","bundle":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/bundle.json","state":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:E7O2ZZLX6NQJ7TKNQZU77O2455","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":"0a1294b5a05152fec109a9b04da775efd085a2b52f9ffde3ffb0f67b17a71b93","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-28T18:56:19Z","title_canon_sha256":"3d44d136879109ec508077c8b63aa0d2edea990d5e759f51296e00c68cadb39d"},"schema_version":"1.0","source":{"id":"2202.14032","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.14032","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"2202.14032v2","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.14032","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"E7O2ZZLX6NQJ","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"pith_short_16","alias_value":"E7O2ZZLX6NQJ7TKN","created_at":"2026-07-05T06:52:42Z"},{"alias_kind":"pith_short_8","alias_value":"E7O2ZZLX","created_at":"2026-07-05T06:52:42Z"}],"graph_snapshots":[{"event_id":"sha256:b0236f83d9e030f851b302c4c338445a99383dd7c8e09153abf819d1818058be","target":"graph","created_at":"2026-07-05T06:52:42Z","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/2202.14032/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Resolving a problem of Conlon, Fox, and R\\\"{o}dl, we construct a family of hypergraphs with arbitrarily large tower height separation between their $2$-colour and $q$-colour Ramsey numbers. The main lemma underlying this construction is a new variant of the Erd\\H{o}s--Hajnal stepping-up lemma for a generalized Ramsey number $r_k(t;q,p)$, which we define as the smallest integer $n$ such that every $q$-colouring of the $k$-sets on $n$ vertices contains a set of $t$ vertices spanning fewer than $p$ colours. Our results provide the first tower-type lower bounds on these numbers.","authors_text":"Ant\\'onio Gir\\~ao, Corrine Yap, Eoin Hurley, Quentin Dubroff","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-28T18:56:19Z","title":"Tower Gaps in Multicolour Ramsey Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.14032","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:1502f32e45f9108c9d3bccbb4b3cdb33a61486924176d8c1fe2cd01eed606577","target":"record","created_at":"2026-07-05T06:52:42Z","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":"0a1294b5a05152fec109a9b04da775efd085a2b52f9ffde3ffb0f67b17a71b93","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-28T18:56:19Z","title_canon_sha256":"3d44d136879109ec508077c8b63aa0d2edea990d5e759f51296e00c68cadb39d"},"schema_version":"1.0","source":{"id":"2202.14032","kind":"arxiv","version":2}},"canonical_sha256":"27ddace577f3609fcd4d8669ffbb5cef52f6d3425622be0c78f1818ec7e0a311","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27ddace577f3609fcd4d8669ffbb5cef52f6d3425622be0c78f1818ec7e0a311","first_computed_at":"2026-07-05T06:52:42.865966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:52:42.865966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0SYP+WaMUyZB9DBgAv6VSQxXBiSv1vVeQkB/LhGYYMccqzfZzvStRvqPePKpnsNhkWr6+3G7XNXEadIULTw8AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:52:42.866597Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.14032","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1502f32e45f9108c9d3bccbb4b3cdb33a61486924176d8c1fe2cd01eed606577","sha256:b0236f83d9e030f851b302c4c338445a99383dd7c8e09153abf819d1818058be"],"state_sha256":"3734c8b34876d6b1dbf70b7d2e72b0a8753062626df015c310a247f6b890c8ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fT0oTRUVsHVTLn8qQFSEHK2Q3DgKfY5M+qbLoKz52JmlMAISMQKSQk6SRJD6JcJyJHL2UqRW71tuTJSeqlLeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:49:04.085716Z","bundle_sha256":"7a5e3cc0e34ff47c914082f36bda0cc8f254cf06bdab24de5c67ef8061765414"}}