{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JFWAVOV5FZECYTY4AT7JEQ3JJ5","short_pith_number":"pith:JFWAVOV5","schema_version":"1.0","canonical_sha256":"496c0ababd2e482c4f1c04fe9243694f72acf186b003d99bfeb68096225e6fb3","source":{"kind":"arxiv","id":"2605.14902","version":1},"attestation_state":"computed","paper":{"title":"Optimal Bounds for the k-Disjoint Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dario Cavallaro, Dimitrios M. Thilikos, Maximilian Gorsky, Sebastian Wiederrecht, Stephan Kreutzer","submitted_at":"2026-05-14T14:40:16Z","abstract_excerpt":"The Graph Minors Series of Robertson and Seymour forms the foundation of algorithmic structural graph theory, yielding fixed-parameter algorithms for problems such as Disjoint Paths, Rooted Minor Checking, and Folio. A key ingredient behind the fixed-parameter tractability of the $k$-Disjoint Paths problem is the irrelevant-vertex technique. This machinery is governed by the Vital Linkage Theorem and the so-called Linkage Function $\\ell$. However, despite its foundational role, the best known bounds on the Linkage Function are enormous and are only implicitly understood. The quantitative bound"},"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":"2605.14902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T14:40:16Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"0dca85ea299f3aa0a5529a204a7bf682c5dcea2a3fe315ce7c6821c7674ca00d","abstract_canon_sha256":"3dcc84423f0fb47e079146fde560dfea9f7c0436889d6f1b8dd20f0f09f6154e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:55.846652Z","signature_b64":"7ilCF6ckAKQg2jB4YsOe/FUXr7/HMvZ2RH0k6edaPjbyx5IO2MyFUS7RI0T6c6NES2Sc3wPaCz6IMb3zWRULAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"496c0ababd2e482c4f1c04fe9243694f72acf186b003d99bfeb68096225e6fb3","last_reissued_at":"2026-05-17T23:38:55.845922Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:55.845922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Bounds for the k-Disjoint Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dario Cavallaro, Dimitrios M. Thilikos, Maximilian Gorsky, Sebastian Wiederrecht, Stephan Kreutzer","submitted_at":"2026-05-14T14:40:16Z","abstract_excerpt":"The Graph Minors Series of Robertson and Seymour forms the foundation of algorithmic structural graph theory, yielding fixed-parameter algorithms for problems such as Disjoint Paths, Rooted Minor Checking, and Folio. A key ingredient behind the fixed-parameter tractability of the $k$-Disjoint Paths problem is the irrelevant-vertex technique. This machinery is governed by the Vital Linkage Theorem and the so-called Linkage Function $\\ell$. However, despite its foundational role, the best known bounds on the Linkage Function are enormous and are only implicitly understood. The quantitative bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14902","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":""},"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":"2605.14902","created_at":"2026-05-17T23:38:55.846037+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14902v1","created_at":"2026-05-17T23:38:55.846037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14902","created_at":"2026-05-17T23:38:55.846037+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFWAVOV5FZEC","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFWAVOV5FZECYTY4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFWAVOV5","created_at":"2026-05-18T12:33:37.589309+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/JFWAVOV5FZECYTY4AT7JEQ3JJ5","json":"https://pith.science/pith/JFWAVOV5FZECYTY4AT7JEQ3JJ5.json","graph_json":"https://pith.science/api/pith-number/JFWAVOV5FZECYTY4AT7JEQ3JJ5/graph.json","events_json":"https://pith.science/api/pith-number/JFWAVOV5FZECYTY4AT7JEQ3JJ5/events.json","paper":"https://pith.science/paper/JFWAVOV5"},"agent_actions":{"view_html":"https://pith.science/pith/JFWAVOV5FZECYTY4AT7JEQ3JJ5","download_json":"https://pith.science/pith/JFWAVOV5FZECYTY4AT7JEQ3JJ5.json","view_paper":"https://pith.science/paper/JFWAVOV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14902&json=true","fetch_graph":"https://pith.science/api/pith-number/JFWAVOV5FZECYTY4AT7JEQ3JJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/JFWAVOV5FZECYTY4AT7JEQ3JJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFWAVOV5FZECYTY4AT7JEQ3JJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFWAVOV5FZECYTY4AT7JEQ3JJ5/action/storage_attestation","attest_author":"https://pith.science/pith/JFWAVOV5FZECYTY4AT7JEQ3JJ5/action/author_attestation","sign_citation":"https://pith.science/pith/JFWAVOV5FZECYTY4AT7JEQ3JJ5/action/citation_signature","submit_replication":"https://pith.science/pith/JFWAVOV5FZECYTY4AT7JEQ3JJ5/action/replication_record"}},"created_at":"2026-05-17T23:38:55.846037+00:00","updated_at":"2026-05-17T23:38:55.846037+00:00"}