{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5LEZUNVH62H5FYNT4EPVXGY6KS","short_pith_number":"pith:5LEZUNVH","canonical_record":{"source":{"id":"1703.03963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-11T12:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"292d79a81640e4358ca77ed6b1a94dc4088e25a90208aa18b645cffd51414292","abstract_canon_sha256":"49494f851f1a8ba5ca08d21efb10403e5f3ce9bf4b7b3e01a156f01509c38cef"},"schema_version":"1.0"},"canonical_sha256":"eac99a36a7f68fd2e1b3e11f5b9b1e54a128b83cc93e9597aacfa3a0db36bd0f","source":{"kind":"arxiv","id":"1703.03963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03963","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03963v1","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03963","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"5LEZUNVH62H5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5LEZUNVH62H5FYNT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5LEZUNVH","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5LEZUNVH62H5FYNT4EPVXGY6KS","target":"record","payload":{"canonical_record":{"source":{"id":"1703.03963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-11T12:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"292d79a81640e4358ca77ed6b1a94dc4088e25a90208aa18b645cffd51414292","abstract_canon_sha256":"49494f851f1a8ba5ca08d21efb10403e5f3ce9bf4b7b3e01a156f01509c38cef"},"schema_version":"1.0"},"canonical_sha256":"eac99a36a7f68fd2e1b3e11f5b9b1e54a128b83cc93e9597aacfa3a0db36bd0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:52.578853Z","signature_b64":"DmVGZHf4NO5fmF6MrnaJFvI5M04ZednEaZjBfb8RTWz0C94wdyzcaRTjvJx8JSjPYIF7hVNYHFtQNB1UBaS/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eac99a36a7f68fd2e1b3e11f5b9b1e54a128b83cc93e9597aacfa3a0db36bd0f","last_reissued_at":"2026-05-18T00:48:52.578004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:52.578004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.03963","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:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nP5Q0rpOGY53bYoQzcEbHZW9PW7Wt+aU0oCiGHNvEXsljxrRlMb0xk10P0j8S7UQ9cib3TOeGaXGYeBLwDV+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:02:27.635678Z"},"content_sha256":"2c3f7c0b6ec41c54e0b361cda83d90f281cc8e1233fd376e6061f0d773818cd9","schema_version":"1.0","event_id":"sha256:2c3f7c0b6ec41c54e0b361cda83d90f281cc8e1233fd376e6061f0d773818cd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5LEZUNVH62H5FYNT4EPVXGY6KS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Solving Travelling Salesman Problem with Vertex Requisitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anton Eremeev, Yulia Kovalenko","submitted_at":"2017-03-11T12:24:19Z","abstract_excerpt":"We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard. The proposed algorithm for this problem has less time complexity compared to the previously known one. In particular, almost all feasible instances of the problem are solvable in O(n) time using the new algorithm, where n is the number of vertices. The developed approach also helps in fast enumeration of a neighborhood in the local search and yields an integer programming model with O(n) binary varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03963","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:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGM8idBIpxgpYDn1KCAGYcGD4Wk7UVapF+ZEUiUfzOl7opIi+HEAntKCpP/I8ZpP0g4GDKzRggQ4QFZNuWzPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:02:27.636186Z"},"content_sha256":"603cb0d3e03f574722d41557384228c9d003202a44b313524f7dfc1fb1df76dc","schema_version":"1.0","event_id":"sha256:603cb0d3e03f574722d41557384228c9d003202a44b313524f7dfc1fb1df76dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LEZUNVH62H5FYNT4EPVXGY6KS/bundle.json","state_url":"https://pith.science/pith/5LEZUNVH62H5FYNT4EPVXGY6KS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LEZUNVH62H5FYNT4EPVXGY6KS/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-04T17:02:27Z","links":{"resolver":"https://pith.science/pith/5LEZUNVH62H5FYNT4EPVXGY6KS","bundle":"https://pith.science/pith/5LEZUNVH62H5FYNT4EPVXGY6KS/bundle.json","state":"https://pith.science/pith/5LEZUNVH62H5FYNT4EPVXGY6KS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LEZUNVH62H5FYNT4EPVXGY6KS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5LEZUNVH62H5FYNT4EPVXGY6KS","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":"49494f851f1a8ba5ca08d21efb10403e5f3ce9bf4b7b3e01a156f01509c38cef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-11T12:24:19Z","title_canon_sha256":"292d79a81640e4358ca77ed6b1a94dc4088e25a90208aa18b645cffd51414292"},"schema_version":"1.0","source":{"id":"1703.03963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03963","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03963v1","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03963","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"5LEZUNVH62H5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5LEZUNVH62H5FYNT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5LEZUNVH","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:603cb0d3e03f574722d41557384228c9d003202a44b313524f7dfc1fb1df76dc","target":"graph","created_at":"2026-05-18T00:48:52Z","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 consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard. The proposed algorithm for this problem has less time complexity compared to the previously known one. In particular, almost all feasible instances of the problem are solvable in O(n) time using the new algorithm, where n is the number of vertices. The developed approach also helps in fast enumeration of a neighborhood in the local search and yields an integer programming model with O(n) binary varia","authors_text":"Anton Eremeev, Yulia Kovalenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-11T12:24:19Z","title":"On Solving Travelling Salesman Problem with Vertex Requisitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03963","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:2c3f7c0b6ec41c54e0b361cda83d90f281cc8e1233fd376e6061f0d773818cd9","target":"record","created_at":"2026-05-18T00:48:52Z","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":"49494f851f1a8ba5ca08d21efb10403e5f3ce9bf4b7b3e01a156f01509c38cef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-11T12:24:19Z","title_canon_sha256":"292d79a81640e4358ca77ed6b1a94dc4088e25a90208aa18b645cffd51414292"},"schema_version":"1.0","source":{"id":"1703.03963","kind":"arxiv","version":1}},"canonical_sha256":"eac99a36a7f68fd2e1b3e11f5b9b1e54a128b83cc93e9597aacfa3a0db36bd0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eac99a36a7f68fd2e1b3e11f5b9b1e54a128b83cc93e9597aacfa3a0db36bd0f","first_computed_at":"2026-05-18T00:48:52.578004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:52.578004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DmVGZHf4NO5fmF6MrnaJFvI5M04ZednEaZjBfb8RTWz0C94wdyzcaRTjvJx8JSjPYIF7hVNYHFtQNB1UBaS/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:52.578853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c3f7c0b6ec41c54e0b361cda83d90f281cc8e1233fd376e6061f0d773818cd9","sha256:603cb0d3e03f574722d41557384228c9d003202a44b313524f7dfc1fb1df76dc"],"state_sha256":"9b414628c44278f67cfa59f440962715c058bc012f91af44caee7d9ebfef6002"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVGV3JJVdKZFrvn0CXxzpie8OCQe3X8Uj4rYLEu7/AoJiPE7c6HZI/6FAw7YEASC3m9LA4d9GsOBtTSXYbI9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:02:27.638310Z","bundle_sha256":"3f37c1f6d7416439e4f860f1d484344303361df1eb820bdf552bd427a044f522"}}