{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IU3G3HLKKRDPL4R2FQ5LWKIELY","short_pith_number":"pith:IU3G3HLK","schema_version":"1.0","canonical_sha256":"45366d9d6a5446f5f23a2c3abb29045e34e2b68e41c5e9f4348d047e4bf69678","source":{"kind":"arxiv","id":"1603.07570","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.07570","created_at":"2026-05-18T01:18:20.522119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07570v1","created_at":"2026-05-18T01:18:20.522119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07570","created_at":"2026-05-18T01:18:20.522119+00:00"},{"alias_kind":"pith_short_12","alias_value":"IU3G3HLKKRDP","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IU3G3HLKKRDPL4R2","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IU3G3HLK","created_at":"2026-05-18T12:30:22.444734+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/IU3G3HLKKRDPL4R2FQ5LWKIELY","json":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY.json","graph_json":"https://pith.science/api/pith-number/IU3G3HLKKRDPL4R2FQ5LWKIELY/graph.json","events_json":"https://pith.science/api/pith-number/IU3G3HLKKRDPL4R2FQ5LWKIELY/events.json","paper":"https://pith.science/paper/IU3G3HLK"},"agent_actions":{"view_html":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY","download_json":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY.json","view_paper":"https://pith.science/paper/IU3G3HLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07570&json=true","fetch_graph":"https://pith.science/api/pith-number/IU3G3HLKKRDPL4R2FQ5LWKIELY/graph.json","fetch_events":"https://pith.science/api/pith-number/IU3G3HLKKRDPL4R2FQ5LWKIELY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/action/storage_attestation","attest_author":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/action/author_attestation","sign_citation":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/action/citation_signature","submit_replication":"https://pith.science/pith/IU3G3HLKKRDPL4R2FQ5LWKIELY/action/replication_record"}},"created_at":"2026-05-18T01:18:20.522119+00:00","updated_at":"2026-05-18T01:18:20.522119+00:00"}