{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZZY2K4EYY274DKDQFXSEKFJ2DA","short_pith_number":"pith:ZZY2K4EY","schema_version":"1.0","canonical_sha256":"ce71a57098c6bfc1a8702de445153a183da4f2b561934694aef29f7d329e624e","source":{"kind":"arxiv","id":"2605.16607","version":1},"attestation_state":"computed","paper":{"title":"Recursive upper bounds for the vertex online Ramsey game with applications to hypergraph Ramsey numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Dob\\'ak, Eion Mulrenin","submitted_at":"2026-05-15T20:16:13Z","abstract_excerpt":"The classical recursive upper bound on hypergraph Ramsey numbers due to Erd\\H{o}s and Rado states that for $2 \\leq k < s \\leq t$,\n  \\[\n  r_k(s,t) \\leq 2^{\\binom{r_{k-1}(s-1,t-1)}{k-1}}.\n  \\]\n  In 2010, Conlon, Fox, and Sudakov introduced the so-called vertex online Ramsey numbers $\\tilde{r}(s,t)$ for graphs to obtain a quantitative improvement over this bound when $k=3$.\n  In this note, we show that the natural hypergraph generalization $\\tilde{r}_k(s,t)$ of the vertex online Ramsey numbers satisfy an improved recurrence\n  \\[\n  \\tilde{r}_k(s,t) \\leq 2^{(1+o(1))\\tilde{r}_{k-1}(s-1,t-1)}.\n  \\]\n "},"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":"2605.16607","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T20:16:13Z","cross_cats_sorted":[],"title_canon_sha256":"502810ea3e07de135457b7bf5dad88349b0dc80825aa142237c313e21f72b108","abstract_canon_sha256":"10b4d1499250b30fc7f7d9961afd6e32816ae428e4f9547210b69aac53e8053b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:32.227529Z","signature_b64":"Y2j9ApXBwQOXzzmLvO50ueN1oSJ8Gayz+AIkhhky5mLqJ1G8FYG2unCjG2ByN9BiGgeYY+9NYiHiVEoJic/LDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce71a57098c6bfc1a8702de445153a183da4f2b561934694aef29f7d329e624e","last_reissued_at":"2026-05-20T00:02:32.226580Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:32.226580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive upper bounds for the vertex online Ramsey game with applications to hypergraph Ramsey numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Dob\\'ak, Eion Mulrenin","submitted_at":"2026-05-15T20:16:13Z","abstract_excerpt":"The classical recursive upper bound on hypergraph Ramsey numbers due to Erd\\H{o}s and Rado states that for $2 \\leq k < s \\leq t$,\n  \\[\n  r_k(s,t) \\leq 2^{\\binom{r_{k-1}(s-1,t-1)}{k-1}}.\n  \\]\n  In 2010, Conlon, Fox, and Sudakov introduced the so-called vertex online Ramsey numbers $\\tilde{r}(s,t)$ for graphs to obtain a quantitative improvement over this bound when $k=3$.\n  In this note, we show that the natural hypergraph generalization $\\tilde{r}_k(s,t)$ of the vertex online Ramsey numbers satisfy an improved recurrence\n  \\[\n  \\tilde{r}_k(s,t) \\leq 2^{(1+o(1))\\tilde{r}_{k-1}(s-1,t-1)}.\n  \\]\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16607","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/2605.16607/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.800109Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.596866Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a46fd52921679d6bf2f8b1667b31c6cf65e959f8391aff6d8ed8d66ae1cacaf1"},"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":"2605.16607","created_at":"2026-05-20T00:02:32.226737+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16607v1","created_at":"2026-05-20T00:02:32.226737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16607","created_at":"2026-05-20T00:02:32.226737+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZY2K4EYY274","created_at":"2026-05-20T00:02:32.226737+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZY2K4EYY274DKDQ","created_at":"2026-05-20T00:02:32.226737+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZY2K4EY","created_at":"2026-05-20T00:02:32.226737+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/ZZY2K4EYY274DKDQFXSEKFJ2DA","json":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA.json","graph_json":"https://pith.science/api/pith-number/ZZY2K4EYY274DKDQFXSEKFJ2DA/graph.json","events_json":"https://pith.science/api/pith-number/ZZY2K4EYY274DKDQFXSEKFJ2DA/events.json","paper":"https://pith.science/paper/ZZY2K4EY"},"agent_actions":{"view_html":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA","download_json":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA.json","view_paper":"https://pith.science/paper/ZZY2K4EY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16607&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZY2K4EYY274DKDQFXSEKFJ2DA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZY2K4EYY274DKDQFXSEKFJ2DA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/action/storage_attestation","attest_author":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/action/author_attestation","sign_citation":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/action/citation_signature","submit_replication":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/action/replication_record"}},"created_at":"2026-05-20T00:02:32.226737+00:00","updated_at":"2026-05-20T00:02:32.226737+00:00"}