{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UO2N57XAIXUXVZ47XNPULCY2DF","short_pith_number":"pith:UO2N57XA","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"},"canonical_sha256":"a3b4defee045e97ae79fbb5f458b1a19608ce469e9fbff20fc1cb1b9d5038934","source":{"kind":"arxiv","id":"2509.00448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00448","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00448v1","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00448","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"UO2N57XAIXUX","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"UO2N57XAIXUXVZ47","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"UO2N57XA","created_at":"2026-07-05T12:02:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UO2N57XAIXUXVZ47XNPULCY2DF","target":"record","payload":{"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"},"canonical_sha256":"a3b4defee045e97ae79fbb5f458b1a19608ce469e9fbff20fc1cb1b9d5038934","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"},"source_kind":"arxiv","source_id":"2509.00448","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-07-05T12:02:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KP+I2AhZHAHGXCh/oQs9s2ay6PBsph7OmustdaiHQaryH/ynlsKjNLVAVbMlI72tjPoFI21pVg/Y3a8oB5C4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T07:24:29.911063Z"},"content_sha256":"0875d85eebf3e2256422336dcb0402a557ef0f8218fc9b375eb879a3b583aaff","schema_version":"1.0","event_id":"sha256:0875d85eebf3e2256422336dcb0402a557ef0f8218fc9b375eb879a3b583aaff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UO2N57XAIXUXVZ47XNPULCY2DF","target":"graph","payload":{"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"},"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-07-05T12:02:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uc5vbmDgxy2iEVL4KiPL7R0An5u2NQkJzJRXVOO4ssqYyh2UUi6S9iYRbzIsClQ9A/AYOWXJ61peYMbgL4EKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T07:24:29.911442Z"},"content_sha256":"111a8c4cf84d490316ac6e39c4c8b4bc410952aa923f6bda162006b412fe0049","schema_version":"1.0","event_id":"sha256:111a8c4cf84d490316ac6e39c4c8b4bc410952aa923f6bda162006b412fe0049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/bundle.json","state_url":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UO2N57XAIXUXVZ47XNPULCY2DF/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-08-13T07:24:29Z","links":{"resolver":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF","bundle":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/bundle.json","state":"https://pith.science/pith/UO2N57XAIXUXVZ47XNPULCY2DF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UO2N57XAIXUXVZ47XNPULCY2DF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UO2N57XAIXUXVZ47XNPULCY2DF","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":"e3fe68408d3b92f558fbbb098dea2dea9f906ab600d3689f39bc087ff72698ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-30T10:33:39Z","title_canon_sha256":"e18cef7c84a9b079913a5c34767d103910ce6133e45c07f65cffaf2151c478d3"},"schema_version":"1.0","source":{"id":"2509.00448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00448","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00448v1","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00448","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"UO2N57XAIXUX","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"UO2N57XAIXUXVZ47","created_at":"2026-07-05T12:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"UO2N57XA","created_at":"2026-07-05T12:02:16Z"}],"graph_snapshots":[{"event_id":"sha256:111a8c4cf84d490316ac6e39c4c8b4bc410952aa923f6bda162006b412fe0049","target":"graph","created_at":"2026-07-05T12:02:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.00448/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Laura Vargas Koch, Morteza Alimi, Niklas Dahlmeier, Philipp Pabst, Tobias M\\\"omke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00448","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:0875d85eebf3e2256422336dcb0402a557ef0f8218fc9b375eb879a3b583aaff","target":"record","created_at":"2026-07-05T12:02:16Z","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":"e3fe68408d3b92f558fbbb098dea2dea9f906ab600d3689f39bc087ff72698ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-30T10:33:39Z","title_canon_sha256":"e18cef7c84a9b079913a5c34767d103910ce6133e45c07f65cffaf2151c478d3"},"schema_version":"1.0","source":{"id":"2509.00448","kind":"arxiv","version":1}},"canonical_sha256":"a3b4defee045e97ae79fbb5f458b1a19608ce469e9fbff20fc1cb1b9d5038934","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3b4defee045e97ae79fbb5f458b1a19608ce469e9fbff20fc1cb1b9d5038934","first_computed_at":"2026-07-05T12:02:16.490661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:16.490661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S/rzhTKEZQdOXA1L9+KveYp6OvkcdNSC2OKDDGkV0/ACbbN14RqkALVA8LZxsKVe2X+mCR0JqbZOtEw+OXOnCg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:16.491196Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.00448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0875d85eebf3e2256422336dcb0402a557ef0f8218fc9b375eb879a3b583aaff","sha256:111a8c4cf84d490316ac6e39c4c8b4bc410952aa923f6bda162006b412fe0049"],"state_sha256":"f1881fac7da33a8ee175fd5a533801b232c73233bc17a256b6ac0520c46e5d42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gz2sTfdVlo3wGC0ec2sQt/lyDrothNmuCKBA/b4vWAQbTVd+6HbIuU5ptzwkztvBGdCTQEdJGNtw9m1KRTRwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T07:24:29.914135Z","bundle_sha256":"f939a9d46bef623f213d7dcf740e30e3110b9cb846c750afc152d03e99d7361c"}}