{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L4XQ3ZQSL4V6SX6CQX3GKBIWLG","short_pith_number":"pith:L4XQ3ZQS","schema_version":"1.0","canonical_sha256":"5f2f0de6125f2be95fc285f6650516598f7eb191e74f2d247cb8e515985c67b1","source":{"kind":"arxiv","id":"2606.29153","version":1},"attestation_state":"computed","paper":{"title":"The Optimal Knight Exchange Puzzle is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Henry Siegel","submitted_at":"2026-06-28T02:22:16Z","abstract_excerpt":"This paper explores the hardness of two popular recreational chess puzzles: The Knight's Tour and the Knight Exchange (Swap). The problem of finding a Knight's Tour is known to be NP-hard for any chessboard with holes and constant-time decidable for rectangular chessboards, so a natural direction is to explore the hardness of the problem for intermediate chessboard restrictions. In this paper, we show that Knight's Tour is NP-hard for connected boards. We also give a short polynomial-time reduction between the two problems, showing that the optimality version of Knight Exchange is NP-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":"2606.29153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-28T02:22:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cf82a762cd9d6d00b9b27e61251d4fe4467707668721d416a09b168642e236ba","abstract_canon_sha256":"dc52b19517cf54832d379b6ba203b0043c8488f0892fa145c4c66fe630da139a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:54.801271Z","signature_b64":"hs2mda7pcu8zCMY7Rdzehfuwdubmrd9aQ+xA+kZo8jQ6GjqQ3RAbkqtGMwKp6mo5XZPwotK2SYJXYlVN+MVvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f2f0de6125f2be95fc285f6650516598f7eb191e74f2d247cb8e515985c67b1","last_reissued_at":"2026-06-30T01:17:54.800851Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:54.800851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Optimal Knight Exchange Puzzle is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Henry Siegel","submitted_at":"2026-06-28T02:22:16Z","abstract_excerpt":"This paper explores the hardness of two popular recreational chess puzzles: The Knight's Tour and the Knight Exchange (Swap). The problem of finding a Knight's Tour is known to be NP-hard for any chessboard with holes and constant-time decidable for rectangular chessboards, so a natural direction is to explore the hardness of the problem for intermediate chessboard restrictions. In this paper, we show that Knight's Tour is NP-hard for connected boards. We also give a short polynomial-time reduction between the two problems, showing that the optimality version of Knight Exchange is NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29153","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.29153/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.29153","created_at":"2026-06-30T01:17:54.800911+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29153v1","created_at":"2026-06-30T01:17:54.800911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29153","created_at":"2026-06-30T01:17:54.800911+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4XQ3ZQSL4V6","created_at":"2026-06-30T01:17:54.800911+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4XQ3ZQSL4V6SX6C","created_at":"2026-06-30T01:17:54.800911+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4XQ3ZQS","created_at":"2026-06-30T01:17:54.800911+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/L4XQ3ZQSL4V6SX6CQX3GKBIWLG","json":"https://pith.science/pith/L4XQ3ZQSL4V6SX6CQX3GKBIWLG.json","graph_json":"https://pith.science/api/pith-number/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/graph.json","events_json":"https://pith.science/api/pith-number/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/events.json","paper":"https://pith.science/paper/L4XQ3ZQS"},"agent_actions":{"view_html":"https://pith.science/pith/L4XQ3ZQSL4V6SX6CQX3GKBIWLG","download_json":"https://pith.science/pith/L4XQ3ZQSL4V6SX6CQX3GKBIWLG.json","view_paper":"https://pith.science/paper/L4XQ3ZQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29153&json=true","fetch_graph":"https://pith.science/api/pith-number/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/graph.json","fetch_events":"https://pith.science/api/pith-number/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/action/storage_attestation","attest_author":"https://pith.science/pith/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/action/author_attestation","sign_citation":"https://pith.science/pith/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/action/citation_signature","submit_replication":"https://pith.science/pith/L4XQ3ZQSL4V6SX6CQX3GKBIWLG/action/replication_record"}},"created_at":"2026-06-30T01:17:54.800911+00:00","updated_at":"2026-06-30T01:17:54.800911+00:00"}