{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZZY2K4EYY274DKDQFXSEKFJ2DA","short_pith_number":"pith:ZZY2K4EY","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"},"canonical_sha256":"ce71a57098c6bfc1a8702de445153a183da4f2b561934694aef29f7d329e624e","source":{"kind":"arxiv","id":"2605.16607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16607","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16607v1","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16607","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZZY2K4EYY274","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_16","alias_value":"ZZY2K4EYY274DKDQ","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_8","alias_value":"ZZY2K4EY","created_at":"2026-05-20T00:02:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZZY2K4EYY274DKDQFXSEKFJ2DA","target":"record","payload":{"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"},"canonical_sha256":"ce71a57098c6bfc1a8702de445153a183da4f2b561934694aef29f7d329e624e","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"},"source_kind":"arxiv","source_id":"2605.16607","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-20T00:02:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGueNlFWYLVrmMjD3V90Uj0BgxSP9XKVEs10vAHGuE+tnYygig03Cdjb33KHIWnryczbp2vKju58tn7RUYVvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:56.829358Z"},"content_sha256":"93263d2121765e1a921ee3ecf5dc420d5708fc1c8b71afb4816bbbff0c4cf170","schema_version":"1.0","event_id":"sha256:93263d2121765e1a921ee3ecf5dc420d5708fc1c8b71afb4816bbbff0c4cf170"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZZY2K4EYY274DKDQFXSEKFJ2DA","target":"graph","payload":{"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"},"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-20T00:02:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6vx9DFO6wPOYKsz6q4teCsgq3SM6GvgCy0PBtcdi9Xg1NDYGbWp4icPPGuV95hSYmTwxxlaR1viy0OGAJBzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:56.830268Z"},"content_sha256":"83726d044d2175860ab12912b859f8b05ac7303730f0eda5b61d230e65d93879","schema_version":"1.0","event_id":"sha256:83726d044d2175860ab12912b859f8b05ac7303730f0eda5b61d230e65d93879"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/bundle.json","state_url":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/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-05-30T20:03:56Z","links":{"resolver":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA","bundle":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/bundle.json","state":"https://pith.science/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZY2K4EYY274DKDQFXSEKFJ2DA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZZY2K4EYY274DKDQFXSEKFJ2DA","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":"10b4d1499250b30fc7f7d9961afd6e32816ae428e4f9547210b69aac53e8053b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T20:16:13Z","title_canon_sha256":"502810ea3e07de135457b7bf5dad88349b0dc80825aa142237c313e21f72b108"},"schema_version":"1.0","source":{"id":"2605.16607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16607","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16607v1","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16607","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZZY2K4EYY274","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_16","alias_value":"ZZY2K4EYY274DKDQ","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_8","alias_value":"ZZY2K4EY","created_at":"2026-05-20T00:02:32Z"}],"graph_snapshots":[{"event_id":"sha256:83726d044d2175860ab12912b859f8b05ac7303730f0eda5b61d230e65d93879","target":"graph","created_at":"2026-05-20T00:02:32Z","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":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.16607/integrity.json","findings":[],"snapshot_sha256":"a46fd52921679d6bf2f8b1667b31c6cf65e959f8391aff6d8ed8d66ae1cacaf1","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"D\\'aniel Dob\\'ak, Eion Mulrenin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T20:16:13Z","title":"Recursive upper bounds for the vertex online Ramsey game with applications to hypergraph Ramsey numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16607","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:93263d2121765e1a921ee3ecf5dc420d5708fc1c8b71afb4816bbbff0c4cf170","target":"record","created_at":"2026-05-20T00:02:32Z","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":"10b4d1499250b30fc7f7d9961afd6e32816ae428e4f9547210b69aac53e8053b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T20:16:13Z","title_canon_sha256":"502810ea3e07de135457b7bf5dad88349b0dc80825aa142237c313e21f72b108"},"schema_version":"1.0","source":{"id":"2605.16607","kind":"arxiv","version":1}},"canonical_sha256":"ce71a57098c6bfc1a8702de445153a183da4f2b561934694aef29f7d329e624e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce71a57098c6bfc1a8702de445153a183da4f2b561934694aef29f7d329e624e","first_computed_at":"2026-05-20T00:02:32.226580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:32.226580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y2j9ApXBwQOXzzmLvO50ueN1oSJ8Gayz+AIkhhky5mLqJ1G8FYG2unCjG2ByN9BiGgeYY+9NYiHiVEoJic/LDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:32.227529Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93263d2121765e1a921ee3ecf5dc420d5708fc1c8b71afb4816bbbff0c4cf170","sha256:83726d044d2175860ab12912b859f8b05ac7303730f0eda5b61d230e65d93879"],"state_sha256":"0a1bc9e66bec1c6e44733d7ff9737d3d70317f6124f300b8ddce7db84d6c8678"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWLL1+qOG/pDhIySrk/BmZLUcgSyaOGd5ons0SODS2R4T1ZX3i5shjoXQdhEoayhD+jIB5Dl4/HegKDXTwCFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:03:56.835191Z","bundle_sha256":"57ef6ad643397d17f86cdec132d1348621ee9740c1479f4a978003d071708dd5"}}