{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CBI62YTTIXRZ2LZRIHRMPAUFRH","short_pith_number":"pith:CBI62YTT","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"},"canonical_sha256":"1051ed627345e39d2f3141e2c7828589c7f3dae1e46ee538f7bcadf267eb7b48","source":{"kind":"arxiv","id":"1406.7126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7126","created_at":"2026-05-18T02:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7126v1","created_at":"2026-05-18T02:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7126","created_at":"2026-05-18T02:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"CBI62YTTIXRZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CBI62YTTIXRZ2LZR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CBI62YTT","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CBI62YTTIXRZ2LZRIHRMPAUFRH","target":"record","payload":{"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"},"canonical_sha256":"1051ed627345e39d2f3141e2c7828589c7f3dae1e46ee538f7bcadf267eb7b48","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"},"source_kind":"arxiv","source_id":"1406.7126","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-18T02:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzbQDSMEffHvqT7wo8k4BUr0my46ZRn1nc1T7DOPHqS48IeR1yfn3WkWSeUrYoBeKt1RMhR88qmDPzQqsI4KCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:24:37.398444Z"},"content_sha256":"f1997e99907b23a04d23cc5e6e0b38a74583838a82fe3acd5f14e5a1153da412","schema_version":"1.0","event_id":"sha256:f1997e99907b23a04d23cc5e6e0b38a74583838a82fe3acd5f14e5a1153da412"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CBI62YTTIXRZ2LZRIHRMPAUFRH","target":"graph","payload":{"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"},"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-18T02:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENEelugozjZFQN6bo4xy8Z5iKMb24j+eBLlM0PNnHgU1P4SmPaeMo1HWZ9aR35Canwq4ioFxGcgB450g9yipBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:24:37.399159Z"},"content_sha256":"bddb84b632de105785a1f36e5ee0817c70f846f81a7af58860e486fb5b4494de","schema_version":"1.0","event_id":"sha256:bddb84b632de105785a1f36e5ee0817c70f846f81a7af58860e486fb5b4494de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/bundle.json","state_url":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/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-06-08T06:24:37Z","links":{"resolver":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH","bundle":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/bundle.json","state":"https://pith.science/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBI62YTTIXRZ2LZRIHRMPAUFRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CBI62YTTIXRZ2LZRIHRMPAUFRH","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":"2c0dcf4c4d03a7455e3af86a6af2eb9cdfbe95ef3e47469a54c0a415c323ea80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-27T09:39:18Z","title_canon_sha256":"fbe1fbd117022d0866f54d50845ccebad49740c87544bab6a8793c26a520f59a"},"schema_version":"1.0","source":{"id":"1406.7126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7126","created_at":"2026-05-18T02:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7126v1","created_at":"2026-05-18T02:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7126","created_at":"2026-05-18T02:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"CBI62YTTIXRZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CBI62YTTIXRZ2LZR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CBI62YTT","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:bddb84b632de105785a1f36e5ee0817c70f846f81a7af58860e486fb5b4494de","target":"graph","created_at":"2026-05-18T02:48:54Z","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":"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","authors_text":"Angelika Steger (Institute of Theoretical Computer Science, ETH Zurich), Ralph Keusch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-27T09:39:18Z","title":"The game chromatic number of dense random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7126","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:f1997e99907b23a04d23cc5e6e0b38a74583838a82fe3acd5f14e5a1153da412","target":"record","created_at":"2026-05-18T02:48:54Z","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":"2c0dcf4c4d03a7455e3af86a6af2eb9cdfbe95ef3e47469a54c0a415c323ea80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-27T09:39:18Z","title_canon_sha256":"fbe1fbd117022d0866f54d50845ccebad49740c87544bab6a8793c26a520f59a"},"schema_version":"1.0","source":{"id":"1406.7126","kind":"arxiv","version":1}},"canonical_sha256":"1051ed627345e39d2f3141e2c7828589c7f3dae1e46ee538f7bcadf267eb7b48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1051ed627345e39d2f3141e2c7828589c7f3dae1e46ee538f7bcadf267eb7b48","first_computed_at":"2026-05-18T02:48:54.035291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:54.035291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OMSxwliDQLQPp8yWFWukvmhWbUdZabswjKMG4WKLIK3g9WfE0oeOkixvmVlai50adi79wV5YHdH0E8NNlnm1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:54.035900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1997e99907b23a04d23cc5e6e0b38a74583838a82fe3acd5f14e5a1153da412","sha256:bddb84b632de105785a1f36e5ee0817c70f846f81a7af58860e486fb5b4494de"],"state_sha256":"f90e3ae43b3cb9592d0f44289775cab5a68d18bdc4561014ac8070897e104ae6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tc9iE+rE9LTgR2f84exNkXM9Df5IuSvzjD+vUMmUXOh3d5GLZvRql3ph31VOZvDKec+x4aNNaUQXOV5h1P/MAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:24:37.403471Z","bundle_sha256":"b0e3c5b26b6ff61e3842feb05bc4528f60bf72f0edaa76291982f110be737ec9"}}