{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KIECMVKSBQJVT7UUGRA7N7A4W7","short_pith_number":"pith:KIECMVKS","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"},"canonical_sha256":"52082655520c1359fe943441f6fc1cb7c0c6fc18ec3e44d340d28afbce0f8dd3","source":{"kind":"arxiv","id":"1901.03671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03671","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03671v1","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03671","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"KIECMVKSBQJV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KIECMVKSBQJVT7UU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KIECMVKS","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KIECMVKSBQJVT7UUGRA7N7A4W7","target":"record","payload":{"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"},"canonical_sha256":"52082655520c1359fe943441f6fc1cb7c0c6fc18ec3e44d340d28afbce0f8dd3","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"},"source_kind":"arxiv","source_id":"1901.03671","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-17T23:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+aXhGB6txKunn4mWvfLRxD2JZZXuu7EVmEI/f4vnJnbE+lpqwJx83SSGqkpCMIxkcywnwoEE3S6HKgIZzIH/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:53:25.112944Z"},"content_sha256":"52ee126014579b358ef737e5455307ce666736b03a37f14f1406bc69650cc104","schema_version":"1.0","event_id":"sha256:52ee126014579b358ef737e5455307ce666736b03a37f14f1406bc69650cc104"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KIECMVKSBQJVT7UUGRA7N7A4W7","target":"graph","payload":{"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"},"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-17T23:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VoI3KijhjJ2qiT2lBoSSqX9puUd7Gy2JL9w6309SWutC6F2jXrq+bj8WTHMhLf761mGRRREjQKPB0k91i2/NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:53:25.113499Z"},"content_sha256":"38948b9e1211328e95144b6f07cb8ec78e370378862de68e8a26c9e8b9453b99","schema_version":"1.0","event_id":"sha256:38948b9e1211328e95144b6f07cb8ec78e370378862de68e8a26c9e8b9453b99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/bundle.json","state_url":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/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-31T10:53:25Z","links":{"resolver":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7","bundle":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/bundle.json","state":"https://pith.science/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIECMVKSBQJVT7UUGRA7N7A4W7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KIECMVKSBQJVT7UUGRA7N7A4W7","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":"fdc8d41a297da57eefa461225913ebbdc01931bf7f1234dcbf1cf4712a116a3d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-01-11T17:47:51Z","title_canon_sha256":"c8ad29932356364093076ff8d2aabc019e556edfba75065676f1966100fa7d8c"},"schema_version":"1.0","source":{"id":"1901.03671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03671","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03671v1","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03671","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"KIECMVKSBQJV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KIECMVKSBQJVT7UU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KIECMVKS","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:38948b9e1211328e95144b6f07cb8ec78e370378862de68e8a26c9e8b9453b99","target":"graph","created_at":"2026-05-17T23:56:30Z","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"},"paper":{"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","authors_text":"Pavel Dvo\\v{r}\\'ak, Tom\\'a\\v{s} Valla, V\\'aclav Bla\\v{z}ej","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-01-11T17:47:51Z","title":"On Induced Online Ramsey Number of Paths, Cycles, and Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03671","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:52ee126014579b358ef737e5455307ce666736b03a37f14f1406bc69650cc104","target":"record","created_at":"2026-05-17T23:56:30Z","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":"fdc8d41a297da57eefa461225913ebbdc01931bf7f1234dcbf1cf4712a116a3d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-01-11T17:47:51Z","title_canon_sha256":"c8ad29932356364093076ff8d2aabc019e556edfba75065676f1966100fa7d8c"},"schema_version":"1.0","source":{"id":"1901.03671","kind":"arxiv","version":1}},"canonical_sha256":"52082655520c1359fe943441f6fc1cb7c0c6fc18ec3e44d340d28afbce0f8dd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52082655520c1359fe943441f6fc1cb7c0c6fc18ec3e44d340d28afbce0f8dd3","first_computed_at":"2026-05-17T23:56:30.685425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:30.685425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rD7ptEdCze1u0xHrHFJJ9pBKPMQqIkT6ScaeQOVfuWdftgGltXP2cYiDnyiqU69jbnAVcBO67ImETLhH1XfdDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:30.685797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52ee126014579b358ef737e5455307ce666736b03a37f14f1406bc69650cc104","sha256:38948b9e1211328e95144b6f07cb8ec78e370378862de68e8a26c9e8b9453b99"],"state_sha256":"7207e2aaa33b17ca2c8d89e0c85a67ea52a8a3954d1b09ba1c01bfbf1889b349"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWtvaAYW/XVUxxwt3JQC4eM3FFFLFXzLUyEllQhtrMRzCvGpkxB78PuJ7DubdPY99Bpx74gCWLgjIUN4BbV/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:53:25.117465Z","bundle_sha256":"125349af2f4a205cf449e6be0e76cd18a7572dfd5091e4990900f7c6ac976581"}}