{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KP3RU7BGDNJ5HLM3E3QQQ2JPR4","short_pith_number":"pith:KP3RU7BG","schema_version":"1.0","canonical_sha256":"53f71a7c261b53d3ad9b26e108692f8f0129a6f395a25db89f67fb5ae78c12e7","source":{"kind":"arxiv","id":"1704.08536","version":1},"attestation_state":"computed","paper":{"title":"The Parameterized Complexity of Positional Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abdallah Saffidine, Antonin Lambilliotte, \\'Edouard Bonnet, Serge Gaspers, Stefan R\\\"ummele","submitted_at":"2017-04-27T12:42:54Z","abstract_excerpt":"We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves an open problem from Downey and Fellows' influential list of open problems from 1999. Previously, the problem was thought of as a natural candidate for AW[*]-completeness. Our main tool is a new fragment of first-order logic where universally quantified variables only occur in inequalities. We show that model-checking on arbitrary relational structures for a formula in this fragment is W[1]-complete when parameterize"},"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":"1704.08536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-27T12:42:54Z","cross_cats_sorted":[],"title_canon_sha256":"e0d082f992ba2bb1c603ffa946d13eb3234af09065bfa71770fd2749484edd5e","abstract_canon_sha256":"d8de04ff4e56f14c8490fe4112410ae780235fb57a1ae9fafcac51d56191eb6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.437550Z","signature_b64":"CzISXEuGTteqb3J/cDovIvL0FToAM6rySTL1LgGzAOVzfMMk4hQr1CqViiTzIle1J03DWlcFFeUilKioNjAyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53f71a7c261b53d3ad9b26e108692f8f0129a6f395a25db89f67fb5ae78c12e7","last_reissued_at":"2026-05-18T00:45:27.436899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.436899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Positional Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abdallah Saffidine, Antonin Lambilliotte, \\'Edouard Bonnet, Serge Gaspers, Stefan R\\\"ummele","submitted_at":"2017-04-27T12:42:54Z","abstract_excerpt":"We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves an open problem from Downey and Fellows' influential list of open problems from 1999. Previously, the problem was thought of as a natural candidate for AW[*]-completeness. Our main tool is a new fragment of first-order logic where universally quantified variables only occur in inequalities. We show that model-checking on arbitrary relational structures for a formula in this fragment is W[1]-complete when parameterize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08536","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":"1704.08536","created_at":"2026-05-18T00:45:27.437000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08536v1","created_at":"2026-05-18T00:45:27.437000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08536","created_at":"2026-05-18T00:45:27.437000+00:00"},{"alias_kind":"pith_short_12","alias_value":"KP3RU7BGDNJ5","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KP3RU7BGDNJ5HLM3","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KP3RU7BG","created_at":"2026-05-18T12:31:24.725408+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/KP3RU7BGDNJ5HLM3E3QQQ2JPR4","json":"https://pith.science/pith/KP3RU7BGDNJ5HLM3E3QQQ2JPR4.json","graph_json":"https://pith.science/api/pith-number/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/graph.json","events_json":"https://pith.science/api/pith-number/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/events.json","paper":"https://pith.science/paper/KP3RU7BG"},"agent_actions":{"view_html":"https://pith.science/pith/KP3RU7BGDNJ5HLM3E3QQQ2JPR4","download_json":"https://pith.science/pith/KP3RU7BGDNJ5HLM3E3QQQ2JPR4.json","view_paper":"https://pith.science/paper/KP3RU7BG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08536&json=true","fetch_graph":"https://pith.science/api/pith-number/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/graph.json","fetch_events":"https://pith.science/api/pith-number/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/action/storage_attestation","attest_author":"https://pith.science/pith/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/action/author_attestation","sign_citation":"https://pith.science/pith/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/action/citation_signature","submit_replication":"https://pith.science/pith/KP3RU7BGDNJ5HLM3E3QQQ2JPR4/action/replication_record"}},"created_at":"2026-05-18T00:45:27.437000+00:00","updated_at":"2026-05-18T00:45:27.437000+00:00"}