{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YZ2LTTNS2CCNPM2DGOTXN5GUUS","short_pith_number":"pith:YZ2LTTNS","schema_version":"1.0","canonical_sha256":"c674b9cdb2d084d7b34333a776f4d4a49c87cafe18dc6c2bec128186183999cc","source":{"kind":"arxiv","id":"1805.03192","version":1},"attestation_state":"computed","paper":{"title":"The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jayson Lynch, Kaiying Hou","submitted_at":"2018-05-08T17:51:03Z","abstract_excerpt":"Finding Hamitonian Cycles in square grid graphs is a well studied and important questions. More recent work has extended these results to triangular and hexagonal grids, as well as further restricted versions. In this paper, we examine a class of more complex grids, as well as looking at the problem with restricted types of paths. We investigate the hardness of Hamiltonian cycle problem in grid graphs of semiregular tessellations. We give NP-hardness reductions for finding Hamiltonian paths in grid graphs based on all eight of the semiregular tessilations. Next, we investigate variations on th"},"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":"1805.03192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-08T17:51:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2374a7d28f1060872c40316b124545bc509cbc53584493ed811a8b91953559bb","abstract_canon_sha256":"a4652ce84677253bf25a66578d83db8c23801f35522bc780cf13075b8e3a0b6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:24.468905Z","signature_b64":"hqB9aTuUpw/mkScTmoxgm26emLB7kUPpGabsQ7C3JQ9AwWma7wbHhi11BVzpU4OoVoZdDnN9GmbB6RRk+R5MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c674b9cdb2d084d7b34333a776f4d4a49c87cafe18dc6c2bec128186183999cc","last_reissued_at":"2026-05-18T00:16:24.468383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:24.468383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jayson Lynch, Kaiying Hou","submitted_at":"2018-05-08T17:51:03Z","abstract_excerpt":"Finding Hamitonian Cycles in square grid graphs is a well studied and important questions. More recent work has extended these results to triangular and hexagonal grids, as well as further restricted versions. In this paper, we examine a class of more complex grids, as well as looking at the problem with restricted types of paths. We investigate the hardness of Hamiltonian cycle problem in grid graphs of semiregular tessellations. We give NP-hardness reductions for finding Hamiltonian paths in grid graphs based on all eight of the semiregular tessilations. Next, we investigate variations on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03192","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":"1805.03192","created_at":"2026-05-18T00:16:24.468473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03192v1","created_at":"2026-05-18T00:16:24.468473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03192","created_at":"2026-05-18T00:16:24.468473+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZ2LTTNS2CCN","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZ2LTTNS2CCNPM2D","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZ2LTTNS","created_at":"2026-05-18T12:33:04.347982+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/YZ2LTTNS2CCNPM2DGOTXN5GUUS","json":"https://pith.science/pith/YZ2LTTNS2CCNPM2DGOTXN5GUUS.json","graph_json":"https://pith.science/api/pith-number/YZ2LTTNS2CCNPM2DGOTXN5GUUS/graph.json","events_json":"https://pith.science/api/pith-number/YZ2LTTNS2CCNPM2DGOTXN5GUUS/events.json","paper":"https://pith.science/paper/YZ2LTTNS"},"agent_actions":{"view_html":"https://pith.science/pith/YZ2LTTNS2CCNPM2DGOTXN5GUUS","download_json":"https://pith.science/pith/YZ2LTTNS2CCNPM2DGOTXN5GUUS.json","view_paper":"https://pith.science/paper/YZ2LTTNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03192&json=true","fetch_graph":"https://pith.science/api/pith-number/YZ2LTTNS2CCNPM2DGOTXN5GUUS/graph.json","fetch_events":"https://pith.science/api/pith-number/YZ2LTTNS2CCNPM2DGOTXN5GUUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZ2LTTNS2CCNPM2DGOTXN5GUUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZ2LTTNS2CCNPM2DGOTXN5GUUS/action/storage_attestation","attest_author":"https://pith.science/pith/YZ2LTTNS2CCNPM2DGOTXN5GUUS/action/author_attestation","sign_citation":"https://pith.science/pith/YZ2LTTNS2CCNPM2DGOTXN5GUUS/action/citation_signature","submit_replication":"https://pith.science/pith/YZ2LTTNS2CCNPM2DGOTXN5GUUS/action/replication_record"}},"created_at":"2026-05-18T00:16:24.468473+00:00","updated_at":"2026-05-18T00:16:24.468473+00:00"}