{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:F36QJPOPFXQVHUIVH6SV4ZGHKD","short_pith_number":"pith:F36QJPOP","schema_version":"1.0","canonical_sha256":"2efd04bdcf2de153d1153fa55e64c750e2f9e802056064d93d62fd2b975a07ed","source":{"kind":"arxiv","id":"1904.02581","version":2},"attestation_state":"computed","paper":{"title":"The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung","submitted_at":"2019-04-04T14:32:48Z","abstract_excerpt":"Supergrid graphs contain grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for general supergrid graphs were known to be NP-complete. A graph is called Hamiltonian if it contains a Hamiltonian cycle, and is said to be Hamiltonian connected if there exists a Hamiltonian path between any two distinct vertices in it. In this paper, we first prove that every L-shaped supergrid graph always contains a Hamiltonian cycle except one trivial condition. We then verify the Hamiltonian connectivity of L-shaped supergrid graphs except few conditions. The Ham"},"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":"1904.02581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-04T14:32:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0860b710195d2b488079431b6c79e1082a920ae29c4470e4a51e804d0baa797f","abstract_canon_sha256":"2aac27abc0da2542d1ab10958085e56f88d3a4614ab84c908fdb459be260a9bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:01.493389Z","signature_b64":"jYbJd4CXSG7/aGfEdXm4XB9Eg9PN40mW0oODHQaayXUMlLkgfSjtHMNbYlRQ/mEzOuUYoobmtSjsNc8if0VNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2efd04bdcf2de153d1153fa55e64c750e2f9e802056064d93d62fd2b975a07ed","last_reissued_at":"2026-05-17T23:47:01.492686Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:01.492686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung","submitted_at":"2019-04-04T14:32:48Z","abstract_excerpt":"Supergrid graphs contain grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for general supergrid graphs were known to be NP-complete. A graph is called Hamiltonian if it contains a Hamiltonian cycle, and is said to be Hamiltonian connected if there exists a Hamiltonian path between any two distinct vertices in it. In this paper, we first prove that every L-shaped supergrid graph always contains a Hamiltonian cycle except one trivial condition. We then verify the Hamiltonian connectivity of L-shaped supergrid graphs except few conditions. The Ham"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02581","kind":"arxiv","version":2},"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":"1904.02581","created_at":"2026-05-17T23:47:01.492803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02581v2","created_at":"2026-05-17T23:47:01.492803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02581","created_at":"2026-05-17T23:47:01.492803+00:00"},{"alias_kind":"pith_short_12","alias_value":"F36QJPOPFXQV","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"F36QJPOPFXQVHUIV","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"F36QJPOP","created_at":"2026-05-18T12:33:15.570797+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/F36QJPOPFXQVHUIVH6SV4ZGHKD","json":"https://pith.science/pith/F36QJPOPFXQVHUIVH6SV4ZGHKD.json","graph_json":"https://pith.science/api/pith-number/F36QJPOPFXQVHUIVH6SV4ZGHKD/graph.json","events_json":"https://pith.science/api/pith-number/F36QJPOPFXQVHUIVH6SV4ZGHKD/events.json","paper":"https://pith.science/paper/F36QJPOP"},"agent_actions":{"view_html":"https://pith.science/pith/F36QJPOPFXQVHUIVH6SV4ZGHKD","download_json":"https://pith.science/pith/F36QJPOPFXQVHUIVH6SV4ZGHKD.json","view_paper":"https://pith.science/paper/F36QJPOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02581&json=true","fetch_graph":"https://pith.science/api/pith-number/F36QJPOPFXQVHUIVH6SV4ZGHKD/graph.json","fetch_events":"https://pith.science/api/pith-number/F36QJPOPFXQVHUIVH6SV4ZGHKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F36QJPOPFXQVHUIVH6SV4ZGHKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F36QJPOPFXQVHUIVH6SV4ZGHKD/action/storage_attestation","attest_author":"https://pith.science/pith/F36QJPOPFXQVHUIVH6SV4ZGHKD/action/author_attestation","sign_citation":"https://pith.science/pith/F36QJPOPFXQVHUIVH6SV4ZGHKD/action/citation_signature","submit_replication":"https://pith.science/pith/F36QJPOPFXQVHUIVH6SV4ZGHKD/action/replication_record"}},"created_at":"2026-05-17T23:47:01.492803+00:00","updated_at":"2026-05-17T23:47:01.492803+00:00"}