{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UGFLYZR5KAHBUTDFTGADJ6FNUB","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":"3a5f1ba609bedee192ac285c7e2587d071f356bd43fe99277241feeae9d2233c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-23T14:31:52Z","title_canon_sha256":"bc10250a34acd66abca5b8a87aca0c498bea04cdbcda5195b0b5a0571f06c0c2"},"schema_version":"1.0","source":{"id":"2402.15348","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.15348","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"arxiv_version","alias_value":"2402.15348v2","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.15348","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_12","alias_value":"UGFLYZR5KAHB","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_16","alias_value":"UGFLYZR5KAHBUTDF","created_at":"2026-07-05T10:52:10Z"},{"alias_kind":"pith_short_8","alias_value":"UGFLYZR5","created_at":"2026-07-05T10:52:10Z"}],"graph_snapshots":[{"event_id":"sha256:b56f1e694d7c3e6ed38fd8742f972bf414461fa7f0f6ff5e3a7a4e75b810b6e3","target":"graph","created_at":"2026-07-05T10:52:10Z","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/2402.15348/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Fedor V. Fomin, Matthias Bentert, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-23T14:31:52Z","title":"Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.15348","kind":"arxiv","version":2},"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:ea74f93cbe19fdb826f1ec7d9ab057ee4243e4b89a1b486834f253c473a2d8ac","target":"record","created_at":"2026-07-05T10:52:10Z","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":"3a5f1ba609bedee192ac285c7e2587d071f356bd43fe99277241feeae9d2233c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-23T14:31:52Z","title_canon_sha256":"bc10250a34acd66abca5b8a87aca0c498bea04cdbcda5195b0b5a0571f06c0c2"},"schema_version":"1.0","source":{"id":"2402.15348","kind":"arxiv","version":2}},"canonical_sha256":"a18abc663d500e1a4c65998034f8ada07bd2e9ab6639cb73fa3a094fbd08484b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a18abc663d500e1a4c65998034f8ada07bd2e9ab6639cb73fa3a094fbd08484b","first_computed_at":"2026-07-05T10:52:10.629923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:10.629923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bvUm+h4NI8B/LNHgPD+4MMGCJ4eUlW+3agF+OlX9ahOPm1rBhQCEnheHVfHlhAcu9tvhppK3J3VxaQlZT4QYDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:10.630457Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.15348","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea74f93cbe19fdb826f1ec7d9ab057ee4243e4b89a1b486834f253c473a2d8ac","sha256:b56f1e694d7c3e6ed38fd8742f972bf414461fa7f0f6ff5e3a7a4e75b810b6e3"],"state_sha256":"3c18f30093b92eabfa74614c4f6c2fa9fb76fb29a510e74f05c8e7d3d918fbbd"}