{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2NIU2ULFMMXL4TMTADOYWPPIWZ","short_pith_number":"pith:2NIU2ULF","canonical_record":{"source":{"id":"1705.09058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-25T06:21:39Z","cross_cats_sorted":[],"title_canon_sha256":"ed259162ccd51faceaf5a9f27069b0363bf18359511e927bd5bcf9b006a29a0a","abstract_canon_sha256":"b976142f89169d91c98908b5b3409801ee1be0221c15af732d035f672b80b886"},"schema_version":"1.0"},"canonical_sha256":"d3514d5165632ebe4d9300dd8b3de8b66617e7ed9dbde8d4825e4df6bab0b295","source":{"kind":"arxiv","id":"1705.09058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09058","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09058v1","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09058","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"pith_short_12","alias_value":"2NIU2ULFMMXL","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NIU2ULFMMXL4TMT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NIU2ULF","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2NIU2ULFMMXL4TMTADOYWPPIWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-25T06:21:39Z","cross_cats_sorted":[],"title_canon_sha256":"ed259162ccd51faceaf5a9f27069b0363bf18359511e927bd5bcf9b006a29a0a","abstract_canon_sha256":"b976142f89169d91c98908b5b3409801ee1be0221c15af732d035f672b80b886"},"schema_version":"1.0"},"canonical_sha256":"d3514d5165632ebe4d9300dd8b3de8b66617e7ed9dbde8d4825e4df6bab0b295","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:40.529838Z","signature_b64":"b2T8lR1KEWn9mN7RDbrh42fSIV+0QRHeVGatYGtTHJGo8eVkFmlixLyxkw827AOH9pvhkJoL4naebWqrts1UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3514d5165632ebe4d9300dd8b3de8b66617e7ed9dbde8d4825e4df6bab0b295","last_reissued_at":"2026-05-18T00:43:40.529121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:40.529121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09058","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:43:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgCfuWZKxBQDGjAWFodEfiYCKPO4QRZEM/7uSPKseuBCk6r49d1UMuvb/DcLwvkPsLLRDCRGyp3DRIH0ZTzTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:00:31.962358Z"},"content_sha256":"820e5ab140d75cacdbb3e5d5f171cc6e4474329940a765ec1464da7cac8ff71a","schema_version":"1.0","event_id":"sha256:820e5ab140d75cacdbb3e5d5f171cc6e4474329940a765ec1464da7cac8ff71a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2NIU2ULFMMXL4TMTADOYWPPIWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ming Xiang, Yihui He","submitted_at":"2017-05-25T06:21:39Z","abstract_excerpt":"With applications to many disciplines, the traveling salesman problem (TSP) is a classical computer science optimization problem with applications to industrial engineering, theoretical computer science, bioinformatics, and several other disciplines. In recent years, there have been a plethora of novel approaches for approximate solutions ranging from simplistic greedy to cooperative distributed algorithms derived from artificial intelligence. In this paper, we perform an evaluation and analysis of cornerstone algorithms for the Euclidean TSP. We evaluate greedy, 2-opt, and genetic algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09058","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:43:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmmOBcrjZ59Q2gPnQVTvtrLG/LN/ympD5yLpP0LO3/iGH/rGXMPHf/vHifzqy8afeERApepUI3j7ofw3vcZVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:00:31.962712Z"},"content_sha256":"e59da29161cb344c85043a567c7e16fbc8d910ac84a9f6990ff4db6dfe8fda88","schema_version":"1.0","event_id":"sha256:e59da29161cb344c85043a567c7e16fbc8d910ac84a9f6990ff4db6dfe8fda88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NIU2ULFMMXL4TMTADOYWPPIWZ/bundle.json","state_url":"https://pith.science/pith/2NIU2ULFMMXL4TMTADOYWPPIWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NIU2ULFMMXL4TMTADOYWPPIWZ/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-05T15:00:31Z","links":{"resolver":"https://pith.science/pith/2NIU2ULFMMXL4TMTADOYWPPIWZ","bundle":"https://pith.science/pith/2NIU2ULFMMXL4TMTADOYWPPIWZ/bundle.json","state":"https://pith.science/pith/2NIU2ULFMMXL4TMTADOYWPPIWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NIU2ULFMMXL4TMTADOYWPPIWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2NIU2ULFMMXL4TMTADOYWPPIWZ","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":"b976142f89169d91c98908b5b3409801ee1be0221c15af732d035f672b80b886","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-25T06:21:39Z","title_canon_sha256":"ed259162ccd51faceaf5a9f27069b0363bf18359511e927bd5bcf9b006a29a0a"},"schema_version":"1.0","source":{"id":"1705.09058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09058","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09058v1","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09058","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"pith_short_12","alias_value":"2NIU2ULFMMXL","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NIU2ULFMMXL4TMT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NIU2ULF","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:e59da29161cb344c85043a567c7e16fbc8d910ac84a9f6990ff4db6dfe8fda88","target":"graph","created_at":"2026-05-18T00:43:40Z","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":"With applications to many disciplines, the traveling salesman problem (TSP) is a classical computer science optimization problem with applications to industrial engineering, theoretical computer science, bioinformatics, and several other disciplines. In recent years, there have been a plethora of novel approaches for approximate solutions ranging from simplistic greedy to cooperative distributed algorithms derived from artificial intelligence. In this paper, we perform an evaluation and analysis of cornerstone algorithms for the Euclidean TSP. We evaluate greedy, 2-opt, and genetic algorithms.","authors_text":"Ming Xiang, Yihui He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-25T06:21:39Z","title":"An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09058","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:820e5ab140d75cacdbb3e5d5f171cc6e4474329940a765ec1464da7cac8ff71a","target":"record","created_at":"2026-05-18T00:43:40Z","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":"b976142f89169d91c98908b5b3409801ee1be0221c15af732d035f672b80b886","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-25T06:21:39Z","title_canon_sha256":"ed259162ccd51faceaf5a9f27069b0363bf18359511e927bd5bcf9b006a29a0a"},"schema_version":"1.0","source":{"id":"1705.09058","kind":"arxiv","version":1}},"canonical_sha256":"d3514d5165632ebe4d9300dd8b3de8b66617e7ed9dbde8d4825e4df6bab0b295","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3514d5165632ebe4d9300dd8b3de8b66617e7ed9dbde8d4825e4df6bab0b295","first_computed_at":"2026-05-18T00:43:40.529121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:40.529121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b2T8lR1KEWn9mN7RDbrh42fSIV+0QRHeVGatYGtTHJGo8eVkFmlixLyxkw827AOH9pvhkJoL4naebWqrts1UBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:40.529838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:820e5ab140d75cacdbb3e5d5f171cc6e4474329940a765ec1464da7cac8ff71a","sha256:e59da29161cb344c85043a567c7e16fbc8d910ac84a9f6990ff4db6dfe8fda88"],"state_sha256":"225075efea82ec5c131699b6736e88d8204d1718b292e2ec3b9b86fde024b8b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtkHQy11msg/BVLSo/h++uOXpYH+GmFSraAm4q8f5D0g6fZ7Dpj3EGSaS8FZnaVtUQEM8JlZdhkw+mkRZwxdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:00:31.964710Z","bundle_sha256":"ad2b02c3bf522712efea12fa431fa6846bbef1fdc3b2a1bad8a6106d8dbc3e3e"}}