{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DOKXNFEVFG2SYPSJGXTXZA7WDY","short_pith_number":"pith:DOKXNFEV","schema_version":"1.0","canonical_sha256":"1b9576949529b52c3e4935e77c83f61e1625b7f39b85555adbe62ee66aae2fab","source":{"kind":"arxiv","id":"2606.25276","version":1},"attestation_state":"computed","paper":{"title":"Decidability and Undecidability Results for LIA-Definable Impartial Combinatorial Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jiahao Luo, Liangda Fang, Quanlong Guan, Shiguang Feng","submitted_at":"2026-06-24T01:28:19Z","abstract_excerpt":"Combinatorial game theory is a branch of mathematics and theoretical computer science that studies deterministic games with perfect information and no elements of chance. The majority of combinatorial games are impartial and formalized in linear integer arithmetic, which we call LIA-definable impartial combinatorial games (ICGs). This paper studies decidability and undecidability questions for these games. We prove that deciding whether an LIA-definable ICG is terminating or cyclic is undecidable in general, while the corresponding questions become decidable for terminating LIA-definable ICGs."},"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":"2606.25276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-24T01:28:19Z","cross_cats_sorted":[],"title_canon_sha256":"52f36020a6b8a65764716e506a4dd10c327dfa2c142f25023954c8691ba54fc9","abstract_canon_sha256":"4f17d9682096e2b86592a81e804b81e473318617086308be537d38bd6feeec11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:00.644192Z","signature_b64":"NHKRdqquD+uTy0yWmIhUCOHYpZKHJKp1ktcUCXP2Hl0oIM4SUzxhSF3Uigy4WrQa9Vl5F/TvIDMUV0VbKSg8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b9576949529b52c3e4935e77c83f61e1625b7f39b85555adbe62ee66aae2fab","last_reissued_at":"2026-06-25T01:18:00.643723Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:00.643723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decidability and Undecidability Results for LIA-Definable Impartial Combinatorial Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jiahao Luo, Liangda Fang, Quanlong Guan, Shiguang Feng","submitted_at":"2026-06-24T01:28:19Z","abstract_excerpt":"Combinatorial game theory is a branch of mathematics and theoretical computer science that studies deterministic games with perfect information and no elements of chance. The majority of combinatorial games are impartial and formalized in linear integer arithmetic, which we call LIA-definable impartial combinatorial games (ICGs). This paper studies decidability and undecidability questions for these games. We prove that deciding whether an LIA-definable ICG is terminating or cyclic is undecidable in general, while the corresponding questions become decidable for terminating LIA-definable ICGs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25276","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/2606.25276/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":"2606.25276","created_at":"2026-06-25T01:18:00.643788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.25276v1","created_at":"2026-06-25T01:18:00.643788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25276","created_at":"2026-06-25T01:18:00.643788+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOKXNFEVFG2S","created_at":"2026-06-25T01:18:00.643788+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOKXNFEVFG2SYPSJ","created_at":"2026-06-25T01:18:00.643788+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOKXNFEV","created_at":"2026-06-25T01:18:00.643788+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/DOKXNFEVFG2SYPSJGXTXZA7WDY","json":"https://pith.science/pith/DOKXNFEVFG2SYPSJGXTXZA7WDY.json","graph_json":"https://pith.science/api/pith-number/DOKXNFEVFG2SYPSJGXTXZA7WDY/graph.json","events_json":"https://pith.science/api/pith-number/DOKXNFEVFG2SYPSJGXTXZA7WDY/events.json","paper":"https://pith.science/paper/DOKXNFEV"},"agent_actions":{"view_html":"https://pith.science/pith/DOKXNFEVFG2SYPSJGXTXZA7WDY","download_json":"https://pith.science/pith/DOKXNFEVFG2SYPSJGXTXZA7WDY.json","view_paper":"https://pith.science/paper/DOKXNFEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.25276&json=true","fetch_graph":"https://pith.science/api/pith-number/DOKXNFEVFG2SYPSJGXTXZA7WDY/graph.json","fetch_events":"https://pith.science/api/pith-number/DOKXNFEVFG2SYPSJGXTXZA7WDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOKXNFEVFG2SYPSJGXTXZA7WDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOKXNFEVFG2SYPSJGXTXZA7WDY/action/storage_attestation","attest_author":"https://pith.science/pith/DOKXNFEVFG2SYPSJGXTXZA7WDY/action/author_attestation","sign_citation":"https://pith.science/pith/DOKXNFEVFG2SYPSJGXTXZA7WDY/action/citation_signature","submit_replication":"https://pith.science/pith/DOKXNFEVFG2SYPSJGXTXZA7WDY/action/replication_record"}},"created_at":"2026-06-25T01:18:00.643788+00:00","updated_at":"2026-06-25T01:18:00.643788+00:00"}