{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2NKEY7EVSMLIDTVSES6VX65YAK","short_pith_number":"pith:2NKEY7EV","schema_version":"1.0","canonical_sha256":"d3544c7c95931681ceb224bd5bfbb802ad6e320ed7dc213a85541c8cb5a6a2a4","source":{"kind":"arxiv","id":"2401.16149","version":1},"attestation_state":"computed","paper":{"title":"A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Birte Ostermann, Sabrina C.L. Ammann, Sebastian Stiller, Timo de Wolff","submitted_at":"2024-01-29T13:26:36Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metric case. Building upon elaborate research, state-of-the-art exact solvers such as CONCORDE can solve TSP instances with several ten thousand vertices. A key ingredient for these integer programming approaches are fast heuristics to find a good initial solution, in particular the Lin-Kernighan-Helsgaun (LKH) heuristic. For instances with few hundred vertices heuristics like LKH often find an optimal solution. In this w"},"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":"2401.16149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-29T13:26:36Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"4ed8ba61f472f8e753eab97c5caea6f19a656f24f51cc984a94e8a8e27bd7112","abstract_canon_sha256":"8a3e8ca58c40ef6bf30a4c04cfa5780c7aedd7a6453695a61ea75d90cdd6adb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:44.712548Z","signature_b64":"lFjuS5WOcpCjIMq6K2n6Ug2eiYlDvIYTIEI5zvXvSTQ86mRDEa8tM2w1X6xWwgBwFxmfRnTErs1Kat0kL70nDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3544c7c95931681ceb224bd5bfbb802ad6e320ed7dc213a85541c8cb5a6a2a4","last_reissued_at":"2026-07-05T07:38:44.712155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:44.712155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Birte Ostermann, Sabrina C.L. Ammann, Sebastian Stiller, Timo de Wolff","submitted_at":"2024-01-29T13:26:36Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metric case. Building upon elaborate research, state-of-the-art exact solvers such as CONCORDE can solve TSP instances with several ten thousand vertices. A key ingredient for these integer programming approaches are fast heuristics to find a good initial solution, in particular the Lin-Kernighan-Helsgaun (LKH) heuristic. For instances with few hundred vertices heuristics like LKH often find an optimal solution. In this w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.16149","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.16149/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":"2401.16149","created_at":"2026-07-05T07:38:44.712210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.16149v1","created_at":"2026-07-05T07:38:44.712210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.16149","created_at":"2026-07-05T07:38:44.712210+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NKEY7EVSMLI","created_at":"2026-07-05T07:38:44.712210+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NKEY7EVSMLIDTVS","created_at":"2026-07-05T07:38:44.712210+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NKEY7EV","created_at":"2026-07-05T07:38:44.712210+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/2NKEY7EVSMLIDTVSES6VX65YAK","json":"https://pith.science/pith/2NKEY7EVSMLIDTVSES6VX65YAK.json","graph_json":"https://pith.science/api/pith-number/2NKEY7EVSMLIDTVSES6VX65YAK/graph.json","events_json":"https://pith.science/api/pith-number/2NKEY7EVSMLIDTVSES6VX65YAK/events.json","paper":"https://pith.science/paper/2NKEY7EV"},"agent_actions":{"view_html":"https://pith.science/pith/2NKEY7EVSMLIDTVSES6VX65YAK","download_json":"https://pith.science/pith/2NKEY7EVSMLIDTVSES6VX65YAK.json","view_paper":"https://pith.science/paper/2NKEY7EV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.16149&json=true","fetch_graph":"https://pith.science/api/pith-number/2NKEY7EVSMLIDTVSES6VX65YAK/graph.json","fetch_events":"https://pith.science/api/pith-number/2NKEY7EVSMLIDTVSES6VX65YAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NKEY7EVSMLIDTVSES6VX65YAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NKEY7EVSMLIDTVSES6VX65YAK/action/storage_attestation","attest_author":"https://pith.science/pith/2NKEY7EVSMLIDTVSES6VX65YAK/action/author_attestation","sign_citation":"https://pith.science/pith/2NKEY7EVSMLIDTVSES6VX65YAK/action/citation_signature","submit_replication":"https://pith.science/pith/2NKEY7EVSMLIDTVSES6VX65YAK/action/replication_record"}},"created_at":"2026-07-05T07:38:44.712210+00:00","updated_at":"2026-07-05T07:38:44.712210+00:00"}