{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KIECMVKSBQJVT7UUGRA7N7A4W7","short_pith_number":"pith:KIECMVKS","schema_version":"1.0","canonical_sha256":"52082655520c1359fe943441f6fc1cb7c0c6fc18ec3e44d340d28afbce0f8dd3","source":{"kind":"arxiv","id":"1901.03671","version":1},"attestation_state":"computed","paper":{"title":"On Induced Online Ramsey Number of Paths, Cycles, and Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Pavel Dvo\\v{r}\\'ak, Tom\\'a\\v{s} Valla, V\\'aclav Bla\\v{z}ej","submitted_at":"2019-01-11T17:47:51Z","abstract_excerpt":"An online Ramsey game is a game between Builder and Painter, alternating in turns. They are given a graph $H$ and a graph $G$ of an infinite set of independent vertices. In each round Builder draws an edge and Painter colors it either red or blue. Builder wins if after some finite round there is a monochromatic copy of the graph $H$, otherwise Painter wins. The online Ramsey number $\\widetilde{r}(H)$ is the minimum number of rounds such that Builder can force a monochromatic copy of $H$ in $G$. This is an analogy to the size-Ramsey number $\\overline{r}(H)$ defined as the minimum number such th"},"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":"1901.03671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-01-11T17:47:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c8ad29932356364093076ff8d2aabc019e556edfba75065676f1966100fa7d8c","abstract_canon_sha256":"fdc8d41a297da57eefa461225913ebbdc01931bf7f1234dcbf1cf4712a116a3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.685797Z","signature_b64":"rD7ptEdCze1u0xHrHFJJ9pBKPMQqIkT6ScaeQOVfuWdftgGltXP2cYiDnyiqU69jbnAVcBO67ImETLhH1XfdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52082655520c1359fe943441f6fc1cb7c0c6fc18ec3e44d340d28afbce0f8dd3","last_reissued_at":"2026-05-17T23:56:30.685425Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.685425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Induced Online Ramsey Number of Paths, Cycles, and Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Pavel Dvo\\v{r}\\'ak, Tom\\'a\\v{s} Valla, V\\'aclav Bla\\v{z}ej","submitted_at":"2019-01-11T17:47:51Z","abstract_excerpt":"An online Ramsey game is a game between Builder and Painter, alternating in turns. They are given a graph $H$ and a graph $G$ of an infinite set of independent vertices. In each round Builder draws an edge and Painter colors it either red or blue. Builder wins if after some finite round there is a monochromatic copy of the graph $H$, otherwise Painter wins. The online Ramsey number $\\widetilde{r}(H)$ is the minimum number of rounds such that Builder can force a monochromatic copy of $H$ in $G$. This is an analogy to the size-Ramsey number $\\overline{r}(H)$ defined as the minimum number such th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03671","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":""},"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":"1901.03671","created_at":"2026-05-17T23:56:30.685482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03671v1","created_at":"2026-05-17T23:56:30.685482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03671","created_at":"2026-05-17T23:56:30.685482+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIECMVKSBQJV","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIECMVKSBQJVT7UU","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIECMVKS","created_at":"2026-05-18T12:33:21.387695+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/KIECMVKSBQJVT7UUGRA7N7A4W7","json":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7.json","graph_json":"https://pith.science/api/pith-number/KIECMVKSBQJVT7UUGRA7N7A4W7/graph.json","events_json":"https://pith.science/api/pith-number/KIECMVKSBQJVT7UUGRA7N7A4W7/events.json","paper":"https://pith.science/paper/KIECMVKS"},"agent_actions":{"view_html":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7","download_json":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7.json","view_paper":"https://pith.science/paper/KIECMVKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03671&json=true","fetch_graph":"https://pith.science/api/pith-number/KIECMVKSBQJVT7UUGRA7N7A4W7/graph.json","fetch_events":"https://pith.science/api/pith-number/KIECMVKSBQJVT7UUGRA7N7A4W7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/action/storage_attestation","attest_author":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/action/author_attestation","sign_citation":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/action/citation_signature","submit_replication":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/action/replication_record"}},"created_at":"2026-05-17T23:56:30.685482+00:00","updated_at":"2026-05-17T23:56:30.685482+00:00"}