{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EFY6HD4IBDHNB775EOBTNXD4HX","short_pith_number":"pith:EFY6HD4I","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"},"canonical_sha256":"2171e38f8808ced0fffd238336dc7c3df6a8dd3780c3638463bd183b6a03f9db","source":{"kind":"arxiv","id":"1511.02801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02801","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02801v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02801","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"EFY6HD4IBDHN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EFY6HD4IBDHNB775","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EFY6HD4I","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EFY6HD4IBDHNB775EOBTNXD4HX","target":"record","payload":{"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"},"canonical_sha256":"2171e38f8808ced0fffd238336dc7c3df6a8dd3780c3638463bd183b6a03f9db","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"},"source_kind":"arxiv","source_id":"1511.02801","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mcr25bZ8Mb0scKcif+hSNdZAI1yX9bYNrgDMYyEwv5IAXkTSB3f5BpTLO4gpgDICmoF5HpcEteHIEva6QqjiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:55:14.710657Z"},"content_sha256":"45e10d857c9f9ab9a4c5ee75f38c8a57ae64434d17e476517aa56451c40269e2","schema_version":"1.0","event_id":"sha256:45e10d857c9f9ab9a4c5ee75f38c8a57ae64434d17e476517aa56451c40269e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EFY6HD4IBDHNB775EOBTNXD4HX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgo6hhmgAv9SG33rkz/kSXROpMeZjJxQ4MMLBcxi6A8ZK9VImDMfhmNor7eZMt6vwvvl3g0KBGW0DZ8xM03SDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:55:14.710994Z"},"content_sha256":"4c3325a89e5908ef5afa26fdd7338c67ca904351bee9739b1eeb8d3e44a987f0","schema_version":"1.0","event_id":"sha256:4c3325a89e5908ef5afa26fdd7338c67ca904351bee9739b1eeb8d3e44a987f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/bundle.json","state_url":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFY6HD4IBDHNB775EOBTNXD4HX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T22:55:14Z","links":{"resolver":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX","bundle":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/bundle.json","state":"https://pith.science/pith/EFY6HD4IBDHNB775EOBTNXD4HX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFY6HD4IBDHNB775EOBTNXD4HX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EFY6HD4IBDHNB775EOBTNXD4HX","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":"ee6daabaf957ddccbd4949e7ba087f8798823271252d84145f2804413b0f70dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T18:53:32Z","title_canon_sha256":"20a99e80094077e5ea9052aab0a8a74913c0ebe449a731ebc06a9fd419d8ad45"},"schema_version":"1.0","source":{"id":"1511.02801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02801","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02801v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02801","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"EFY6HD4IBDHN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EFY6HD4IBDHNB775","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EFY6HD4I","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:4c3325a89e5908ef5afa26fdd7338c67ca904351bee9739b1eeb8d3e44a987f0","target":"graph","created_at":"2026-05-18T01:01:34Z","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"},"paper":{"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-","authors_text":"Du\\v{s}an Knop, Pavel Dvo\\v{r}\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T18:53:32Z","title":"Parameterized complexity of length-bounded cuts and multi-cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02801","kind":"arxiv","version":1},"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:45e10d857c9f9ab9a4c5ee75f38c8a57ae64434d17e476517aa56451c40269e2","target":"record","created_at":"2026-05-18T01:01:34Z","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":"ee6daabaf957ddccbd4949e7ba087f8798823271252d84145f2804413b0f70dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T18:53:32Z","title_canon_sha256":"20a99e80094077e5ea9052aab0a8a74913c0ebe449a731ebc06a9fd419d8ad45"},"schema_version":"1.0","source":{"id":"1511.02801","kind":"arxiv","version":1}},"canonical_sha256":"2171e38f8808ced0fffd238336dc7c3df6a8dd3780c3638463bd183b6a03f9db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2171e38f8808ced0fffd238336dc7c3df6a8dd3780c3638463bd183b6a03f9db","first_computed_at":"2026-05-18T01:01:34.596399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:34.596399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fVJ57ut+ue4dIa51bhrugbJdQPbeimBGxBcD3QTA6g1pwjfTzcbmZ/xPFx4dJr3GTLV4nEgksGcxz/9g5HTZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:34.597019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45e10d857c9f9ab9a4c5ee75f38c8a57ae64434d17e476517aa56451c40269e2","sha256:4c3325a89e5908ef5afa26fdd7338c67ca904351bee9739b1eeb8d3e44a987f0"],"state_sha256":"a1ad81877e39e81ab0804bd1882a9002b7162a8234fabd79854bddf4ed0c8818"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00YGJJSuRR1fwX9x630phD2e78dzSi8S4STwdtAbT42FNi8m6bhsuAKNOx27Qzms8QckH5LEPQObllkWSGj6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:55:14.712868Z","bundle_sha256":"58507154d9adb00a17303fc6569f1b3b3fb192a0b5de2ea009ab3deba1a2c310"}}