{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CBI62YTTIXRZ2LZRIHRMPAUFRH","short_pith_number":"pith:CBI62YTT","schema_version":"1.0","canonical_sha256":"1051ed627345e39d2f3141e2c7828589c7f3dae1e46ee538f7bcadf267eb7b48","source":{"kind":"arxiv","id":"1406.7126","version":1},"attestation_state":"computed","paper":{"title":"The game chromatic number of dense random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelika Steger (Institute of Theoretical Computer Science, ETH Zurich), Ralph Keusch","submitted_at":"2014-06-27T09:39:18Z","abstract_excerpt":"Suppose that two players take turns coloring the vertices of a given graph G with k colors. In each move the current player colors a vertex such that neighboring vertices get different colors. The first player wins this game if and only if at the end, all the vertices are colored. The game chromatic number $\\chi_g(G)$ is defined as the smallest k for which the first player has a winning strategy.\n  Recently, Bohman, Frieze and Sudakov [Random Structures and Algorithms 2008] analysed the game chromatic number of random graphs and obtained lower and upper bounds of the same order of magnitude. I"},"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":"1406.7126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-27T09:39:18Z","cross_cats_sorted":[],"title_canon_sha256":"fbe1fbd117022d0866f54d50845ccebad49740c87544bab6a8793c26a520f59a","abstract_canon_sha256":"2c0dcf4c4d03a7455e3af86a6af2eb9cdfbe95ef3e47469a54c0a415c323ea80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:54.035900Z","signature_b64":"OMSxwliDQLQPp8yWFWukvmhWbUdZabswjKMG4WKLIK3g9WfE0oeOkixvmVlai50adi79wV5YHdH0E8NNlnm1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1051ed627345e39d2f3141e2c7828589c7f3dae1e46ee538f7bcadf267eb7b48","last_reissued_at":"2026-05-18T02:48:54.035291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:54.035291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The game chromatic number of dense random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelika Steger (Institute of Theoretical Computer Science, ETH Zurich), Ralph Keusch","submitted_at":"2014-06-27T09:39:18Z","abstract_excerpt":"Suppose that two players take turns coloring the vertices of a given graph G with k colors. In each move the current player colors a vertex such that neighboring vertices get different colors. The first player wins this game if and only if at the end, all the vertices are colored. The game chromatic number $\\chi_g(G)$ is defined as the smallest k for which the first player has a winning strategy.\n  Recently, Bohman, Frieze and Sudakov [Random Structures and Algorithms 2008] analysed the game chromatic number of random graphs and obtained lower and upper bounds of the same order of magnitude. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7126","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":"1406.7126","created_at":"2026-05-18T02:48:54.035411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7126v1","created_at":"2026-05-18T02:48:54.035411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7126","created_at":"2026-05-18T02:48:54.035411+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBI62YTTIXRZ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBI62YTTIXRZ2LZR","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBI62YTT","created_at":"2026-05-18T12:28:22.404517+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/CBI62YTTIXRZ2LZRIHRMPAUFRH","json":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH.json","graph_json":"https://pith.science/api/pith-number/CBI62YTTIXRZ2LZRIHRMPAUFRH/graph.json","events_json":"https://pith.science/api/pith-number/CBI62YTTIXRZ2LZRIHRMPAUFRH/events.json","paper":"https://pith.science/paper/CBI62YTT"},"agent_actions":{"view_html":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH","download_json":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH.json","view_paper":"https://pith.science/paper/CBI62YTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7126&json=true","fetch_graph":"https://pith.science/api/pith-number/CBI62YTTIXRZ2LZRIHRMPAUFRH/graph.json","fetch_events":"https://pith.science/api/pith-number/CBI62YTTIXRZ2LZRIHRMPAUFRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/action/storage_attestation","attest_author":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/action/author_attestation","sign_citation":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/action/citation_signature","submit_replication":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/action/replication_record"}},"created_at":"2026-05-18T02:48:54.035411+00:00","updated_at":"2026-05-18T02:48:54.035411+00:00"}