{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VLUBKBIRXGR7HQ5AWHY7EYSHGA","short_pith_number":"pith:VLUBKBIR","schema_version":"1.0","canonical_sha256":"aae8150511b9a3f3c3a0b1f1f2624730336abc9131a8e2e91ecec8f9c39e828f","source":{"kind":"arxiv","id":"1808.03496","version":1},"attestation_state":"computed","paper":{"title":"The Power of Cut-Based Parameters for Computing Edge Disjoint Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Robert Ganian, Sebastian Ordyniak","submitted_at":"2018-08-10T11:48:30Z","abstract_excerpt":"This paper revisits the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph $G$ and a set of terminal pairs $P$ and asks whether $G$ contains a set of pairwise edge-disjoint paths connecting every terminal pair in $P$. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in $P$ in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size $3$.\n  We present three results which "},"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":"1808.03496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T11:48:30Z","cross_cats_sorted":[],"title_canon_sha256":"f06b048fa6b383223f9a260c17849b25f8347ee61971e0061dd3985927b7c090","abstract_canon_sha256":"b35212d402d40f8f9679eb9e5e29f8094f4db0d9adb0bb06dfd8bd55e2b753f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.863474Z","signature_b64":"xH2E8JIVO+J+GN10mz6S6gMPpImcXbsc7HYY+a9VjkwJlkKUeIbuUczKxyVgxsOndx4ZzOy7nHQWU4noowBUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae8150511b9a3f3c3a0b1f1f2624730336abc9131a8e2e91ecec8f9c39e828f","last_reissued_at":"2026-05-18T00:08:24.862918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.862918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Cut-Based Parameters for Computing Edge Disjoint Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Robert Ganian, Sebastian Ordyniak","submitted_at":"2018-08-10T11:48:30Z","abstract_excerpt":"This paper revisits the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph $G$ and a set of terminal pairs $P$ and asks whether $G$ contains a set of pairwise edge-disjoint paths connecting every terminal pair in $P$. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in $P$ in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size $3$.\n  We present three results which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03496","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":"1808.03496","created_at":"2026-05-18T00:08:24.862995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03496v1","created_at":"2026-05-18T00:08:24.862995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03496","created_at":"2026-05-18T00:08:24.862995+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLUBKBIRXGR7","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLUBKBIRXGR7HQ5A","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLUBKBIR","created_at":"2026-05-18T12:32:59.047623+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/VLUBKBIRXGR7HQ5AWHY7EYSHGA","json":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA.json","graph_json":"https://pith.science/api/pith-number/VLUBKBIRXGR7HQ5AWHY7EYSHGA/graph.json","events_json":"https://pith.science/api/pith-number/VLUBKBIRXGR7HQ5AWHY7EYSHGA/events.json","paper":"https://pith.science/paper/VLUBKBIR"},"agent_actions":{"view_html":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA","download_json":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA.json","view_paper":"https://pith.science/paper/VLUBKBIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03496&json=true","fetch_graph":"https://pith.science/api/pith-number/VLUBKBIRXGR7HQ5AWHY7EYSHGA/graph.json","fetch_events":"https://pith.science/api/pith-number/VLUBKBIRXGR7HQ5AWHY7EYSHGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/action/storage_attestation","attest_author":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/action/author_attestation","sign_citation":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/action/citation_signature","submit_replication":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/action/replication_record"}},"created_at":"2026-05-18T00:08:24.862995+00:00","updated_at":"2026-05-18T00:08:24.862995+00:00"}