{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MYRZAA7NWUNTCFWIEU534R5ZAR","short_pith_number":"pith:MYRZAA7N","schema_version":"1.0","canonical_sha256":"66239003edb51b3116c8253bbe47b9046d635d55632df841eb416c7407db6c8e","source":{"kind":"arxiv","id":"2412.17668","version":1},"attestation_state":"computed","paper":{"title":"The Graph Coloring Game on $4\\times n$-Grids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Caroline Brosse, Nicolas Martins, Nicolas Nisse, Rudini Sampaio","submitted_at":"2024-12-23T15:54:14Z","abstract_excerpt":"The graph coloring game is a famous two-player game (re)introduced by Bodlaender in $1991$. Given a graph $G$ and $k \\in \\mathbb{N}$, Alice and Bob alternately (starting with Alice) color an uncolored vertex with some color in $\\{1,\\cdots,k\\}$ such that no two adjacent vertices receive a same color. If eventually all vertices are colored, then Alice wins and Bob wins otherwise. The game chromatic number $\\chi_g(G)$ is the smallest integer $k$ such that Alice has a winning strategy with $k$ colors in $G$. It has been recently (2020) shown that, given a graph $G$ and $k\\in \\mathbb{N}$, deciding "},"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":"2412.17668","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:54:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e854547fbce4678d5943ad0d34163f1659eebb7db0a38b45aa720503ac7bfd3a","abstract_canon_sha256":"382cbd80cf3564a0c97684465b369ffc3c73cb184d315d06cce82bf1244c9421"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:25.677822Z","signature_b64":"uTYQvyQcIsNSjnxSFmfQomWd3A3ML+OCUArNzEGpvA3TJPwv7LiOXL3rvmRgBZj+O4DiYXSubacHzm2UYqZtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66239003edb51b3116c8253bbe47b9046d635d55632df841eb416c7407db6c8e","last_reissued_at":"2026-07-05T09:53:25.677398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:25.677398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Graph Coloring Game on $4\\times n$-Grids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Caroline Brosse, Nicolas Martins, Nicolas Nisse, Rudini Sampaio","submitted_at":"2024-12-23T15:54:14Z","abstract_excerpt":"The graph coloring game is a famous two-player game (re)introduced by Bodlaender in $1991$. Given a graph $G$ and $k \\in \\mathbb{N}$, Alice and Bob alternately (starting with Alice) color an uncolored vertex with some color in $\\{1,\\cdots,k\\}$ such that no two adjacent vertices receive a same color. If eventually all vertices are colored, then Alice wins and Bob wins otherwise. The game chromatic number $\\chi_g(G)$ is the smallest integer $k$ such that Alice has a winning strategy with $k$ colors in $G$. It has been recently (2020) shown that, given a graph $G$ and $k\\in \\mathbb{N}$, deciding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17668","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.17668/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.17668","created_at":"2026-07-05T09:53:25.677454+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17668v1","created_at":"2026-07-05T09:53:25.677454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17668","created_at":"2026-07-05T09:53:25.677454+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYRZAA7NWUNT","created_at":"2026-07-05T09:53:25.677454+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYRZAA7NWUNTCFWI","created_at":"2026-07-05T09:53:25.677454+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYRZAA7N","created_at":"2026-07-05T09:53:25.677454+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01259","citing_title":"The Normal Domination Partizan Game in Stars","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR","json":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR.json","graph_json":"https://pith.science/api/pith-number/MYRZAA7NWUNTCFWIEU534R5ZAR/graph.json","events_json":"https://pith.science/api/pith-number/MYRZAA7NWUNTCFWIEU534R5ZAR/events.json","paper":"https://pith.science/paper/MYRZAA7N"},"agent_actions":{"view_html":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR","download_json":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR.json","view_paper":"https://pith.science/paper/MYRZAA7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17668&json=true","fetch_graph":"https://pith.science/api/pith-number/MYRZAA7NWUNTCFWIEU534R5ZAR/graph.json","fetch_events":"https://pith.science/api/pith-number/MYRZAA7NWUNTCFWIEU534R5ZAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR/action/storage_attestation","attest_author":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR/action/author_attestation","sign_citation":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR/action/citation_signature","submit_replication":"https://pith.science/pith/MYRZAA7NWUNTCFWIEU534R5ZAR/action/replication_record"}},"created_at":"2026-07-05T09:53:25.677454+00:00","updated_at":"2026-07-05T09:53:25.677454+00:00"}