{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IBRRE7ETIIJ5P4CKX2PVKL2SLV","short_pith_number":"pith:IBRRE7ET","canonical_record":{"source":{"id":"1902.03130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T20:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"9852ddcdff4d8f13928146735772fa70ec2782dbb8e66bc11fbbd9392185f757","abstract_canon_sha256":"17a4a51b04addebbea2ad6a65426add9950180fd4f43c615625dc50ebe2dfcd0"},"schema_version":"1.0"},"canonical_sha256":"4063127c934213d7f04abe9f552f525d708a139cf956e0e45bfe2b718075f7d6","source":{"kind":"arxiv","id":"1902.03130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03130","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03130v1","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03130","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"IBRRE7ETIIJ5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBRRE7ETIIJ5P4CK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBRRE7ET","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IBRRE7ETIIJ5P4CKX2PVKL2SLV","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T20:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"9852ddcdff4d8f13928146735772fa70ec2782dbb8e66bc11fbbd9392185f757","abstract_canon_sha256":"17a4a51b04addebbea2ad6a65426add9950180fd4f43c615625dc50ebe2dfcd0"},"schema_version":"1.0"},"canonical_sha256":"4063127c934213d7f04abe9f552f525d708a139cf956e0e45bfe2b718075f7d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:27.885117Z","signature_b64":"QMpuFYjVzYGJnY1oP6je0YOL+HgIIslyQPPMX9bGVNLCV78MimSpjdVObdL4PdMusfvvJfsF20Q6T7GYOa6ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4063127c934213d7f04abe9f552f525d708a139cf956e0e45bfe2b718075f7d6","last_reissued_at":"2026-05-17T23:54:27.884225Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:27.884225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03130","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-17T23:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjJG6htNmhrlUw6Gtvb3rnmaP5o9VHC14i8fp229pXN937Blz1tVxZFc/Qg2DrBC+FUokRipMp9nznyVgUF7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:16:28.151439Z"},"content_sha256":"bf6676371a36ee14f1c0eb12a94db97152e0f0ad4754c49cea28ad794ecffe18","schema_version":"1.0","event_id":"sha256:bf6676371a36ee14f1c0eb12a94db97152e0f0ad4754c49cea28ad794ecffe18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IBRRE7ETIIJ5P4CKX2PVKL2SLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The game chromatic number of a random hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Debsoumya Chakraborti, Mihir Hasabnis","submitted_at":"2019-02-06T20:23:28Z","abstract_excerpt":"We consider the following game, played on a $k$-uniform hypergraph $H$. There are $q$ colors available and two players take it in turns to color vertices. A partial coloring is proper if no edge is mono-chromatic. One player, A, wishes to color all the vertices and the other player, B, wishes to prevent this. The {\\em game chromatic number} $\\chi_g(H)$ is the minimum number of colors for which A has a winning strategy. We consider this in the context of a random $k$-uniform hypergraph and prove upper and lower bounds that hold w.h.p."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03130","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-17T23:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IxZgiqp/6RGpOkttK50e0IXNBh47HwHmqe3OGPdD7a1bLA64YHDgZIIht0nTTUqCiRE6WlG2v0rzZMkYg1IlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:16:28.152132Z"},"content_sha256":"18ca9ddf1235b70427b647513a84743daa18bbfe5bd7ec5b085b467b4b957702","schema_version":"1.0","event_id":"sha256:18ca9ddf1235b70427b647513a84743daa18bbfe5bd7ec5b085b467b4b957702"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/bundle.json","state_url":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/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-05-31T01:16:28Z","links":{"resolver":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV","bundle":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/bundle.json","state":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IBRRE7ETIIJ5P4CKX2PVKL2SLV","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":"17a4a51b04addebbea2ad6a65426add9950180fd4f43c615625dc50ebe2dfcd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T20:23:28Z","title_canon_sha256":"9852ddcdff4d8f13928146735772fa70ec2782dbb8e66bc11fbbd9392185f757"},"schema_version":"1.0","source":{"id":"1902.03130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03130","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03130v1","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03130","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"IBRRE7ETIIJ5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBRRE7ETIIJ5P4CK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBRRE7ET","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:18ca9ddf1235b70427b647513a84743daa18bbfe5bd7ec5b085b467b4b957702","target":"graph","created_at":"2026-05-17T23:54:27Z","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":"We consider the following game, played on a $k$-uniform hypergraph $H$. There are $q$ colors available and two players take it in turns to color vertices. A partial coloring is proper if no edge is mono-chromatic. One player, A, wishes to color all the vertices and the other player, B, wishes to prevent this. The {\\em game chromatic number} $\\chi_g(H)$ is the minimum number of colors for which A has a winning strategy. We consider this in the context of a random $k$-uniform hypergraph and prove upper and lower bounds that hold w.h.p.","authors_text":"Alan Frieze, Debsoumya Chakraborti, Mihir Hasabnis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T20:23:28Z","title":"The game chromatic number of a random hypergraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03130","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:bf6676371a36ee14f1c0eb12a94db97152e0f0ad4754c49cea28ad794ecffe18","target":"record","created_at":"2026-05-17T23:54:27Z","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":"17a4a51b04addebbea2ad6a65426add9950180fd4f43c615625dc50ebe2dfcd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T20:23:28Z","title_canon_sha256":"9852ddcdff4d8f13928146735772fa70ec2782dbb8e66bc11fbbd9392185f757"},"schema_version":"1.0","source":{"id":"1902.03130","kind":"arxiv","version":1}},"canonical_sha256":"4063127c934213d7f04abe9f552f525d708a139cf956e0e45bfe2b718075f7d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4063127c934213d7f04abe9f552f525d708a139cf956e0e45bfe2b718075f7d6","first_computed_at":"2026-05-17T23:54:27.884225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:27.884225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QMpuFYjVzYGJnY1oP6je0YOL+HgIIslyQPPMX9bGVNLCV78MimSpjdVObdL4PdMusfvvJfsF20Q6T7GYOa6ICw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:27.885117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf6676371a36ee14f1c0eb12a94db97152e0f0ad4754c49cea28ad794ecffe18","sha256:18ca9ddf1235b70427b647513a84743daa18bbfe5bd7ec5b085b467b4b957702"],"state_sha256":"0d204a58ecbc4bf7158fb09bd0fc984126730b97a8688fe37dfa600eab300d74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/fyqR+5vQVIHZCcl3W3PNvFH7iMyebyDQBclz7zIs/Ny6LEt//CMquBf+dbimiNAtAazmYGo1IoVZ+uC6YJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:16:28.155869Z","bundle_sha256":"b536b11a6128bd1e9b956416b2e2e873d0e8cab0c46fd7f9708aac042f92743f"}}