{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5FNTVOICU2DHFILMER64SGAQQS","short_pith_number":"pith:5FNTVOIC","schema_version":"1.0","canonical_sha256":"e95b3ab902a68672a16c247dc9181084be10a2c92f73ef420b68f615d324fd39","source":{"kind":"arxiv","id":"1605.06801","version":2},"attestation_state":"computed","paper":{"title":"Keeping Your Distance is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Kyle Burke, Melissa Huggan, Silvia Heubach, Svenja Huntemann","submitted_at":"2016-05-22T14:41:51Z","abstract_excerpt":"We study the computational complexity of distance games, a class of combinatorial games played on graphs. A move consists of colouring an uncoloured vertex subject to it not being at certain distances determined by two sets, D and S. D is the set of forbidden distances for colouring vertices in different colors, while S is the set of forbidden distances for the same colour. The last player to move wins. Well-known examples of distance games are Node-Kayles, Snort, and Col, whose complexities were shown to be PSPACE-hard. We show that many more distance games are also PSPACE-hard."},"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":"1605.06801","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-22T14:41:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fa6ee6c48eece498b9df8a60bfce97759860f81569d26055a64c901d973e2bb2","abstract_canon_sha256":"016b143e41f639d5a6b9b0e3d311b9b432d082470e7722ae4e4ece09ca0d90c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:27.074271Z","signature_b64":"3iydRHESIqkLEo4k5JbLGveDKu5/E4x7g57FgK1BZY1mn0m1CliQmlV3OwtdeGKgn5Dc4HJgLC7JkgbFcwKADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e95b3ab902a68672a16c247dc9181084be10a2c92f73ef420b68f615d324fd39","last_reissued_at":"2026-05-17T23:54:27.073739Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:27.073739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Keeping Your Distance is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Kyle Burke, Melissa Huggan, Silvia Heubach, Svenja Huntemann","submitted_at":"2016-05-22T14:41:51Z","abstract_excerpt":"We study the computational complexity of distance games, a class of combinatorial games played on graphs. A move consists of colouring an uncoloured vertex subject to it not being at certain distances determined by two sets, D and S. D is the set of forbidden distances for colouring vertices in different colors, while S is the set of forbidden distances for the same colour. The last player to move wins. Well-known examples of distance games are Node-Kayles, Snort, and Col, whose complexities were shown to be PSPACE-hard. We show that many more distance games are also PSPACE-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06801","kind":"arxiv","version":2},"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":"1605.06801","created_at":"2026-05-17T23:54:27.073841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06801v2","created_at":"2026-05-17T23:54:27.073841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06801","created_at":"2026-05-17T23:54:27.073841+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FNTVOICU2DH","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FNTVOICU2DHFILM","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FNTVOIC","created_at":"2026-05-18T12:30:01.593930+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/5FNTVOICU2DHFILMER64SGAQQS","json":"https://pith.science/pith/5FNTVOICU2DHFILMER64SGAQQS.json","graph_json":"https://pith.science/api/pith-number/5FNTVOICU2DHFILMER64SGAQQS/graph.json","events_json":"https://pith.science/api/pith-number/5FNTVOICU2DHFILMER64SGAQQS/events.json","paper":"https://pith.science/paper/5FNTVOIC"},"agent_actions":{"view_html":"https://pith.science/pith/5FNTVOICU2DHFILMER64SGAQQS","download_json":"https://pith.science/pith/5FNTVOICU2DHFILMER64SGAQQS.json","view_paper":"https://pith.science/paper/5FNTVOIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06801&json=true","fetch_graph":"https://pith.science/api/pith-number/5FNTVOICU2DHFILMER64SGAQQS/graph.json","fetch_events":"https://pith.science/api/pith-number/5FNTVOICU2DHFILMER64SGAQQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FNTVOICU2DHFILMER64SGAQQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FNTVOICU2DHFILMER64SGAQQS/action/storage_attestation","attest_author":"https://pith.science/pith/5FNTVOICU2DHFILMER64SGAQQS/action/author_attestation","sign_citation":"https://pith.science/pith/5FNTVOICU2DHFILMER64SGAQQS/action/citation_signature","submit_replication":"https://pith.science/pith/5FNTVOICU2DHFILMER64SGAQQS/action/replication_record"}},"created_at":"2026-05-17T23:54:27.073841+00:00","updated_at":"2026-05-17T23:54:27.073841+00:00"}