{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AK7CMGNCMUI7RW2YUUNCWKG5NM","short_pith_number":"pith:AK7CMGNC","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"},"canonical_sha256":"02be2619a26511f8db58a51a2b28dd6b373255e68cbe5a3b4033b8faaaceff2e","source":{"kind":"arxiv","id":"1706.10046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10046","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10046v1","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10046","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"AK7CMGNCMUI7","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AK7CMGNCMUI7RW2Y","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AK7CMGNC","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AK7CMGNCMUI7RW2YUUNCWKG5NM","target":"record","payload":{"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"},"canonical_sha256":"02be2619a26511f8db58a51a2b28dd6b373255e68cbe5a3b4033b8faaaceff2e","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"},"source_kind":"arxiv","source_id":"1706.10046","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-18T00:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WG21/isfNZ1fkM6MtDjUdo+2BvjVPI8mfFru4VTokrNg3wLgxMsB7UUjtxHcNSvwSQl45hOm2n74WWDSsE2FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:52:29.225232Z"},"content_sha256":"de485ab7f6c8d1f3dbd2495e09fce260ddef1959c32f006c17fb6927e8e380e6","schema_version":"1.0","event_id":"sha256:de485ab7f6c8d1f3dbd2495e09fce260ddef1959c32f006c17fb6927e8e380e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AK7CMGNCMUI7RW2YUUNCWKG5NM","target":"graph","payload":{"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"},"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-18T00:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTC4Wh5j8msfi6laZQrHWlCw5QauPZu98YAa+ODw+qnlsYMbw58AObXVlK0EOYyvacuyMtYP878mdXniRA2AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:52:29.225610Z"},"content_sha256":"1c68e3cb253f56cbb287ea227991f609f47afe6b8ab704a3ebe8a4063bbbb303","schema_version":"1.0","event_id":"sha256:1c68e3cb253f56cbb287ea227991f609f47afe6b8ab704a3ebe8a4063bbbb303"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/bundle.json","state_url":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/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-28T12:52:29Z","links":{"resolver":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM","bundle":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/bundle.json","state":"https://pith.science/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AK7CMGNCMUI7RW2YUUNCWKG5NM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AK7CMGNCMUI7RW2YUUNCWKG5NM","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":"c610ee8d9a8398284d2092c6fa6a68b2390536d5d2df68dc19d7f49fb1ff3fed","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-30T07:37:53Z","title_canon_sha256":"d83f914fadc1e3d43549caa9bebb8dcb9217538a07717069e26b82a2a95fc41b"},"schema_version":"1.0","source":{"id":"1706.10046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10046","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10046v1","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10046","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"AK7CMGNCMUI7","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AK7CMGNCMUI7RW2Y","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AK7CMGNC","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:1c68e3cb253f56cbb287ea227991f609f47afe6b8ab704a3ebe8a4063bbbb303","target":"graph","created_at":"2026-05-18T00:41:11Z","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":"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","authors_text":"Erik D. Demaine, Mikhail Rudoy","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-30T07:37:53Z","title":"Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10046","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:de485ab7f6c8d1f3dbd2495e09fce260ddef1959c32f006c17fb6927e8e380e6","target":"record","created_at":"2026-05-18T00:41:11Z","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":"c610ee8d9a8398284d2092c6fa6a68b2390536d5d2df68dc19d7f49fb1ff3fed","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-30T07:37:53Z","title_canon_sha256":"d83f914fadc1e3d43549caa9bebb8dcb9217538a07717069e26b82a2a95fc41b"},"schema_version":"1.0","source":{"id":"1706.10046","kind":"arxiv","version":1}},"canonical_sha256":"02be2619a26511f8db58a51a2b28dd6b373255e68cbe5a3b4033b8faaaceff2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02be2619a26511f8db58a51a2b28dd6b373255e68cbe5a3b4033b8faaaceff2e","first_computed_at":"2026-05-18T00:41:11.611445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:11.611445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"94GwjqAPHjtgr6khpypcUzpBFdaIutSGa1BXrCb0JM2CONgIy/5i/3i5wjFp090FZpRfywJ0gFD+r1cZbFySBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:11.612018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.10046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de485ab7f6c8d1f3dbd2495e09fce260ddef1959c32f006c17fb6927e8e380e6","sha256:1c68e3cb253f56cbb287ea227991f609f47afe6b8ab704a3ebe8a4063bbbb303"],"state_sha256":"889fdc248f8af7d8def60f131391c7ec6ccda80468bb679ea5cd5429a2db26f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YAoAJ2B7ybgTo2IcOzn5MbBowMa+O5KluIfB6EBJ761s8Z9We1mx/4y+jOr8XKpeQ7HfvJQgSku4jOkmb9NCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:52:29.227653Z","bundle_sha256":"3eb7c3ae21b08cc4ec44a758a7edc076368ccd9f092099aa354dd632f7985456"}}