{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UZBBGNHL4S32FPA2P4HHWKWLCN","short_pith_number":"pith:UZBBGNHL","canonical_record":{"source":{"id":"1902.10337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T05:42:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ec762cdf4de2c8e99f57aa3aa88fec8fe88acc33fe50b86ac9a08b9f9ee66909","abstract_canon_sha256":"03ff33838aa6606233c06577133e068a163495b86b3124da839d52be42d9ec58"},"schema_version":"1.0"},"canonical_sha256":"a6421334ebe4b7a2bc1a7f0e7b2acb1341678e679fed9792f2abea53bcbf5ee7","source":{"kind":"arxiv","id":"1902.10337","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10337","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10337v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10337","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"UZBBGNHL4S32","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UZBBGNHL4S32FPA2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UZBBGNHL","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UZBBGNHL4S32FPA2P4HHWKWLCN","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T05:42:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ec762cdf4de2c8e99f57aa3aa88fec8fe88acc33fe50b86ac9a08b9f9ee66909","abstract_canon_sha256":"03ff33838aa6606233c06577133e068a163495b86b3124da839d52be42d9ec58"},"schema_version":"1.0"},"canonical_sha256":"a6421334ebe4b7a2bc1a7f0e7b2acb1341678e679fed9792f2abea53bcbf5ee7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.156358Z","signature_b64":"N80q2rgwwap1h7m1xeKGNfs1KoKa/gE8Jy5yryZe9KnxXBv6uIAFSnZM/DhfJ2ZSLrQpuIvZFcHkXjKMZ15VCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6421334ebe4b7a2bc1a7f0e7b2acb1341678e679fed9792f2abea53bcbf5ee7","last_reissued_at":"2026-05-17T23:52:31.155726Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.155726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10337","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"candOBchh7n8d8N7T2jg+kQJHFehV2T5FYrUaQ/ZQWBt5X+A3+21mtcKZ6KeCcSycgcZmLamPlHOEY4NtgQOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:29:51.583993Z"},"content_sha256":"d9d126c4d47f4545c4d89d5e9e56905a3acf2d55b3c7e5827524bef6294f71f0","schema_version":"1.0","event_id":"sha256:d9d126c4d47f4545c4d89d5e9e56905a3acf2d55b3c7e5827524bef6294f71f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UZBBGNHL4S32FPA2P4HHWKWLCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic \"Snakes and Ladders\" Heuristic for the Hamiltonian Cycle Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jerzy A Filar, Michael Haythorpe, Pouya Baniasadi, Serguei Rossomakhine, Vladimir Ejov","submitted_at":"2019-02-27T05:42:05Z","abstract_excerpt":"We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian Cycle Problem (HCP) in an undirected graph of order $n$. Although finding a Hamiltonian cycle is not theoretically guaranteed, we have observed that the heuristic is successful even in cases where such cycles are extremely rare, and it also performs very well on all HCP instances of large graphs listed on the TSPLIB web page. The heuristic owes its name to a visualisation of its iterations. All vertices of the graph are placed on a given circle in some order. The graph's edges are classified as either snak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10337","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkiSFMAzaVKkfqiLWZ/z0JTbmMb0jdkL+yW+h/XgjBkeAzX9uDi9AAdpCRn5cbdjPidrT3D/QfXA4lwFgZ3aDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:29:51.584350Z"},"content_sha256":"d60d3b715f51c56bebd324704b3078fc9b972a6c8ec434668e614296d5242bb9","schema_version":"1.0","event_id":"sha256:d60d3b715f51c56bebd324704b3078fc9b972a6c8ec434668e614296d5242bb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZBBGNHL4S32FPA2P4HHWKWLCN/bundle.json","state_url":"https://pith.science/pith/UZBBGNHL4S32FPA2P4HHWKWLCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZBBGNHL4S32FPA2P4HHWKWLCN/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-06-01T16:29:51Z","links":{"resolver":"https://pith.science/pith/UZBBGNHL4S32FPA2P4HHWKWLCN","bundle":"https://pith.science/pith/UZBBGNHL4S32FPA2P4HHWKWLCN/bundle.json","state":"https://pith.science/pith/UZBBGNHL4S32FPA2P4HHWKWLCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZBBGNHL4S32FPA2P4HHWKWLCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UZBBGNHL4S32FPA2P4HHWKWLCN","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":"03ff33838aa6606233c06577133e068a163495b86b3124da839d52be42d9ec58","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T05:42:05Z","title_canon_sha256":"ec762cdf4de2c8e99f57aa3aa88fec8fe88acc33fe50b86ac9a08b9f9ee66909"},"schema_version":"1.0","source":{"id":"1902.10337","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10337","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10337v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10337","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"UZBBGNHL4S32","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UZBBGNHL4S32FPA2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UZBBGNHL","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:d60d3b715f51c56bebd324704b3078fc9b972a6c8ec434668e614296d5242bb9","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian Cycle Problem (HCP) in an undirected graph of order $n$. Although finding a Hamiltonian cycle is not theoretically guaranteed, we have observed that the heuristic is successful even in cases where such cycles are extremely rare, and it also performs very well on all HCP instances of large graphs listed on the TSPLIB web page. The heuristic owes its name to a visualisation of its iterations. All vertices of the graph are placed on a given circle in some order. The graph's edges are classified as either snak","authors_text":"Jerzy A Filar, Michael Haythorpe, Pouya Baniasadi, Serguei Rossomakhine, Vladimir Ejov","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T05:42:05Z","title":"Deterministic \"Snakes and Ladders\" Heuristic for the Hamiltonian Cycle Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10337","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:d9d126c4d47f4545c4d89d5e9e56905a3acf2d55b3c7e5827524bef6294f71f0","target":"record","created_at":"2026-05-17T23:52:31Z","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":"03ff33838aa6606233c06577133e068a163495b86b3124da839d52be42d9ec58","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T05:42:05Z","title_canon_sha256":"ec762cdf4de2c8e99f57aa3aa88fec8fe88acc33fe50b86ac9a08b9f9ee66909"},"schema_version":"1.0","source":{"id":"1902.10337","kind":"arxiv","version":1}},"canonical_sha256":"a6421334ebe4b7a2bc1a7f0e7b2acb1341678e679fed9792f2abea53bcbf5ee7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6421334ebe4b7a2bc1a7f0e7b2acb1341678e679fed9792f2abea53bcbf5ee7","first_computed_at":"2026-05-17T23:52:31.155726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.155726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N80q2rgwwap1h7m1xeKGNfs1KoKa/gE8Jy5yryZe9KnxXBv6uIAFSnZM/DhfJ2ZSLrQpuIvZFcHkXjKMZ15VCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.156358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10337","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9d126c4d47f4545c4d89d5e9e56905a3acf2d55b3c7e5827524bef6294f71f0","sha256:d60d3b715f51c56bebd324704b3078fc9b972a6c8ec434668e614296d5242bb9"],"state_sha256":"8db17b1f21a7e68fa32c06911f296db1ac4c5f781ae3f36ba57bd3b2a18cefdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7RktYZTj/57n3vWB8dt+HtYs8hh/y0mk4IFvAYCSHOuLSrzQc8rXIuFeC9EzyO4D/8HlrWanJtgl0KgwPXMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:29:51.586476Z","bundle_sha256":"2de68ede483c811d0fc5556cd0655df52d16405e10cd54615c2d59399c332e63"}}