{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z6DBQHJMNM6YLIS2DYUWQAYSNK","short_pith_number":"pith:Z6DBQHJM","schema_version":"1.0","canonical_sha256":"cf86181d2c6b3d85a25a1e296803126abff051e2c7fe2be6ac89f16857f98ae9","source":{"kind":"arxiv","id":"2411.14745","version":2},"attestation_state":"computed","paper":{"title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Omri Weinstein, Sorrachai Yingchareonthawornchai, Zhuan Khye Koh","submitted_at":"2024-11-22T05:46:06Z","abstract_excerpt":"We present a nearly linear work parallel algorithm for approximating the Held-Karp bound for the Metric TSP problem. Given an edge-weighted undirected graph $G=(V,E)$ on $m$ edges and $\\epsilon>0$, it returns a $(1+\\epsilon)$-approximation to the Held-Karp bound with high probability, in $\\tilde{O}(m/\\epsilon^4)$ work and $\\tilde{O}(1/\\epsilon^4)$ depth. While a nearly linear time sequential algorithm was known for almost a decade (Chekuri and Quanrud'17), it was not known how to simultaneously achieve nearly linear work alongside polylogarithmic depth. Using a reduction by Chalermsook et al.'"},"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":"2411.14745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-22T05:46:06Z","cross_cats_sorted":[],"title_canon_sha256":"febb765c85db1161714074d2ee572d7e478bd31a011be3f46f64c67cd7c3d8cb","abstract_canon_sha256":"6c779d8a073e7cba6d880cc32d221511b54ca5b7bdbcc8698342101e2f5d4475"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:40.481836Z","signature_b64":"q12YiHIDL/swSA0X3UlxeVmSRxiwS/h2eYim6KG22FBW5bVcT9zVMkybHmCkdVLMz/vg4Ub/lZd74xb3NqnuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf86181d2c6b3d85a25a1e296803126abff051e2c7fe2be6ac89f16857f98ae9","last_reissued_at":"2026-07-05T11:25:40.481436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:40.481436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Omri Weinstein, Sorrachai Yingchareonthawornchai, Zhuan Khye Koh","submitted_at":"2024-11-22T05:46:06Z","abstract_excerpt":"We present a nearly linear work parallel algorithm for approximating the Held-Karp bound for the Metric TSP problem. Given an edge-weighted undirected graph $G=(V,E)$ on $m$ edges and $\\epsilon>0$, it returns a $(1+\\epsilon)$-approximation to the Held-Karp bound with high probability, in $\\tilde{O}(m/\\epsilon^4)$ work and $\\tilde{O}(1/\\epsilon^4)$ depth. While a nearly linear time sequential algorithm was known for almost a decade (Chekuri and Quanrud'17), it was not known how to simultaneously achieve nearly linear work alongside polylogarithmic depth. Using a reduction by Chalermsook et al.'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14745","kind":"arxiv","version":2},"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/2411.14745/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":"2411.14745","created_at":"2026-07-05T11:25:40.481490+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14745v2","created_at":"2026-07-05T11:25:40.481490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14745","created_at":"2026-07-05T11:25:40.481490+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6DBQHJMNM6Y","created_at":"2026-07-05T11:25:40.481490+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6DBQHJMNM6YLIS2","created_at":"2026-07-05T11:25:40.481490+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6DBQHJM","created_at":"2026-07-05T11:25:40.481490+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/Z6DBQHJMNM6YLIS2DYUWQAYSNK","json":"https://pith.science/pith/Z6DBQHJMNM6YLIS2DYUWQAYSNK.json","graph_json":"https://pith.science/api/pith-number/Z6DBQHJMNM6YLIS2DYUWQAYSNK/graph.json","events_json":"https://pith.science/api/pith-number/Z6DBQHJMNM6YLIS2DYUWQAYSNK/events.json","paper":"https://pith.science/paper/Z6DBQHJM"},"agent_actions":{"view_html":"https://pith.science/pith/Z6DBQHJMNM6YLIS2DYUWQAYSNK","download_json":"https://pith.science/pith/Z6DBQHJMNM6YLIS2DYUWQAYSNK.json","view_paper":"https://pith.science/paper/Z6DBQHJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14745&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6DBQHJMNM6YLIS2DYUWQAYSNK/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6DBQHJMNM6YLIS2DYUWQAYSNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6DBQHJMNM6YLIS2DYUWQAYSNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6DBQHJMNM6YLIS2DYUWQAYSNK/action/storage_attestation","attest_author":"https://pith.science/pith/Z6DBQHJMNM6YLIS2DYUWQAYSNK/action/author_attestation","sign_citation":"https://pith.science/pith/Z6DBQHJMNM6YLIS2DYUWQAYSNK/action/citation_signature","submit_replication":"https://pith.science/pith/Z6DBQHJMNM6YLIS2DYUWQAYSNK/action/replication_record"}},"created_at":"2026-07-05T11:25:40.481490+00:00","updated_at":"2026-07-05T11:25:40.481490+00:00"}