{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TGK7ZWBEOT7GCSWBV5V2XCKWOP","short_pith_number":"pith:TGK7ZWBE","schema_version":"1.0","canonical_sha256":"9995fcd82474fe614ac1af6bab895673cccce269b2876530a1ca5b1e338d9b9c","source":{"kind":"arxiv","id":"1602.01739","version":1},"attestation_state":"computed","paper":{"title":"The Parameterized Complexity of the Minimum Shared Edges Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Rolf Niedermeier, Stefan Kratsch, Till Fluschnik","submitted_at":"2016-02-04T16:40:49Z","abstract_excerpt":"We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and sharing at most k edges. Herein, an edge is shared if it appears in at least two paths. We show that MSE is W[1]-hard when parameterized by the treewidth of the input graph and the number k of shared edges combined. We show that MSE is fixed-parameter tractable with respect to p, but does not admit a polynomial-size kernel (unless NP is contained in coNP/poly)."},"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":"1602.01739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T16:40:49Z","cross_cats_sorted":[],"title_canon_sha256":"51014cdf7d853e100fcd9468dad4f4cd5eafe2007f7ad7bbf9b5f6eda24cde06","abstract_canon_sha256":"a2da7db95e6f23c3bea731afb32e2a4577cf5c0d738b00c563e6ec7f650ec5cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.225758Z","signature_b64":"49fUVdp33fQE1M8tssR69RG6kiWA1LkmaxklJkF/xtvbHLiSXk7SpALWrbHCFH2VoB54bfr5+tQL5ndBgNjzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9995fcd82474fe614ac1af6bab895673cccce269b2876530a1ca5b1e338d9b9c","last_reissued_at":"2026-05-18T01:21:18.225247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.225247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of the Minimum Shared Edges Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Rolf Niedermeier, Stefan Kratsch, Till Fluschnik","submitted_at":"2016-02-04T16:40:49Z","abstract_excerpt":"We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and sharing at most k edges. Herein, an edge is shared if it appears in at least two paths. We show that MSE is W[1]-hard when parameterized by the treewidth of the input graph and the number k of shared edges combined. We show that MSE is fixed-parameter tractable with respect to p, but does not admit a polynomial-size kernel (unless NP is contained in coNP/poly)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01739","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":"1602.01739","created_at":"2026-05-18T01:21:18.225330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01739v1","created_at":"2026-05-18T01:21:18.225330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01739","created_at":"2026-05-18T01:21:18.225330+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGK7ZWBEOT7G","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGK7ZWBEOT7GCSWB","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGK7ZWBE","created_at":"2026-05-18T12:30:44.179134+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/TGK7ZWBEOT7GCSWBV5V2XCKWOP","json":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP.json","graph_json":"https://pith.science/api/pith-number/TGK7ZWBEOT7GCSWBV5V2XCKWOP/graph.json","events_json":"https://pith.science/api/pith-number/TGK7ZWBEOT7GCSWBV5V2XCKWOP/events.json","paper":"https://pith.science/paper/TGK7ZWBE"},"agent_actions":{"view_html":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP","download_json":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP.json","view_paper":"https://pith.science/paper/TGK7ZWBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01739&json=true","fetch_graph":"https://pith.science/api/pith-number/TGK7ZWBEOT7GCSWBV5V2XCKWOP/graph.json","fetch_events":"https://pith.science/api/pith-number/TGK7ZWBEOT7GCSWBV5V2XCKWOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/action/storage_attestation","attest_author":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/action/author_attestation","sign_citation":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/action/citation_signature","submit_replication":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/action/replication_record"}},"created_at":"2026-05-18T01:21:18.225330+00:00","updated_at":"2026-05-18T01:21:18.225330+00:00"}