{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZVY7GAQUREQWICQNM7BRFN2TZF","short_pith_number":"pith:ZVY7GAQU","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"},"canonical_sha256":"cd71f302148921640a0d67c312b753c96b47fe68aebc95d8729a00231a60f072","source":{"kind":"arxiv","id":"1603.03019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03019","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03019v1","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03019","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZVY7GAQUREQW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZVY7GAQUREQWICQN","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZVY7GAQU","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZVY7GAQUREQWICQNM7BRFN2TZF","target":"record","payload":{"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"},"canonical_sha256":"cd71f302148921640a0d67c312b753c96b47fe68aebc95d8729a00231a60f072","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"},"source_kind":"arxiv","source_id":"1603.03019","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9ycyOgkroZmhAVgSQPEFqa8Jk8RO+J0iaxq7UcUBj00VgTi2gLJ1fDBkgny+cXGlFyRGCQY75FxVKT9Nl2mBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:07:18.090041Z"},"content_sha256":"5d351419781ff75ec0f255ae9acc768067cb4c3af5fe27b39d0588baa8e245c9","schema_version":"1.0","event_id":"sha256:5d351419781ff75ec0f255ae9acc768067cb4c3af5fe27b39d0588baa8e245c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZVY7GAQUREQWICQNM7BRFN2TZF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYXqgYfxKQajxF4gqSndqWURCQHGdXtXQyxbaBWj1PbrUPiJNmQZm8OW3M4bjhwv9BrTOTsCiWkTgFEz7/nHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:07:18.090738Z"},"content_sha256":"8b42b5872b78f2344cadd862082ca75206dd8e13b52bb892dd21a0e8c3c43185","schema_version":"1.0","event_id":"sha256:8b42b5872b78f2344cadd862082ca75206dd8e13b52bb892dd21a0e8c3c43185"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/bundle.json","state_url":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T11:07:18Z","links":{"resolver":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF","bundle":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/bundle.json","state":"https://pith.science/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVY7GAQUREQWICQNM7BRFN2TZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZVY7GAQUREQWICQNM7BRFN2TZF","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":"86f784e453ac7f4fd0bd072143b0929324e7318ac15c5e7e7196b1e32a9ac734","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T06:34:03Z","title_canon_sha256":"70682e46b82298e9acd874a6839b926e492e3e0066a74c82576431b65b5bee33"},"schema_version":"1.0","source":{"id":"1603.03019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03019","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03019v1","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03019","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZVY7GAQUREQW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZVY7GAQUREQWICQN","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZVY7GAQU","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:8b42b5872b78f2344cadd862082ca75206dd8e13b52bb892dd21a0e8c3c43185","target":"graph","created_at":"2026-05-18T01:19:19Z","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":"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","authors_text":"Michael Haythorpe","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T06:34:03Z","title":"Reducing the generalised Sudoku problem to the Hamiltonian cycle problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03019","kind":"arxiv","version":1},"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:5d351419781ff75ec0f255ae9acc768067cb4c3af5fe27b39d0588baa8e245c9","target":"record","created_at":"2026-05-18T01:19:19Z","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":"86f784e453ac7f4fd0bd072143b0929324e7318ac15c5e7e7196b1e32a9ac734","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T06:34:03Z","title_canon_sha256":"70682e46b82298e9acd874a6839b926e492e3e0066a74c82576431b65b5bee33"},"schema_version":"1.0","source":{"id":"1603.03019","kind":"arxiv","version":1}},"canonical_sha256":"cd71f302148921640a0d67c312b753c96b47fe68aebc95d8729a00231a60f072","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd71f302148921640a0d67c312b753c96b47fe68aebc95d8729a00231a60f072","first_computed_at":"2026-05-18T01:19:19.344120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:19.344120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fZfofHJe6smdUBrhtitsrbckJNXF7JnJiebTqXSeAFlfSO1MQLO/c2Zpum3zc0rYrCByof3yiyMzQYyp4h3NDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:19.344511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d351419781ff75ec0f255ae9acc768067cb4c3af5fe27b39d0588baa8e245c9","sha256:8b42b5872b78f2344cadd862082ca75206dd8e13b52bb892dd21a0e8c3c43185"],"state_sha256":"2fe61ea29bffbf68fb8e9437ccd34bd62cee08c9bc69a9ec3eb4c41fae585c15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mfd3X4g1IC3VfENYyv6XSNMlvWdo0Elb2ZZFjr8N3QUc4xKNrVQZkyl7k99fQ2T1FqtKphKZOKdi1yPS5sALDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:07:18.094079Z","bundle_sha256":"2db4ce77d988ff5e15b7c0b86ecf21e21051bdbe9b8979d30644794f541a0a0c"}}