{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EFY6HD4IBDHNB775EOBTNXD4HX","short_pith_number":"pith:EFY6HD4I","schema_version":"1.0","canonical_sha256":"2171e38f8808ced0fffd238336dc7c3df6a8dd3780c3638463bd183b6a03f9db","source":{"kind":"arxiv","id":"1511.02801","version":1},"attestation_state":"computed","paper":{"title":"Parameterized complexity of length-bounded cuts and multi-cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Du\\v{s}an Knop, Pavel Dvo\\v{r}\\'ak","submitted_at":"2015-11-09T18:53:32Z","abstract_excerpt":"We show that the Minimal Length-Bounded L-But problem can be computed in linear time with respect to L and the tree-width of the input graph as parameters. In this problem the task is to find a set of edges of a graph such that after removal of this set, the shortest path between two prescribed vertices is at least L long. We derive an FPT algorithm for a more general multi-commodity length bounded cut problem when parameterized by the number of terminals also.\n  For the former problem we show a W[1]-hardness result when the parameterization is done by the path-width only (instead of the tree-"},"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":"1511.02801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T18:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"20a99e80094077e5ea9052aab0a8a74913c0ebe449a731ebc06a9fd419d8ad45","abstract_canon_sha256":"ee6daabaf957ddccbd4949e7ba087f8798823271252d84145f2804413b0f70dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:34.597019Z","signature_b64":"fVJ57ut+ue4dIa51bhrugbJdQPbeimBGxBcD3QTA6g1pwjfTzcbmZ/xPFx4dJr3GTLV4nEgksGcxz/9g5HTZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2171e38f8808ced0fffd238336dc7c3df6a8dd3780c3638463bd183b6a03f9db","last_reissued_at":"2026-05-18T01:01:34.596399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:34.596399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized complexity of length-bounded cuts and multi-cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Du\\v{s}an Knop, Pavel Dvo\\v{r}\\'ak","submitted_at":"2015-11-09T18:53:32Z","abstract_excerpt":"We show that the Minimal Length-Bounded L-But problem can be computed in linear time with respect to L and the tree-width of the input graph as parameters. In this problem the task is to find a set of edges of a graph such that after removal of this set, the shortest path between two prescribed vertices is at least L long. We derive an FPT algorithm for a more general multi-commodity length bounded cut problem when parameterized by the number of terminals also.\n  For the former problem we show a W[1]-hardness result when the parameterization is done by the path-width only (instead of the tree-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02801","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":"1511.02801","created_at":"2026-05-18T01:01:34.596505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02801v1","created_at":"2026-05-18T01:01:34.596505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02801","created_at":"2026-05-18T01:01:34.596505+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFY6HD4IBDHN","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFY6HD4IBDHNB775","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFY6HD4I","created_at":"2026-05-18T12:29:19.899920+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/EFY6HD4IBDHNB775EOBTNXD4HX","json":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX.json","graph_json":"https://pith.science/api/pith-number/EFY6HD4IBDHNB775EOBTNXD4HX/graph.json","events_json":"https://pith.science/api/pith-number/EFY6HD4IBDHNB775EOBTNXD4HX/events.json","paper":"https://pith.science/paper/EFY6HD4I"},"agent_actions":{"view_html":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX","download_json":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX.json","view_paper":"https://pith.science/paper/EFY6HD4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02801&json=true","fetch_graph":"https://pith.science/api/pith-number/EFY6HD4IBDHNB775EOBTNXD4HX/graph.json","fetch_events":"https://pith.science/api/pith-number/EFY6HD4IBDHNB775EOBTNXD4HX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/action/storage_attestation","attest_author":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/action/author_attestation","sign_citation":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/action/citation_signature","submit_replication":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/action/replication_record"}},"created_at":"2026-05-18T01:01:34.596505+00:00","updated_at":"2026-05-18T01:01:34.596505+00:00"}