{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UGFLYZR5KAHBUTDFTGADJ6FNUB","short_pith_number":"pith:UGFLYZR5","schema_version":"1.0","canonical_sha256":"a18abc663d500e1a4c65998034f8ada07bd2e9ab6639cb73fa3a094fbd08484b","source":{"kind":"arxiv","id":"2402.15348","version":2},"attestation_state":"computed","paper":{"title":"Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Matthias Bentert, Petr A. Golovach","submitted_at":"2024-02-23T14:31:52Z","abstract_excerpt":"We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs $(s_1,t_1),(s_2,t_2),\\ldots,(s_k,t_k)$. The task is to connect as many terminal pairs as possible by pairwise vertex-disjoint paths such that each path is a shortest path between the respective terminals. Our work is anchored in the recent breakthrough by Lochet [SODA '21], which demonstrates the polynomial-time solvability of the problem for a fixed value of $k$.\n  Lochet's result implies "},"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":"2402.15348","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-23T14:31:52Z","cross_cats_sorted":[],"title_canon_sha256":"bc10250a34acd66abca5b8a87aca0c498bea04cdbcda5195b0b5a0571f06c0c2","abstract_canon_sha256":"3a5f1ba609bedee192ac285c7e2587d071f356bd43fe99277241feeae9d2233c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:10.630457Z","signature_b64":"bvUm+h4NI8B/LNHgPD+4MMGCJ4eUlW+3agF+OlX9ahOPm1rBhQCEnheHVfHlhAcu9tvhppK3J3VxaQlZT4QYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a18abc663d500e1a4c65998034f8ada07bd2e9ab6639cb73fa3a094fbd08484b","last_reissued_at":"2026-07-05T10:52:10.629923Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:10.629923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Matthias Bentert, Petr A. Golovach","submitted_at":"2024-02-23T14:31:52Z","abstract_excerpt":"We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs $(s_1,t_1),(s_2,t_2),\\ldots,(s_k,t_k)$. The task is to connect as many terminal pairs as possible by pairwise vertex-disjoint paths such that each path is a shortest path between the respective terminals. Our work is anchored in the recent breakthrough by Lochet [SODA '21], which demonstrates the polynomial-time solvability of the problem for a fixed value of $k$.\n  Lochet's result implies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.15348","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/2402.15348/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":"2402.15348","created_at":"2026-07-05T10:52:10.629985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.15348v2","created_at":"2026-07-05T10:52:10.629985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.15348","created_at":"2026-07-05T10:52:10.629985+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGFLYZR5KAHB","created_at":"2026-07-05T10:52:10.629985+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGFLYZR5KAHBUTDF","created_at":"2026-07-05T10:52:10.629985+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGFLYZR5","created_at":"2026-07-05T10:52:10.629985+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/UGFLYZR5KAHBUTDFTGADJ6FNUB","json":"https://pith.science/pith/UGFLYZR5KAHBUTDFTGADJ6FNUB.json","graph_json":"https://pith.science/api/pith-number/UGFLYZR5KAHBUTDFTGADJ6FNUB/graph.json","events_json":"https://pith.science/api/pith-number/UGFLYZR5KAHBUTDFTGADJ6FNUB/events.json","paper":"https://pith.science/paper/UGFLYZR5"},"agent_actions":{"view_html":"https://pith.science/pith/UGFLYZR5KAHBUTDFTGADJ6FNUB","download_json":"https://pith.science/pith/UGFLYZR5KAHBUTDFTGADJ6FNUB.json","view_paper":"https://pith.science/paper/UGFLYZR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.15348&json=true","fetch_graph":"https://pith.science/api/pith-number/UGFLYZR5KAHBUTDFTGADJ6FNUB/graph.json","fetch_events":"https://pith.science/api/pith-number/UGFLYZR5KAHBUTDFTGADJ6FNUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGFLYZR5KAHBUTDFTGADJ6FNUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGFLYZR5KAHBUTDFTGADJ6FNUB/action/storage_attestation","attest_author":"https://pith.science/pith/UGFLYZR5KAHBUTDFTGADJ6FNUB/action/author_attestation","sign_citation":"https://pith.science/pith/UGFLYZR5KAHBUTDFTGADJ6FNUB/action/citation_signature","submit_replication":"https://pith.science/pith/UGFLYZR5KAHBUTDFTGADJ6FNUB/action/replication_record"}},"created_at":"2026-07-05T10:52:10.629985+00:00","updated_at":"2026-07-05T10:52:10.629985+00:00"}