{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BTAZ7HK7PFOKU2L5K4RBW3DVRO","short_pith_number":"pith:BTAZ7HK7","canonical_record":{"source":{"id":"1705.06855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T04:06:13Z","cross_cats_sorted":[],"title_canon_sha256":"fa6f5628f31b510c970bca1e0432d6ef7ada06452937c26c849f07ad0d5f2f15","abstract_canon_sha256":"b4a94d5141454285b297a0056c3c41d19dfc2417aabb2060eb1849731f2e83ce"},"schema_version":"1.0"},"canonical_sha256":"0cc19f9d5f795caa697d57221b6c758ba1dd00a29f19eb8eef09659caed63a47","source":{"kind":"arxiv","id":"1705.06855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06855","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06855v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06855","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"BTAZ7HK7PFOK","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BTAZ7HK7PFOKU2L5","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BTAZ7HK7","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BTAZ7HK7PFOKU2L5K4RBW3DVRO","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T04:06:13Z","cross_cats_sorted":[],"title_canon_sha256":"fa6f5628f31b510c970bca1e0432d6ef7ada06452937c26c849f07ad0d5f2f15","abstract_canon_sha256":"b4a94d5141454285b297a0056c3c41d19dfc2417aabb2060eb1849731f2e83ce"},"schema_version":"1.0"},"canonical_sha256":"0cc19f9d5f795caa697d57221b6c758ba1dd00a29f19eb8eef09659caed63a47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:11.142773Z","signature_b64":"7uwQ1O3LqtBKnPiD1NhqbTHNhTeXcKBRXrpV+o57JTbGPRswd8VbaQnHz8zGfw3g3ucba278arfQLyu1lpCyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc19f9d5f795caa697d57221b6c758ba1dd00a29f19eb8eef09659caed63a47","last_reissued_at":"2026-05-18T00:44:11.142259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:11.142259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06855","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:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nS8roZlccwJza09Pk3EyKcv67mjEjLrNVhBSsG/YrhyPGP0HKDcmhs8ALCBXOpsbyisiBAQof1NDhCX89XVOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:44:39.476118Z"},"content_sha256":"0fd270caa4c63e9c5788e181ffcd91a475dc8e01262123f1ab29cb1c3a3a5fb1","schema_version":"1.0","event_id":"sha256:0fd270caa4c63e9c5788e181ffcd91a475dc8e01262123f1ab29cb1c3a3a5fb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BTAZ7HK7PFOKU2L5K4RBW3DVRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Haythorpe, Serguei Rossomakhine, Vladimir Ejov","submitted_at":"2017-05-19T04:06:13Z","abstract_excerpt":"We describe a hybrid procedure for solving the traveling salesman problem (TSP) to provable optimality. We first sparsify the instance, and then use a hybrid algorithm that combines a branch-and-cut TSP solver with a Hamiltonian cycle problem solver. We demonstrate that this procedure enables us to solve difficult instances to optimality, including one which had remained unsolved since its construction in 2002."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06855","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:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzbUROp+925DXKBELaLDFQ1lr449CxvDb8AFuxiYkfgmTeoaL0Gy/m3SesNibfjAMLjGoCXu45jI5F1+A6LaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:44:39.476487Z"},"content_sha256":"9830fbff4cc50b816bf7566580bea509e07c7c94dc591483d67f45d1459bd3c4","schema_version":"1.0","event_id":"sha256:9830fbff4cc50b816bf7566580bea509e07c7c94dc591483d67f45d1459bd3c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/bundle.json","state_url":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/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-31T08:44:39Z","links":{"resolver":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO","bundle":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/bundle.json","state":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BTAZ7HK7PFOKU2L5K4RBW3DVRO","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":"b4a94d5141454285b297a0056c3c41d19dfc2417aabb2060eb1849731f2e83ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T04:06:13Z","title_canon_sha256":"fa6f5628f31b510c970bca1e0432d6ef7ada06452937c26c849f07ad0d5f2f15"},"schema_version":"1.0","source":{"id":"1705.06855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06855","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06855v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06855","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"BTAZ7HK7PFOK","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BTAZ7HK7PFOKU2L5","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BTAZ7HK7","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:9830fbff4cc50b816bf7566580bea509e07c7c94dc591483d67f45d1459bd3c4","target":"graph","created_at":"2026-05-18T00:44: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":"We describe a hybrid procedure for solving the traveling salesman problem (TSP) to provable optimality. We first sparsify the instance, and then use a hybrid algorithm that combines a branch-and-cut TSP solver with a Hamiltonian cycle problem solver. We demonstrate that this procedure enables us to solve difficult instances to optimality, including one which had remained unsolved since its construction in 2002.","authors_text":"Michael Haythorpe, Serguei Rossomakhine, Vladimir Ejov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T04:06:13Z","title":"Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06855","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:0fd270caa4c63e9c5788e181ffcd91a475dc8e01262123f1ab29cb1c3a3a5fb1","target":"record","created_at":"2026-05-18T00:44: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":"b4a94d5141454285b297a0056c3c41d19dfc2417aabb2060eb1849731f2e83ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T04:06:13Z","title_canon_sha256":"fa6f5628f31b510c970bca1e0432d6ef7ada06452937c26c849f07ad0d5f2f15"},"schema_version":"1.0","source":{"id":"1705.06855","kind":"arxiv","version":1}},"canonical_sha256":"0cc19f9d5f795caa697d57221b6c758ba1dd00a29f19eb8eef09659caed63a47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cc19f9d5f795caa697d57221b6c758ba1dd00a29f19eb8eef09659caed63a47","first_computed_at":"2026-05-18T00:44:11.142259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:11.142259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7uwQ1O3LqtBKnPiD1NhqbTHNhTeXcKBRXrpV+o57JTbGPRswd8VbaQnHz8zGfw3g3ucba278arfQLyu1lpCyAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:11.142773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fd270caa4c63e9c5788e181ffcd91a475dc8e01262123f1ab29cb1c3a3a5fb1","sha256:9830fbff4cc50b816bf7566580bea509e07c7c94dc591483d67f45d1459bd3c4"],"state_sha256":"c9645721fef24f50ee443961836bf668cc0bc85a26b44571778c4e42c8aa24c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3LJeknR5Qh4DPIz5PQJWLIGyorne7evILlH0767y3lQtH71u/pBh160D1ddh1mASEQWGU34rsYeQq//7q4oDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:44:39.478415Z","bundle_sha256":"5b6596d1d76cae8ed5d02f7e33e550db5a72c2bf99c1bc4fbd2fd4b71de74ba6"}}