{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IYQIFYN4PYW7BO3WHOZSBCMH6B","short_pith_number":"pith:IYQIFYN4","schema_version":"1.0","canonical_sha256":"462082e1bc7e2df0bb763bb3208987f041e51b64b6e21e992d2d2bd00bea972b","source":{"kind":"arxiv","id":"2302.06582","version":5},"attestation_state":"computed","paper":{"title":"A Convex Hull Cheapest Insertion Heuristic for the Non-Euclidean TSP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.AI","authors_text":"Meghna Menon, Mithun Goutham, Sarah Garrow, Stephanie Stockar","submitted_at":"2023-02-05T13:56:19Z","abstract_excerpt":"The convex hull cheapest insertion heuristic produces good solutions to the Euclidean Traveling Salesperson Problem, but it has never been extended to the non-Euclidean problem. This paper uses multidimensional scaling to first project the points from a non-Euclidean space into a Euclidean space, enabling the generation of a convex hull that initializes the algorithm. To evaluate the proposed algorithm, non-Euclidean spaces are created by adding separators to the TSPLIB data-set, or by using the L1 norm as a metric."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2302.06582","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-02-05T13:56:19Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"6f17883b7f32c4c3b6aeaf8b60b548803c59fd898706a1f41292cbaba08fbd4a","abstract_canon_sha256":"732c1aa170ab5032797b7f6f4dd7d6d71e37512acda51b1886d322810031ecb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:39:26.439310Z","signature_b64":"jZ/9FxHOEuyyMNcCDOn02A2pCsPtWdl9EKlUmqYkDiM4guKEkzg1pfzjDpbPJL8sS5+yeqjKvGxhBuRFZtJfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"462082e1bc7e2df0bb763bb3208987f041e51b64b6e21e992d2d2bd00bea972b","last_reissued_at":"2026-07-05T08:39:26.438890Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:39:26.438890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convex Hull Cheapest Insertion Heuristic for the Non-Euclidean TSP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.AI","authors_text":"Meghna Menon, Mithun Goutham, Sarah Garrow, Stephanie Stockar","submitted_at":"2023-02-05T13:56:19Z","abstract_excerpt":"The convex hull cheapest insertion heuristic produces good solutions to the Euclidean Traveling Salesperson Problem, but it has never been extended to the non-Euclidean problem. This paper uses multidimensional scaling to first project the points from a non-Euclidean space into a Euclidean space, enabling the generation of a convex hull that initializes the algorithm. To evaluate the proposed algorithm, non-Euclidean spaces are created by adding separators to the TSPLIB data-set, or by using the L1 norm as a metric."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06582","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.06582/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.06582","created_at":"2026-07-05T08:39:26.438946+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06582v5","created_at":"2026-07-05T08:39:26.438946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06582","created_at":"2026-07-05T08:39:26.438946+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYQIFYN4PYW7","created_at":"2026-07-05T08:39:26.438946+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYQIFYN4PYW7BO3W","created_at":"2026-07-05T08:39:26.438946+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYQIFYN4","created_at":"2026-07-05T08:39:26.438946+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B","json":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B.json","graph_json":"https://pith.science/api/pith-number/IYQIFYN4PYW7BO3WHOZSBCMH6B/graph.json","events_json":"https://pith.science/api/pith-number/IYQIFYN4PYW7BO3WHOZSBCMH6B/events.json","paper":"https://pith.science/paper/IYQIFYN4"},"agent_actions":{"view_html":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B","download_json":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B.json","view_paper":"https://pith.science/paper/IYQIFYN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06582&json=true","fetch_graph":"https://pith.science/api/pith-number/IYQIFYN4PYW7BO3WHOZSBCMH6B/graph.json","fetch_events":"https://pith.science/api/pith-number/IYQIFYN4PYW7BO3WHOZSBCMH6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B/action/storage_attestation","attest_author":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B/action/author_attestation","sign_citation":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B/action/citation_signature","submit_replication":"https://pith.science/pith/IYQIFYN4PYW7BO3WHOZSBCMH6B/action/replication_record"}},"created_at":"2026-07-05T08:39:26.438946+00:00","updated_at":"2026-07-05T08:39:26.438946+00:00"}