{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UO2N57XAIXUXVZ47XNPULCY2DF","short_pith_number":"pith:UO2N57XA","schema_version":"1.0","canonical_sha256":"a3b4defee045e97ae79fbb5f458b1a19608ce469e9fbff20fc1cb1b9d5038934","source":{"kind":"arxiv","id":"2509.00448","version":1},"attestation_state":"computed","paper":{"title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Laura Vargas Koch, Morteza Alimi, Niklas Dahlmeier, Philipp Pabst, Tobias M\\\"omke","submitted_at":"2025-08-30T10:33:39Z","abstract_excerpt":"The path version of the Traveling Salesman Problem is one of the most well-studied variants of the ubiquitous TSP. Its generalization, the Multi-Path TSP, has recently been used in the best known algorithm for path TSP by Traub and Vygen [Cambridge University Press, 2024]. The best known approximation factor for this problem is $2.214$ by B\\\"{o}hm, Friggstad, M\\\"{o}mke and Spoerhase [SODA 2025]. In this paper we show that for the case of graphic metrics, a significantly better approximation guarantee of $2$ can be attained. Our algorithm is based on sampling paths from a decomposition of the f"},"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":"2509.00448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-30T10:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"e18cef7c84a9b079913a5c34767d103910ce6133e45c07f65cffaf2151c478d3","abstract_canon_sha256":"e3fe68408d3b92f558fbbb098dea2dea9f906ab600d3689f39bc087ff72698ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:16.491196Z","signature_b64":"S/rzhTKEZQdOXA1L9+KveYp6OvkcdNSC2OKDDGkV0/ACbbN14RqkALVA8LZxsKVe2X+mCR0JqbZOtEw+OXOnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3b4defee045e97ae79fbb5f458b1a19608ce469e9fbff20fc1cb1b9d5038934","last_reissued_at":"2026-07-05T12:02:16.490661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:16.490661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Laura Vargas Koch, Morteza Alimi, Niklas Dahlmeier, Philipp Pabst, Tobias M\\\"omke","submitted_at":"2025-08-30T10:33:39Z","abstract_excerpt":"The path version of the Traveling Salesman Problem is one of the most well-studied variants of the ubiquitous TSP. Its generalization, the Multi-Path TSP, has recently been used in the best known algorithm for path TSP by Traub and Vygen [Cambridge University Press, 2024]. The best known approximation factor for this problem is $2.214$ by B\\\"{o}hm, Friggstad, M\\\"{o}mke and Spoerhase [SODA 2025]. In this paper we show that for the case of graphic metrics, a significantly better approximation guarantee of $2$ can be attained. Our algorithm is based on sampling paths from a decomposition of the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00448","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/2509.00448/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":"2509.00448","created_at":"2026-07-05T12:02:16.490720+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.00448v1","created_at":"2026-07-05T12:02:16.490720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00448","created_at":"2026-07-05T12:02:16.490720+00:00"},{"alias_kind":"pith_short_12","alias_value":"UO2N57XAIXUX","created_at":"2026-07-05T12:02:16.490720+00:00"},{"alias_kind":"pith_short_16","alias_value":"UO2N57XAIXUXVZ47","created_at":"2026-07-05T12:02:16.490720+00:00"},{"alias_kind":"pith_short_8","alias_value":"UO2N57XA","created_at":"2026-07-05T12:02:16.490720+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/UO2N57XAIXUXVZ47XNPULCY2DF","json":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF.json","graph_json":"https://pith.science/api/pith-number/UO2N57XAIXUXVZ47XNPULCY2DF/graph.json","events_json":"https://pith.science/api/pith-number/UO2N57XAIXUXVZ47XNPULCY2DF/events.json","paper":"https://pith.science/paper/UO2N57XA"},"agent_actions":{"view_html":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF","download_json":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF.json","view_paper":"https://pith.science/paper/UO2N57XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.00448&json=true","fetch_graph":"https://pith.science/api/pith-number/UO2N57XAIXUXVZ47XNPULCY2DF/graph.json","fetch_events":"https://pith.science/api/pith-number/UO2N57XAIXUXVZ47XNPULCY2DF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/action/storage_attestation","attest_author":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/action/author_attestation","sign_citation":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/action/citation_signature","submit_replication":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/action/replication_record"}},"created_at":"2026-07-05T12:02:16.490720+00:00","updated_at":"2026-07-05T12:02:16.490720+00:00"}