{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7J5V5RC7GXJYUFOMSXQEZ7FM66","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":"1b6179832e5d93352040c878d05fea469b44028d2c6c44c10f2516552e23adb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-30T01:15:04Z","title_canon_sha256":"e7e7be97b69fa160de1705c8cfb294b7c87ebf829e254685ad8b8f0e72a569c1"},"schema_version":"1.0","source":{"id":"1201.0046","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0046","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0046v6","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0046","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"7J5V5RC7GXJY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7J5V5RC7GXJYUFOM","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7J5V5RC7","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:409fa7ee9ac3a9b662ef3750febfe182bbd3f3504a6b201cda199978e61c9656","target":"graph","created_at":"2026-05-18T00:13:48Z","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":"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.","authors_text":"Alan Frieze, Mikhail Lavrov, Simi Haber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-30T01:15:04Z","title":"On the game chromatic number of sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0046","kind":"arxiv","version":6},"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:e1f8f60b641b5377482a9e70ff7fbc1bfdcc99185880324769ca1f35ccc16599","target":"record","created_at":"2026-05-18T00:13:48Z","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":"1b6179832e5d93352040c878d05fea469b44028d2c6c44c10f2516552e23adb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-30T01:15:04Z","title_canon_sha256":"e7e7be97b69fa160de1705c8cfb294b7c87ebf829e254685ad8b8f0e72a569c1"},"schema_version":"1.0","source":{"id":"1201.0046","kind":"arxiv","version":6}},"canonical_sha256":"fa7b5ec45f35d38a15cc95e04cfcacf7a1919c35a322e52643d37dda55adcadf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa7b5ec45f35d38a15cc95e04cfcacf7a1919c35a322e52643d37dda55adcadf","first_computed_at":"2026-05-18T00:13:48.789088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:48.789088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TLBieuSn56PBii20j24Wjx6mofniAf+oOhYoSlr8C0k0ju/L+XmIu3o7HiHk37AuSgum0Zc0hd+tn7jHW7jGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:48.789562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0046","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1f8f60b641b5377482a9e70ff7fbc1bfdcc99185880324769ca1f35ccc16599","sha256:409fa7ee9ac3a9b662ef3750febfe182bbd3f3504a6b201cda199978e61c9656"],"state_sha256":"e0d8265b3b6e45dd8b5a81a77df8559c702948d42567ca67faf9f8c85f459ce9"}