{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:E7O2ZZLX6NQJ7TKNQZU77O2455","short_pith_number":"pith:E7O2ZZLX","schema_version":"1.0","canonical_sha256":"27ddace577f3609fcd4d8669ffbb5cef52f6d3425622be0c78f1818ec7e0a311","source":{"kind":"arxiv","id":"2202.14032","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2202.14032","created_at":"2026-07-05T06:52:42.866048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.14032v2","created_at":"2026-07-05T06:52:42.866048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.14032","created_at":"2026-07-05T06:52:42.866048+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7O2ZZLX6NQJ","created_at":"2026-07-05T06:52:42.866048+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7O2ZZLX6NQJ7TKN","created_at":"2026-07-05T06:52:42.866048+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7O2ZZLX","created_at":"2026-07-05T06:52:42.866048+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/E7O2ZZLX6NQJ7TKNQZU77O2455","json":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455.json","graph_json":"https://pith.science/api/pith-number/E7O2ZZLX6NQJ7TKNQZU77O2455/graph.json","events_json":"https://pith.science/api/pith-number/E7O2ZZLX6NQJ7TKNQZU77O2455/events.json","paper":"https://pith.science/paper/E7O2ZZLX"},"agent_actions":{"view_html":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455","download_json":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455.json","view_paper":"https://pith.science/paper/E7O2ZZLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.14032&json=true","fetch_graph":"https://pith.science/api/pith-number/E7O2ZZLX6NQJ7TKNQZU77O2455/graph.json","fetch_events":"https://pith.science/api/pith-number/E7O2ZZLX6NQJ7TKNQZU77O2455/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/action/storage_attestation","attest_author":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/action/author_attestation","sign_citation":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/action/citation_signature","submit_replication":"https://pith.science/pith/E7O2ZZLX6NQJ7TKNQZU77O2455/action/replication_record"}},"created_at":"2026-07-05T06:52:42.866048+00:00","updated_at":"2026-07-05T06:52:42.866048+00:00"}