{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:N53JD6CGTBHBLWLZEAQO2OJDU3","short_pith_number":"pith:N53JD6CG","schema_version":"1.0","canonical_sha256":"6f7691f846984e15d9792020ed3923a6c390d6118a9858559a4d6952bcb6c1c9","source":{"kind":"arxiv","id":"2502.16073","version":1},"attestation_state":"computed","paper":{"title":"Indicated list colouring game on graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huan Zhou, Jialu Zhu, Xuding Zhu, Yangyan Gu, Yiting Jiang","submitted_at":"2025-02-22T04:30:58Z","abstract_excerpt":"Given a graph $G$ and a list assignment $L$ for $G$, the indicated $L$-colouring game on $G$ is played by two players: Ann and Ben. In each round, Ann chooses an uncoloured vertex $v$, and Ben colours $v$ with a colour from $L(v)$ that is not used by its coloured neighbours. If all vertices are coloured, then Ann wins the game. Otherwise after a finite number of rounds, there remains an uncoloured vertex $v$ such that all colours in $L(v)$ have been used by its coloured neighbours, Ben wins. We say $G$ is indicated $L$-colourable if Ann has a winning strategy for the indicated $L$-colouring ga"},"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":"2502.16073","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-22T04:30:58Z","cross_cats_sorted":[],"title_canon_sha256":"b9cd9fe0fc810965e25dedecc8e4c6a266d19b4ac15553a1678a7f01fdf0dde0","abstract_canon_sha256":"8a5179ae11adeddcc97103d18d32b92c7ba41205799a88039326b193e4a26fd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:20.641243Z","signature_b64":"9auAOlu4nqHvDmRfXzfotRcj4uFxBITVTk6IgUUWzgGWBw0f76NT1GHHNtgESahqe+OjI/lyDWHQyP8n1pPjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f7691f846984e15d9792020ed3923a6c390d6118a9858559a4d6952bcb6c1c9","last_reissued_at":"2026-07-05T10:18:20.640726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:20.640726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indicated list colouring game on graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huan Zhou, Jialu Zhu, Xuding Zhu, Yangyan Gu, Yiting Jiang","submitted_at":"2025-02-22T04:30:58Z","abstract_excerpt":"Given a graph $G$ and a list assignment $L$ for $G$, the indicated $L$-colouring game on $G$ is played by two players: Ann and Ben. In each round, Ann chooses an uncoloured vertex $v$, and Ben colours $v$ with a colour from $L(v)$ that is not used by its coloured neighbours. If all vertices are coloured, then Ann wins the game. Otherwise after a finite number of rounds, there remains an uncoloured vertex $v$ such that all colours in $L(v)$ have been used by its coloured neighbours, Ben wins. We say $G$ is indicated $L$-colourable if Ann has a winning strategy for the indicated $L$-colouring ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16073","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/2502.16073/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":"2502.16073","created_at":"2026-07-05T10:18:20.640808+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16073v1","created_at":"2026-07-05T10:18:20.640808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16073","created_at":"2026-07-05T10:18:20.640808+00:00"},{"alias_kind":"pith_short_12","alias_value":"N53JD6CGTBHB","created_at":"2026-07-05T10:18:20.640808+00:00"},{"alias_kind":"pith_short_16","alias_value":"N53JD6CGTBHBLWLZ","created_at":"2026-07-05T10:18:20.640808+00:00"},{"alias_kind":"pith_short_8","alias_value":"N53JD6CG","created_at":"2026-07-05T10:18:20.640808+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/N53JD6CGTBHBLWLZEAQO2OJDU3","json":"https://pith.science/pith/N53JD6CGTBHBLWLZEAQO2OJDU3.json","graph_json":"https://pith.science/api/pith-number/N53JD6CGTBHBLWLZEAQO2OJDU3/graph.json","events_json":"https://pith.science/api/pith-number/N53JD6CGTBHBLWLZEAQO2OJDU3/events.json","paper":"https://pith.science/paper/N53JD6CG"},"agent_actions":{"view_html":"https://pith.science/pith/N53JD6CGTBHBLWLZEAQO2OJDU3","download_json":"https://pith.science/pith/N53JD6CGTBHBLWLZEAQO2OJDU3.json","view_paper":"https://pith.science/paper/N53JD6CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16073&json=true","fetch_graph":"https://pith.science/api/pith-number/N53JD6CGTBHBLWLZEAQO2OJDU3/graph.json","fetch_events":"https://pith.science/api/pith-number/N53JD6CGTBHBLWLZEAQO2OJDU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N53JD6CGTBHBLWLZEAQO2OJDU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N53JD6CGTBHBLWLZEAQO2OJDU3/action/storage_attestation","attest_author":"https://pith.science/pith/N53JD6CGTBHBLWLZEAQO2OJDU3/action/author_attestation","sign_citation":"https://pith.science/pith/N53JD6CGTBHBLWLZEAQO2OJDU3/action/citation_signature","submit_replication":"https://pith.science/pith/N53JD6CGTBHBLWLZEAQO2OJDU3/action/replication_record"}},"created_at":"2026-07-05T10:18:20.640808+00:00","updated_at":"2026-07-05T10:18:20.640808+00:00"}