{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5FNTVOICU2DHFILMER64SGAQQS","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":"016b143e41f639d5a6b9b0e3d311b9b432d082470e7722ae4e4ece09ca0d90c0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-22T14:41:51Z","title_canon_sha256":"fa6ee6c48eece498b9df8a60bfce97759860f81569d26055a64c901d973e2bb2"},"schema_version":"1.0","source":{"id":"1605.06801","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06801","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06801v2","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06801","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"5FNTVOICU2DH","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5FNTVOICU2DHFILM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5FNTVOIC","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:cabcf0a248263636b46e308e4e3f12e65a1bcd88444945224411b1735637f4f2","target":"graph","created_at":"2026-05-17T23:54:27Z","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"},"paper":{"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.","authors_text":"Kyle Burke, Melissa Huggan, Silvia Heubach, Svenja Huntemann","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-22T14:41:51Z","title":"Keeping Your Distance is Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06801","kind":"arxiv","version":2},"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:a30e50b7ea83232a2dcf1bd614a8f46d15348b891ef5fa64b4c6f6780810e23c","target":"record","created_at":"2026-05-17T23:54:27Z","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":"016b143e41f639d5a6b9b0e3d311b9b432d082470e7722ae4e4ece09ca0d90c0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-22T14:41:51Z","title_canon_sha256":"fa6ee6c48eece498b9df8a60bfce97759860f81569d26055a64c901d973e2bb2"},"schema_version":"1.0","source":{"id":"1605.06801","kind":"arxiv","version":2}},"canonical_sha256":"e95b3ab902a68672a16c247dc9181084be10a2c92f73ef420b68f615d324fd39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e95b3ab902a68672a16c247dc9181084be10a2c92f73ef420b68f615d324fd39","first_computed_at":"2026-05-17T23:54:27.073739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:27.073739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3iydRHESIqkLEo4k5JbLGveDKu5/E4x7g57FgK1BZY1mn0m1CliQmlV3OwtdeGKgn5Dc4HJgLC7JkgbFcwKADw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:27.074271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06801","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a30e50b7ea83232a2dcf1bd614a8f46d15348b891ef5fa64b4c6f6780810e23c","sha256:cabcf0a248263636b46e308e4e3f12e65a1bcd88444945224411b1735637f4f2"],"state_sha256":"bca50f2eec543afe30d0ad2df3ebce22569d8f92fbe1c2ffe990784e00b66c0b"}