{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MYRZAA7NWUNTCFWIEU534R5ZAR","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":"382cbd80cf3564a0c97684465b369ffc3c73cb184d315d06cce82bf1244c9421","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:54:14Z","title_canon_sha256":"e854547fbce4678d5943ad0d34163f1659eebb7db0a38b45aa720503ac7bfd3a"},"schema_version":"1.0","source":{"id":"2412.17668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17668","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17668v1","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17668","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_12","alias_value":"MYRZAA7NWUNT","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_16","alias_value":"MYRZAA7NWUNTCFWI","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_8","alias_value":"MYRZAA7N","created_at":"2026-07-05T09:53:25Z"}],"graph_snapshots":[{"event_id":"sha256:79184ca197b8138a23bc879f57b531325af9c2c9555cf201b5f9837dd084ec39","target":"graph","created_at":"2026-07-05T09:53:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.17668/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Caroline Brosse, Nicolas Martins, Nicolas Nisse, Rudini Sampaio","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:54:14Z","title":"The Graph Coloring Game on $4\\times n$-Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17668","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:1ab9b54f79af140a9cb558c32cedd87c097a0729376da770d0ccaf6e087329d5","target":"record","created_at":"2026-07-05T09:53:25Z","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":"382cbd80cf3564a0c97684465b369ffc3c73cb184d315d06cce82bf1244c9421","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:54:14Z","title_canon_sha256":"e854547fbce4678d5943ad0d34163f1659eebb7db0a38b45aa720503ac7bfd3a"},"schema_version":"1.0","source":{"id":"2412.17668","kind":"arxiv","version":1}},"canonical_sha256":"66239003edb51b3116c8253bbe47b9046d635d55632df841eb416c7407db6c8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66239003edb51b3116c8253bbe47b9046d635d55632df841eb416c7407db6c8e","first_computed_at":"2026-07-05T09:53:25.677398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:25.677398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uTYQvyQcIsNSjnxSFmfQomWd3A3ML+OCUArNzEGpvA3TJPwv7LiOXL3rvmRgBZj+O4DiYXSubacHzm2UYqZtCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:25.677822Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ab9b54f79af140a9cb558c32cedd87c097a0729376da770d0ccaf6e087329d5","sha256:79184ca197b8138a23bc879f57b531325af9c2c9555cf201b5f9837dd084ec39"],"state_sha256":"bcea6e86727132c819d7de71c63d5be84b39889d8d2fc448dd80f328a4056320"}