{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7J5V5RC7GXJYUFOMSXQEZ7FM66","short_pith_number":"pith:7J5V5RC7","schema_version":"1.0","canonical_sha256":"fa7b5ec45f35d38a15cc95e04cfcacf7a1919c35a322e52643d37dda55adcadf","source":{"kind":"arxiv","id":"1201.0046","version":6},"attestation_state":"computed","paper":{"title":"On the game chromatic number of sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Mikhail Lavrov, Simi Haber","submitted_at":"2011-12-30T01:15:04Z","abstract_excerpt":"Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of $G$ are colored. The game chromatic number \\chi_g(G) is the minimum k for which the first player has a winning strategy. The paper \\cite{BFS} began the analysis of the asymptotic behavior of this parameter for a random graph G_{n,p}. This paper provides some further analysis for graphs with constant average degree i.e. np=O(1) and for random regular graphs."},"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":"1201.0046","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-30T01:15:04Z","cross_cats_sorted":[],"title_canon_sha256":"e7e7be97b69fa160de1705c8cfb294b7c87ebf829e254685ad8b8f0e72a569c1","abstract_canon_sha256":"1b6179832e5d93352040c878d05fea469b44028d2c6c44c10f2516552e23adb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:48.789562Z","signature_b64":"TLBieuSn56PBii20j24Wjx6mofniAf+oOhYoSlr8C0k0ju/L+XmIu3o7HiHk37AuSgum0Zc0hd+tn7jHW7jGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa7b5ec45f35d38a15cc95e04cfcacf7a1919c35a322e52643d37dda55adcadf","last_reissued_at":"2026-05-18T00:13:48.789088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:48.789088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the game chromatic number of sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Mikhail Lavrov, Simi Haber","submitted_at":"2011-12-30T01:15:04Z","abstract_excerpt":"Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of $G$ are colored. The game chromatic number \\chi_g(G) is the minimum k for which the first player has a winning strategy. The paper \\cite{BFS} began the analysis of the asymptotic behavior of this parameter for a random graph G_{n,p}. This paper provides some further analysis for graphs with constant average degree i.e. np=O(1) and for random regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0046","kind":"arxiv","version":6},"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":"1201.0046","created_at":"2026-05-18T00:13:48.789162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0046v6","created_at":"2026-05-18T00:13:48.789162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0046","created_at":"2026-05-18T00:13:48.789162+00:00"},{"alias_kind":"pith_short_12","alias_value":"7J5V5RC7GXJY","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7J5V5RC7GXJYUFOM","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7J5V5RC7","created_at":"2026-05-18T12:26:22.705136+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/7J5V5RC7GXJYUFOMSXQEZ7FM66","json":"https://pith.science/pith/7J5V5RC7GXJYUFOMSXQEZ7FM66.json","graph_json":"https://pith.science/api/pith-number/7J5V5RC7GXJYUFOMSXQEZ7FM66/graph.json","events_json":"https://pith.science/api/pith-number/7J5V5RC7GXJYUFOMSXQEZ7FM66/events.json","paper":"https://pith.science/paper/7J5V5RC7"},"agent_actions":{"view_html":"https://pith.science/pith/7J5V5RC7GXJYUFOMSXQEZ7FM66","download_json":"https://pith.science/pith/7J5V5RC7GXJYUFOMSXQEZ7FM66.json","view_paper":"https://pith.science/paper/7J5V5RC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0046&json=true","fetch_graph":"https://pith.science/api/pith-number/7J5V5RC7GXJYUFOMSXQEZ7FM66/graph.json","fetch_events":"https://pith.science/api/pith-number/7J5V5RC7GXJYUFOMSXQEZ7FM66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7J5V5RC7GXJYUFOMSXQEZ7FM66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7J5V5RC7GXJYUFOMSXQEZ7FM66/action/storage_attestation","attest_author":"https://pith.science/pith/7J5V5RC7GXJYUFOMSXQEZ7FM66/action/author_attestation","sign_citation":"https://pith.science/pith/7J5V5RC7GXJYUFOMSXQEZ7FM66/action/citation_signature","submit_replication":"https://pith.science/pith/7J5V5RC7GXJYUFOMSXQEZ7FM66/action/replication_record"}},"created_at":"2026-05-18T00:13:48.789162+00:00","updated_at":"2026-05-18T00:13:48.789162+00:00"}