{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QZJNPEFSIUUEASIRW67SBEZTZR","short_pith_number":"pith:QZJNPEFS","canonical_record":{"source":{"id":"1005.5525","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-30T13:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"30be6f367b100a46d99cb5d7abbebf816c172cf023138fc9bbd339d34cb50456","abstract_canon_sha256":"53d3b07571fc61e95f0a36f52a0a76759c0adb874574dd30ce9745f36ac1dc36"},"schema_version":"1.0"},"canonical_sha256":"8652d790b24528404911b7bf209333cc59d26ed154496a3314ea6c79ccdc31d5","source":{"kind":"arxiv","id":"1005.5525","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5525","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5525v4","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5525","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"QZJNPEFSIUUE","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"QZJNPEFSIUUEASIR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"QZJNPEFS","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QZJNPEFSIUUEASIRW67SBEZTZR","target":"record","payload":{"canonical_record":{"source":{"id":"1005.5525","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-30T13:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"30be6f367b100a46d99cb5d7abbebf816c172cf023138fc9bbd339d34cb50456","abstract_canon_sha256":"53d3b07571fc61e95f0a36f52a0a76759c0adb874574dd30ce9745f36ac1dc36"},"schema_version":"1.0"},"canonical_sha256":"8652d790b24528404911b7bf209333cc59d26ed154496a3314ea6c79ccdc31d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:25.354176Z","signature_b64":"wLb1dhTD3XuHDJQ3bGd4vitZsYqoU7t+pwYsfotEOK8L3O7WjXFFjSi6qe2akG0j7IOhnN5T8wwyG1deHFdRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8652d790b24528404911b7bf209333cc59d26ed154496a3314ea6c79ccdc31d5","last_reissued_at":"2026-05-18T04:02:25.353721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:25.353721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.5525","source_version":4,"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-18T04:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwCQNnQ91Cj9EuCqnO6COC2o9YUNLH+OIkzXBbE55MFy3LCcHJzBAK+oXUq033EFw5wVGRMNCfKb1zn2MnIZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:26:50.538804Z"},"content_sha256":"1ecdc309165b211d8588692ecaa821783382494d2329989b5f7ede5dbdd725b3","schema_version":"1.0","event_id":"sha256:1ecdc309165b211d8588692ecaa821783382494d2329989b5f7ede5dbdd725b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QZJNPEFSIUUEASIRW67SBEZTZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Karapetyan, Gregory Gutin","submitted_at":"2010-05-30T13:13:09Z","abstract_excerpt":"The Generalized Traveling Salesman Problem (GTSP) is a well-known combinatorial optimization problem with a host of applications. It is an extension of the Traveling Salesman Problem (TSP) where the set of cities is partitioned into so-called clusters, and the salesman has to visit every cluster exactly once.\n  While the GTSP is a very important combinatorial optimization problem and is well studied in many aspects, the local search algorithms used in the literature are mostly basic adaptations of simple TSP heuristics. Hence, a thorough and deep research of the neighborhoods and local search "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5525","kind":"arxiv","version":4},"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-18T04:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5atbm9jL1QByUP2nIkhEvhEFOwWrTtCUyWNGG6VbT2H6DuNDfJ+lnXpnxBV0JMnBpNJNMH46QmpMiwV2c5jaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:26:50.539150Z"},"content_sha256":"b92db2a0e2b07d07d03c06825e27c8b0bc861b91d90eb0e9a9c881c13328840a","schema_version":"1.0","event_id":"sha256:b92db2a0e2b07d07d03c06825e27c8b0bc861b91d90eb0e9a9c881c13328840a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZJNPEFSIUUEASIRW67SBEZTZR/bundle.json","state_url":"https://pith.science/pith/QZJNPEFSIUUEASIRW67SBEZTZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZJNPEFSIUUEASIRW67SBEZTZR/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-23T12:26:50Z","links":{"resolver":"https://pith.science/pith/QZJNPEFSIUUEASIRW67SBEZTZR","bundle":"https://pith.science/pith/QZJNPEFSIUUEASIRW67SBEZTZR/bundle.json","state":"https://pith.science/pith/QZJNPEFSIUUEASIRW67SBEZTZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZJNPEFSIUUEASIRW67SBEZTZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QZJNPEFSIUUEASIRW67SBEZTZR","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":"53d3b07571fc61e95f0a36f52a0a76759c0adb874574dd30ce9745f36ac1dc36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-30T13:13:09Z","title_canon_sha256":"30be6f367b100a46d99cb5d7abbebf816c172cf023138fc9bbd339d34cb50456"},"schema_version":"1.0","source":{"id":"1005.5525","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5525","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5525v4","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5525","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"QZJNPEFSIUUE","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"QZJNPEFSIUUEASIR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"QZJNPEFS","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:b92db2a0e2b07d07d03c06825e27c8b0bc861b91d90eb0e9a9c881c13328840a","target":"graph","created_at":"2026-05-18T04:02:25Z","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":"The Generalized Traveling Salesman Problem (GTSP) is a well-known combinatorial optimization problem with a host of applications. It is an extension of the Traveling Salesman Problem (TSP) where the set of cities is partitioned into so-called clusters, and the salesman has to visit every cluster exactly once.\n  While the GTSP is a very important combinatorial optimization problem and is well studied in many aspects, the local search algorithms used in the literature are mostly basic adaptations of simple TSP heuristics. Hence, a thorough and deep research of the neighborhoods and local search ","authors_text":"Daniel Karapetyan, Gregory Gutin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-30T13:13:09Z","title":"Efficient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5525","kind":"arxiv","version":4},"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:1ecdc309165b211d8588692ecaa821783382494d2329989b5f7ede5dbdd725b3","target":"record","created_at":"2026-05-18T04:02:25Z","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":"53d3b07571fc61e95f0a36f52a0a76759c0adb874574dd30ce9745f36ac1dc36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-30T13:13:09Z","title_canon_sha256":"30be6f367b100a46d99cb5d7abbebf816c172cf023138fc9bbd339d34cb50456"},"schema_version":"1.0","source":{"id":"1005.5525","kind":"arxiv","version":4}},"canonical_sha256":"8652d790b24528404911b7bf209333cc59d26ed154496a3314ea6c79ccdc31d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8652d790b24528404911b7bf209333cc59d26ed154496a3314ea6c79ccdc31d5","first_computed_at":"2026-05-18T04:02:25.353721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:25.353721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wLb1dhTD3XuHDJQ3bGd4vitZsYqoU7t+pwYsfotEOK8L3O7WjXFFjSi6qe2akG0j7IOhnN5T8wwyG1deHFdRCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:25.354176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.5525","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ecdc309165b211d8588692ecaa821783382494d2329989b5f7ede5dbdd725b3","sha256:b92db2a0e2b07d07d03c06825e27c8b0bc861b91d90eb0e9a9c881c13328840a"],"state_sha256":"bd377b0d30fcf14e14b64327bb98d5fd075eb02b3877641ac4582d500628c90b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q64+RyZ66pkLP3oUZhPiIlt3+LMq6WtDAe4MG7jgWXCKqskh64Tm7wM/2asLJS0m1UoWoPsDr9ay66VKJtyNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:26:50.541035Z","bundle_sha256":"74aeabf0b4f39c31f5f9b778482093e764a0b3203c3b2edd429823a9e1349540"}}