{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZVY7GAQUREQWICQNM7BRFN2TZF","short_pith_number":"pith:ZVY7GAQU","schema_version":"1.0","canonical_sha256":"cd71f302148921640a0d67c312b753c96b47fe68aebc95d8729a00231a60f072","source":{"kind":"arxiv","id":"1603.03019","version":1},"attestation_state":"computed","paper":{"title":"Reducing the generalised Sudoku problem to the Hamiltonian cycle problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Michael Haythorpe","submitted_at":"2016-03-08T06:34:03Z","abstract_excerpt":"The generalised Sudoku problem with $N$ symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where $N$ is a perfect square. In particular, generalised Sudoku is equivalent to the, classical, Hamiltonian cycle problem. A constructive algorithm is given that reduces generalised Sudoku to the Hamiltonian cycle problem, where the resultant instance of Hamiltonian cycle problem is sparse, and has $O(N^3)$ vertices. The Hamiltonian cycle problem instance so constructed is a directed graph, and so a (known) conversion t"},"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":"1603.03019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T06:34:03Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"70682e46b82298e9acd874a6839b926e492e3e0066a74c82576431b65b5bee33","abstract_canon_sha256":"86f784e453ac7f4fd0bd072143b0929324e7318ac15c5e7e7196b1e32a9ac734"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:19.344511Z","signature_b64":"fZfofHJe6smdUBrhtitsrbckJNXF7JnJiebTqXSeAFlfSO1MQLO/c2Zpum3zc0rYrCByof3yiyMzQYyp4h3NDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd71f302148921640a0d67c312b753c96b47fe68aebc95d8729a00231a60f072","last_reissued_at":"2026-05-18T01:19:19.344120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:19.344120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing the generalised Sudoku problem to the Hamiltonian cycle problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Michael Haythorpe","submitted_at":"2016-03-08T06:34:03Z","abstract_excerpt":"The generalised Sudoku problem with $N$ symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where $N$ is a perfect square. In particular, generalised Sudoku is equivalent to the, classical, Hamiltonian cycle problem. A constructive algorithm is given that reduces generalised Sudoku to the Hamiltonian cycle problem, where the resultant instance of Hamiltonian cycle problem is sparse, and has $O(N^3)$ vertices. The Hamiltonian cycle problem instance so constructed is a directed graph, and so a (known) conversion t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03019","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":"1603.03019","created_at":"2026-05-18T01:19:19.344181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03019v1","created_at":"2026-05-18T01:19:19.344181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03019","created_at":"2026-05-18T01:19:19.344181+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVY7GAQUREQW","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVY7GAQUREQWICQN","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVY7GAQU","created_at":"2026-05-18T12:30:55.937587+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/ZVY7GAQUREQWICQNM7BRFN2TZF","json":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF.json","graph_json":"https://pith.science/api/pith-number/ZVY7GAQUREQWICQNM7BRFN2TZF/graph.json","events_json":"https://pith.science/api/pith-number/ZVY7GAQUREQWICQNM7BRFN2TZF/events.json","paper":"https://pith.science/paper/ZVY7GAQU"},"agent_actions":{"view_html":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF","download_json":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF.json","view_paper":"https://pith.science/paper/ZVY7GAQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03019&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVY7GAQUREQWICQNM7BRFN2TZF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVY7GAQUREQWICQNM7BRFN2TZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/action/storage_attestation","attest_author":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/action/author_attestation","sign_citation":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/action/citation_signature","submit_replication":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/action/replication_record"}},"created_at":"2026-05-18T01:19:19.344181+00:00","updated_at":"2026-05-18T01:19:19.344181+00:00"}