{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AK7CMGNCMUI7RW2YUUNCWKG5NM","short_pith_number":"pith:AK7CMGNC","schema_version":"1.0","canonical_sha256":"02be2619a26511f8db58a51a2b28dd6b373255e68cbe5a3b4033b8faaaceff2e","source":{"kind":"arxiv","id":"1706.10046","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Mikhail Rudoy","submitted_at":"2017-06-30T07:37:53Z","abstract_excerpt":"In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we prove two of these unsolved combinations to be NP-complete: Hamiltonicity of Square Polygonal Grid Graphs and Hamiltonicity of Hexagonal Thin Grid Graphs. We also consider a new restriction, where the grid grap"},"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":"1706.10046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-30T07:37:53Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"d83f914fadc1e3d43549caa9bebb8dcb9217538a07717069e26b82a2a95fc41b","abstract_canon_sha256":"c610ee8d9a8398284d2092c6fa6a68b2390536d5d2df68dc19d7f49fb1ff3fed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:11.612018Z","signature_b64":"94GwjqAPHjtgr6khpypcUzpBFdaIutSGa1BXrCb0JM2CONgIy/5i/3i5wjFp090FZpRfywJ0gFD+r1cZbFySBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02be2619a26511f8db58a51a2b28dd6b373255e68cbe5a3b4033b8faaaceff2e","last_reissued_at":"2026-05-18T00:41:11.611445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:11.611445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Mikhail Rudoy","submitted_at":"2017-06-30T07:37:53Z","abstract_excerpt":"In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we prove two of these unsolved combinations to be NP-complete: Hamiltonicity of Square Polygonal Grid Graphs and Hamiltonicity of Hexagonal Thin Grid Graphs. We also consider a new restriction, where the grid grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10046","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":"1706.10046","created_at":"2026-05-18T00:41:11.611531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.10046v1","created_at":"2026-05-18T00:41:11.611531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10046","created_at":"2026-05-18T00:41:11.611531+00:00"},{"alias_kind":"pith_short_12","alias_value":"AK7CMGNCMUI7","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AK7CMGNCMUI7RW2Y","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AK7CMGNC","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2405.08377","citing_title":"ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM","json":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM.json","graph_json":"https://pith.science/api/pith-number/AK7CMGNCMUI7RW2YUUNCWKG5NM/graph.json","events_json":"https://pith.science/api/pith-number/AK7CMGNCMUI7RW2YUUNCWKG5NM/events.json","paper":"https://pith.science/paper/AK7CMGNC"},"agent_actions":{"view_html":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM","download_json":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM.json","view_paper":"https://pith.science/paper/AK7CMGNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.10046&json=true","fetch_graph":"https://pith.science/api/pith-number/AK7CMGNCMUI7RW2YUUNCWKG5NM/graph.json","fetch_events":"https://pith.science/api/pith-number/AK7CMGNCMUI7RW2YUUNCWKG5NM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/action/storage_attestation","attest_author":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/action/author_attestation","sign_citation":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/action/citation_signature","submit_replication":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/action/replication_record"}},"created_at":"2026-05-18T00:41:11.611531+00:00","updated_at":"2026-05-18T00:41:11.611531+00:00"}