{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:53LJDECR33QTTBMQH3XMFAZXIP","short_pith_number":"pith:53LJDECR","schema_version":"1.0","canonical_sha256":"eed6919051dee13985903eeec2833743d3db5c9d33d6c20e79267aa315b7537e","source":{"kind":"arxiv","id":"1311.4109","version":3},"attestation_state":"computed","paper":{"title":"Generalised Knight's Tours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nina Kam\\v{c}ev","submitted_at":"2013-11-17T02:18:17Z","abstract_excerpt":"The problem of existence of closed knight's tours in $[n]^d$, where $[n]=\\{0, 1, \\dots, n-1\\}$, was recently solved by Erde, Gol\\'{e}nia, and Gol\\'{e}nia. They raised the same question for a generalised, $(a, b)$ knight, which is allowed to move along any two axes of $[n]^d$ by $a$ and $b$ unit lengths respectively. Given an even number $a$, we show that the $[n]^d$ grid admits an $(a, 1)$ knight's tour for sufficiently large even side length $n$."},"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":"1311.4109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-17T02:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"aa5af9a4dab1e9a3ac3c092efe46926d20b73dcc253aae271c1ee5dd2251bf4d","abstract_canon_sha256":"8dddde2e2ddaa5a3b68cb4b72d18c42bdd7bee63924b08a0b7044108b600ec4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:16.355594Z","signature_b64":"j7SgkRyfsFf3G3iKux60wRwAgSoMheTtE11kqjm0o7lgTH5gxvFFLtL1ClMUtC0o4jwP4TInEOu8vTt+t7/oDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eed6919051dee13985903eeec2833743d3db5c9d33d6c20e79267aa315b7537e","last_reissued_at":"2026-05-18T01:01:16.355086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:16.355086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalised Knight's Tours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nina Kam\\v{c}ev","submitted_at":"2013-11-17T02:18:17Z","abstract_excerpt":"The problem of existence of closed knight's tours in $[n]^d$, where $[n]=\\{0, 1, \\dots, n-1\\}$, was recently solved by Erde, Gol\\'{e}nia, and Gol\\'{e}nia. They raised the same question for a generalised, $(a, b)$ knight, which is allowed to move along any two axes of $[n]^d$ by $a$ and $b$ unit lengths respectively. Given an even number $a$, we show that the $[n]^d$ grid admits an $(a, 1)$ knight's tour for sufficiently large even side length $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4109","kind":"arxiv","version":3},"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":"1311.4109","created_at":"2026-05-18T01:01:16.355162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4109v3","created_at":"2026-05-18T01:01:16.355162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4109","created_at":"2026-05-18T01:01:16.355162+00:00"},{"alias_kind":"pith_short_12","alias_value":"53LJDECR33QT","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"53LJDECR33QTTBMQ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"53LJDECR","created_at":"2026-05-18T12:27:34.582898+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/53LJDECR33QTTBMQH3XMFAZXIP","json":"https://pith.science/pith/53LJDECR33QTTBMQH3XMFAZXIP.json","graph_json":"https://pith.science/api/pith-number/53LJDECR33QTTBMQH3XMFAZXIP/graph.json","events_json":"https://pith.science/api/pith-number/53LJDECR33QTTBMQH3XMFAZXIP/events.json","paper":"https://pith.science/paper/53LJDECR"},"agent_actions":{"view_html":"https://pith.science/pith/53LJDECR33QTTBMQH3XMFAZXIP","download_json":"https://pith.science/pith/53LJDECR33QTTBMQH3XMFAZXIP.json","view_paper":"https://pith.science/paper/53LJDECR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4109&json=true","fetch_graph":"https://pith.science/api/pith-number/53LJDECR33QTTBMQH3XMFAZXIP/graph.json","fetch_events":"https://pith.science/api/pith-number/53LJDECR33QTTBMQH3XMFAZXIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53LJDECR33QTTBMQH3XMFAZXIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53LJDECR33QTTBMQH3XMFAZXIP/action/storage_attestation","attest_author":"https://pith.science/pith/53LJDECR33QTTBMQH3XMFAZXIP/action/author_attestation","sign_citation":"https://pith.science/pith/53LJDECR33QTTBMQH3XMFAZXIP/action/citation_signature","submit_replication":"https://pith.science/pith/53LJDECR33QTTBMQH3XMFAZXIP/action/replication_record"}},"created_at":"2026-05-18T01:01:16.355162+00:00","updated_at":"2026-05-18T01:01:16.355162+00:00"}