{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IBRRE7ETIIJ5P4CKX2PVKL2SLV","short_pith_number":"pith:IBRRE7ET","schema_version":"1.0","canonical_sha256":"4063127c934213d7f04abe9f552f525d708a139cf956e0e45bfe2b718075f7d6","source":{"kind":"arxiv","id":"1902.03130","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.03130","created_at":"2026-05-17T23:54:27.884393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03130v1","created_at":"2026-05-17T23:54:27.884393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03130","created_at":"2026-05-17T23:54:27.884393+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBRRE7ETIIJ5","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBRRE7ETIIJ5P4CK","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBRRE7ET","created_at":"2026-05-18T12:33:18.533446+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/IBRRE7ETIIJ5P4CKX2PVKL2SLV","json":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV.json","graph_json":"https://pith.science/api/pith-number/IBRRE7ETIIJ5P4CKX2PVKL2SLV/graph.json","events_json":"https://pith.science/api/pith-number/IBRRE7ETIIJ5P4CKX2PVKL2SLV/events.json","paper":"https://pith.science/paper/IBRRE7ET"},"agent_actions":{"view_html":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV","download_json":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV.json","view_paper":"https://pith.science/paper/IBRRE7ET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03130&json=true","fetch_graph":"https://pith.science/api/pith-number/IBRRE7ETIIJ5P4CKX2PVKL2SLV/graph.json","fetch_events":"https://pith.science/api/pith-number/IBRRE7ETIIJ5P4CKX2PVKL2SLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/action/storage_attestation","attest_author":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/action/author_attestation","sign_citation":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/action/citation_signature","submit_replication":"https://pith.science/pith/IBRRE7ETIIJ5P4CKX2PVKL2SLV/action/replication_record"}},"created_at":"2026-05-17T23:54:27.884393+00:00","updated_at":"2026-05-17T23:54:27.884393+00:00"}