{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NWGJOFG3VZ3W5H52SC5DBW3W46","short_pith_number":"pith:NWGJOFG3","canonical_record":{"source":{"id":"1908.07447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-17T11:41:39Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"5d108870342323319200a9d0fd762f71e451d54540ae05ff2c4cd0dc6aad0bf3","abstract_canon_sha256":"d700a4b490838982a772d418aed08bbdbef4f952758afd2b6c683f0d111aef6c"},"schema_version":"1.0"},"canonical_sha256":"6d8c9714dbae776e9fba90ba30db76e7813b6234070229716bf762b2bfcd2c71","source":{"kind":"arxiv","id":"1908.07447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07447","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07447v1","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07447","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"NWGJOFG3VZ3W","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"pith_short_16","alias_value":"NWGJOFG3VZ3W5H52","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"pith_short_8","alias_value":"NWGJOFG3","created_at":"2026-07-04T23:58:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NWGJOFG3VZ3W5H52SC5DBW3W46","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-17T11:41:39Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"5d108870342323319200a9d0fd762f71e451d54540ae05ff2c4cd0dc6aad0bf3","abstract_canon_sha256":"d700a4b490838982a772d418aed08bbdbef4f952758afd2b6c683f0d111aef6c"},"schema_version":"1.0"},"canonical_sha256":"6d8c9714dbae776e9fba90ba30db76e7813b6234070229716bf762b2bfcd2c71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:35.172278Z","signature_b64":"bskw4cjI3+urMx0vyxjNstrPodUDBfJxll5NF/WDiDivtD3/rII0vdP0Rptu21vMyL7KucjcLAlkBmduNZaSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d8c9714dbae776e9fba90ba30db76e7813b6234070229716bf762b2bfcd2c71","last_reissued_at":"2026-07-04T23:58:35.171710Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:35.171710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07447","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-07-04T23:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g94AyknKiAtmcHo8sMB1TBRheevglAJV1EIRexdMo9pgSWE32gkOXFPxYvacRVT/7gAoWcdLZNA4NbR0jj+KBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:42:05.475033Z"},"content_sha256":"36190138c3a0cbf91163f7cf5a149c09e088fc3efb9f93f65a810e26beb8f661","schema_version":"1.0","event_id":"sha256:36190138c3a0cbf91163f7cf5a149c09e088fc3efb9f93f65a810e26beb8f661"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NWGJOFG3VZ3W5H52SC5DBW3W46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung","submitted_at":"2019-08-17T11:41:39Z","abstract_excerpt":"A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates is not larger than 1. The Hamiltonian path (cycle) problem is to determine whether a graph contains a simple path (cycle) in which each vertex of the graph appears exactly once. This problem is NP-complete for general graphs and it is also NP-complete for general supergrid graphs. Despite the many applications of the problem, it is still open for many classes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07447","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07447/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"baV9WdrUEwOjrzbhHHeY+zWzJUkdf2QmzelirgFOV3WpprBS5+gXJaNpViexq6c0q++Ovsr3vmoFYmjFp9drAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:42:05.475536Z"},"content_sha256":"1cb907dfb746015db0939048de9905c7a61141220abf8d9e292ddf26b18f729c","schema_version":"1.0","event_id":"sha256:1cb907dfb746015db0939048de9905c7a61141220abf8d9e292ddf26b18f729c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWGJOFG3VZ3W5H52SC5DBW3W46/bundle.json","state_url":"https://pith.science/pith/NWGJOFG3VZ3W5H52SC5DBW3W46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWGJOFG3VZ3W5H52SC5DBW3W46/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-08-16T08:42:05Z","links":{"resolver":"https://pith.science/pith/NWGJOFG3VZ3W5H52SC5DBW3W46","bundle":"https://pith.science/pith/NWGJOFG3VZ3W5H52SC5DBW3W46/bundle.json","state":"https://pith.science/pith/NWGJOFG3VZ3W5H52SC5DBW3W46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWGJOFG3VZ3W5H52SC5DBW3W46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NWGJOFG3VZ3W5H52SC5DBW3W46","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":"d700a4b490838982a772d418aed08bbdbef4f952758afd2b6c683f0d111aef6c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-17T11:41:39Z","title_canon_sha256":"5d108870342323319200a9d0fd762f71e451d54540ae05ff2c4cd0dc6aad0bf3"},"schema_version":"1.0","source":{"id":"1908.07447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07447","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07447v1","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07447","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"NWGJOFG3VZ3W","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"pith_short_16","alias_value":"NWGJOFG3VZ3W5H52","created_at":"2026-07-04T23:58:35Z"},{"alias_kind":"pith_short_8","alias_value":"NWGJOFG3","created_at":"2026-07-04T23:58:35Z"}],"graph_snapshots":[{"event_id":"sha256:1cb907dfb746015db0939048de9905c7a61141220abf8d9e292ddf26b18f729c","target":"graph","created_at":"2026-07-04T23:58:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07447/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates is not larger than 1. The Hamiltonian path (cycle) problem is to determine whether a graph contains a simple path (cycle) in which each vertex of the graph appears exactly once. This problem is NP-complete for general graphs and it is also NP-complete for general supergrid graphs. Despite the many applications of the problem, it is still open for many classes","authors_text":"Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07447","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:36190138c3a0cbf91163f7cf5a149c09e088fc3efb9f93f65a810e26beb8f661","target":"record","created_at":"2026-07-04T23:58:35Z","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":"d700a4b490838982a772d418aed08bbdbef4f952758afd2b6c683f0d111aef6c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-17T11:41:39Z","title_canon_sha256":"5d108870342323319200a9d0fd762f71e451d54540ae05ff2c4cd0dc6aad0bf3"},"schema_version":"1.0","source":{"id":"1908.07447","kind":"arxiv","version":1}},"canonical_sha256":"6d8c9714dbae776e9fba90ba30db76e7813b6234070229716bf762b2bfcd2c71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d8c9714dbae776e9fba90ba30db76e7813b6234070229716bf762b2bfcd2c71","first_computed_at":"2026-07-04T23:58:35.171710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:35.171710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bskw4cjI3+urMx0vyxjNstrPodUDBfJxll5NF/WDiDivtD3/rII0vdP0Rptu21vMyL7KucjcLAlkBmduNZaSDg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:35.172278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36190138c3a0cbf91163f7cf5a149c09e088fc3efb9f93f65a810e26beb8f661","sha256:1cb907dfb746015db0939048de9905c7a61141220abf8d9e292ddf26b18f729c"],"state_sha256":"e335b343be737f9d7ffedf60e9710b6c5663a8acaa5dcae9cda085893846500e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uatPTczJffzDXpCWyd5vEPxQVpjT1HwBUNdcAd/w/1welOuks9t45mUZolx7JrSJxHZJy7T7Tiye2ghfykIMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:42:05.480544Z","bundle_sha256":"33225409bf6dc21a5cc40c795b0167644bff0c955d7f200289ad02077741fbe2"}}