{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MWMS7XIH44JNURNBZR7GSGIMIG","short_pith_number":"pith:MWMS7XIH","schema_version":"1.0","canonical_sha256":"65992fdd07e712da45a1cc7e69190c419816827bdb11e7a08cfb8ee0331b4e99","source":{"kind":"arxiv","id":"2606.24198","version":1},"attestation_state":"computed","paper":{"title":"New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Hanzhi Bai, Longma Du, Ruilong Liu, Xinyu Hu","submitted_at":"2026-06-23T06:36:28Z","abstract_excerpt":"The Ramsey number $r_k(s,m)$ is the smallest $N$ such that any red/blue coloring of the $k$-subsets of $[N]$ contains a red $s$-set or a blue $m$-set. For fixed $k$ and $s$, and for sufficiently large $m$, the tower growth rate is determined by the stepping-up lemma, but for $s=m=k+1$ the available stepping-up lemmas do not apply. Fox asked for estimates of $r_k(k+1,k+1)$. Pudl\\'ak, R\\\"odl, and Wesley gave the first tower-type bound: $r_k(k+1,k+1)\\ge s_3(\\lfloor k/4\\rfloor)\\ge 4\\operatorname{twr}_{\\lfloor k/4\\rfloor-4}(2)$, where $s_3(k)$ is the $3$-color shift number and $\\operatorname{twr}_1"},"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":"2606.24198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T06:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"1de2ac6b5bf15dae3b0c96f87bf3e733f1359ada2b2d3eebc16530f436c359a2","abstract_canon_sha256":"accc9987b57deca2eb70dba83860d0de9a28e23bafc353e3d4bdffe53b6602a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:45.553128Z","signature_b64":"f86zpvILcJS3FvkIucmF5JJwHTXoBaHcKCHb36VI9EWWUGWSL/wiX8CJq0dLMTpsS61cVGoyoQTYdFvuIL4NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65992fdd07e712da45a1cc7e69190c419816827bdb11e7a08cfb8ee0331b4e99","last_reissued_at":"2026-06-24T01:14:45.552276Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:45.552276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Hanzhi Bai, Longma Du, Ruilong Liu, Xinyu Hu","submitted_at":"2026-06-23T06:36:28Z","abstract_excerpt":"The Ramsey number $r_k(s,m)$ is the smallest $N$ such that any red/blue coloring of the $k$-subsets of $[N]$ contains a red $s$-set or a blue $m$-set. For fixed $k$ and $s$, and for sufficiently large $m$, the tower growth rate is determined by the stepping-up lemma, but for $s=m=k+1$ the available stepping-up lemmas do not apply. Fox asked for estimates of $r_k(k+1,k+1)$. Pudl\\'ak, R\\\"odl, and Wesley gave the first tower-type bound: $r_k(k+1,k+1)\\ge s_3(\\lfloor k/4\\rfloor)\\ge 4\\operatorname{twr}_{\\lfloor k/4\\rfloor-4}(2)$, where $s_3(k)$ is the $3$-color shift number and $\\operatorname{twr}_1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24198","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/2606.24198/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":"2606.24198","created_at":"2026-06-24T01:14:45.552424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24198v1","created_at":"2026-06-24T01:14:45.552424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24198","created_at":"2026-06-24T01:14:45.552424+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWMS7XIH44JN","created_at":"2026-06-24T01:14:45.552424+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWMS7XIH44JNURNB","created_at":"2026-06-24T01:14:45.552424+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWMS7XIH","created_at":"2026-06-24T01:14:45.552424+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/MWMS7XIH44JNURNBZR7GSGIMIG","json":"https://pith.science/pith/MWMS7XIH44JNURNBZR7GSGIMIG.json","graph_json":"https://pith.science/api/pith-number/MWMS7XIH44JNURNBZR7GSGIMIG/graph.json","events_json":"https://pith.science/api/pith-number/MWMS7XIH44JNURNBZR7GSGIMIG/events.json","paper":"https://pith.science/paper/MWMS7XIH"},"agent_actions":{"view_html":"https://pith.science/pith/MWMS7XIH44JNURNBZR7GSGIMIG","download_json":"https://pith.science/pith/MWMS7XIH44JNURNBZR7GSGIMIG.json","view_paper":"https://pith.science/paper/MWMS7XIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24198&json=true","fetch_graph":"https://pith.science/api/pith-number/MWMS7XIH44JNURNBZR7GSGIMIG/graph.json","fetch_events":"https://pith.science/api/pith-number/MWMS7XIH44JNURNBZR7GSGIMIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWMS7XIH44JNURNBZR7GSGIMIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWMS7XIH44JNURNBZR7GSGIMIG/action/storage_attestation","attest_author":"https://pith.science/pith/MWMS7XIH44JNURNBZR7GSGIMIG/action/author_attestation","sign_citation":"https://pith.science/pith/MWMS7XIH44JNURNBZR7GSGIMIG/action/citation_signature","submit_replication":"https://pith.science/pith/MWMS7XIH44JNURNBZR7GSGIMIG/action/replication_record"}},"created_at":"2026-06-24T01:14:45.552424+00:00","updated_at":"2026-06-24T01:14:45.552424+00:00"}