{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IU3G3HLKKRDPL4R2FQ5LWKIELY","short_pith_number":"pith:IU3G3HLK","canonical_record":{"source":{"id":"1603.07570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T13:51:35Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"a3ac4a3e0405825144d35ef664afc65a4bf7235d7edd3d1fc10bdd304f290dae","abstract_canon_sha256":"6661494a629f5e630013e5ba5e1b6c347e1d7f9a4feda6fab66c753254ef325c"},"schema_version":"1.0"},"canonical_sha256":"45366d9d6a5446f5f23a2c3abb29045e34e2b68e41c5e9f4348d047e4bf69678","source":{"kind":"arxiv","id":"1603.07570","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07570","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07570v1","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07570","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"pith_short_12","alias_value":"IU3G3HLKKRDP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IU3G3HLKKRDPL4R2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IU3G3HLK","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IU3G3HLKKRDPL4R2FQ5LWKIELY","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T13:51:35Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"a3ac4a3e0405825144d35ef664afc65a4bf7235d7edd3d1fc10bdd304f290dae","abstract_canon_sha256":"6661494a629f5e630013e5ba5e1b6c347e1d7f9a4feda6fab66c753254ef325c"},"schema_version":"1.0"},"canonical_sha256":"45366d9d6a5446f5f23a2c3abb29045e34e2b68e41c5e9f4348d047e4bf69678","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:20.522587Z","signature_b64":"4duTwm3rPpiQj6q7IDaEgw/ghsG+abEBs/jNFJTkH3jKPliRkFyfskou2sCDnJ8Lxy0Nt4p4mpq3EAr/vw1aAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45366d9d6a5446f5f23a2c3abb29045e34e2b68e41c5e9f4348d047e4bf69678","last_reissued_at":"2026-05-18T01:18:20.522050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:20.522050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07570","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-18T01:18:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cjA5/d+ygScNsMpC4H+2nRggPfLS8uUZFrN47YE1N4ZUY9mtnMl6eGYFf9iC/tF9kqC4MdPE8ezi1Brr5q7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:04:10.863031Z"},"content_sha256":"1ca373f2b41d3a4e5d52dfedc08595e398a21ed2e8b66a999d979d34d6a642f0","schema_version":"1.0","event_id":"sha256:1ca373f2b41d3a4e5d52dfedc08595e398a21ed2e8b66a999d979d34d6a642f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IU3G3HLKKRDPL4R2FQ5LWKIELY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Ramsey Games for more than two colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Andreas Noever","submitted_at":"2016-03-24T13:51:35Z","abstract_excerpt":"Consider the following one-player game played on an initially empty graph with $n$ vertices. At each stage a randomly selected new edge is added and the player must immediately color the edge with one of $r$ available colors. Her objective is to color as many edges as possible without creating a monochromatic copy of a fixed graph $F$.\n  We use container and sparse regularity techniques to prove a tight upper bound on the typical duration of this game with an arbitrary, but fixed, number of colors for a family of $2$-balanced graphs. The bound confirms a conjecture of Marciniszyn, Sp\\\"ohel and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07570","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-18T01:18:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hg2V4x/IaC2kqaYli6GJrG0O2N0832wzBh1yHgug+jWVIRrD6BkilEcteJefzmA0Sh5eBZFEvWAJ7pSpP683Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:04:10.863770Z"},"content_sha256":"1d5c53233a3bea77b042abc92462aac370f38caa74fccb978c16662207dfd1a7","schema_version":"1.0","event_id":"sha256:1d5c53233a3bea77b042abc92462aac370f38caa74fccb978c16662207dfd1a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/bundle.json","state_url":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/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-25T17:04:10Z","links":{"resolver":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY","bundle":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/bundle.json","state":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IU3G3HLKKRDPL4R2FQ5LWKIELY","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":"6661494a629f5e630013e5ba5e1b6c347e1d7f9a4feda6fab66c753254ef325c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T13:51:35Z","title_canon_sha256":"a3ac4a3e0405825144d35ef664afc65a4bf7235d7edd3d1fc10bdd304f290dae"},"schema_version":"1.0","source":{"id":"1603.07570","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07570","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07570v1","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07570","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"pith_short_12","alias_value":"IU3G3HLKKRDP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IU3G3HLKKRDPL4R2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IU3G3HLK","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:1d5c53233a3bea77b042abc92462aac370f38caa74fccb978c16662207dfd1a7","target":"graph","created_at":"2026-05-18T01:18:20Z","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":"Consider the following one-player game played on an initially empty graph with $n$ vertices. At each stage a randomly selected new edge is added and the player must immediately color the edge with one of $r$ available colors. Her objective is to color as many edges as possible without creating a monochromatic copy of a fixed graph $F$.\n  We use container and sparse regularity techniques to prove a tight upper bound on the typical duration of this game with an arbitrary, but fixed, number of colors for a family of $2$-balanced graphs. The bound confirms a conjecture of Marciniszyn, Sp\\\"ohel and","authors_text":"Andreas Noever","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T13:51:35Z","title":"Online Ramsey Games for more than two colors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07570","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:1ca373f2b41d3a4e5d52dfedc08595e398a21ed2e8b66a999d979d34d6a642f0","target":"record","created_at":"2026-05-18T01:18:20Z","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":"6661494a629f5e630013e5ba5e1b6c347e1d7f9a4feda6fab66c753254ef325c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T13:51:35Z","title_canon_sha256":"a3ac4a3e0405825144d35ef664afc65a4bf7235d7edd3d1fc10bdd304f290dae"},"schema_version":"1.0","source":{"id":"1603.07570","kind":"arxiv","version":1}},"canonical_sha256":"45366d9d6a5446f5f23a2c3abb29045e34e2b68e41c5e9f4348d047e4bf69678","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45366d9d6a5446f5f23a2c3abb29045e34e2b68e41c5e9f4348d047e4bf69678","first_computed_at":"2026-05-18T01:18:20.522050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:20.522050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4duTwm3rPpiQj6q7IDaEgw/ghsG+abEBs/jNFJTkH3jKPliRkFyfskou2sCDnJ8Lxy0Nt4p4mpq3EAr/vw1aAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:20.522587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07570","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ca373f2b41d3a4e5d52dfedc08595e398a21ed2e8b66a999d979d34d6a642f0","sha256:1d5c53233a3bea77b042abc92462aac370f38caa74fccb978c16662207dfd1a7"],"state_sha256":"54bb8f5a4e46dda1590f2a6dea4dfba7ea3e47061dca1bba86a748ff9cd6c0c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aLeWjTbIrnhBjrd/aFXlK37M7iTnpK3Xqh3NwDDU8QJAY2x1YLnjkj9sDLkeK8lmqOjZK6AhEasTuk45K/OtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:04:10.867660Z","bundle_sha256":"00d2eea551c28f8b0cb75ba8441ad972cc6f5bfeeb4904d4b1a93bd7d007eebf"}}