{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TGK7ZWBEOT7GCSWBV5V2XCKWOP","short_pith_number":"pith:TGK7ZWBE","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"},"canonical_sha256":"9995fcd82474fe614ac1af6bab895673cccce269b2876530a1ca5b1e338d9b9c","source":{"kind":"arxiv","id":"1602.01739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01739","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01739v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01739","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"TGK7ZWBEOT7G","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TGK7ZWBEOT7GCSWB","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TGK7ZWBE","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TGK7ZWBEOT7GCSWBV5V2XCKWOP","target":"record","payload":{"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"},"canonical_sha256":"9995fcd82474fe614ac1af6bab895673cccce269b2876530a1ca5b1e338d9b9c","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"},"source_kind":"arxiv","source_id":"1602.01739","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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8fRXSRJBMqXpDKFnJJvUFP0ZkqEmqaUrpLrLLRpDkU/5Wm4kW9W5qfPSdhwQj6zuKWk9llMkoAOujpa03gvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:15:04.679526Z"},"content_sha256":"e67df6f26fe5d48d8e6e0ace5fbeab525d4ef922f85115d5f46a12ce4296eb1b","schema_version":"1.0","event_id":"sha256:e67df6f26fe5d48d8e6e0ace5fbeab525d4ef922f85115d5f46a12ce4296eb1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TGK7ZWBEOT7GCSWBV5V2XCKWOP","target":"graph","payload":{"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"},"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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/O9VcjxNOkpRaUxdehHfCII0v2wYRcVg5w74Lqkcl6GJw7aSW/k4GKSLMOVvJ43g1qYupGyt6G0cm+7VHZhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:15:04.680155Z"},"content_sha256":"14528aec3f5a62cc11bfef7c3d07f8e40405daf58a389f4c61bba4fce4b0c195","schema_version":"1.0","event_id":"sha256:14528aec3f5a62cc11bfef7c3d07f8e40405daf58a389f4c61bba4fce4b0c195"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/bundle.json","state_url":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/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-07T09:15:04Z","links":{"resolver":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP","bundle":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/bundle.json","state":"https://pith.science/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGK7ZWBEOT7GCSWBV5V2XCKWOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TGK7ZWBEOT7GCSWBV5V2XCKWOP","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":"a2da7db95e6f23c3bea731afb32e2a4577cf5c0d738b00c563e6ec7f650ec5cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T16:40:49Z","title_canon_sha256":"51014cdf7d853e100fcd9468dad4f4cd5eafe2007f7ad7bbf9b5f6eda24cde06"},"schema_version":"1.0","source":{"id":"1602.01739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01739","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01739v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01739","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"TGK7ZWBEOT7G","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TGK7ZWBEOT7GCSWB","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TGK7ZWBE","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:14528aec3f5a62cc11bfef7c3d07f8e40405daf58a389f4c61bba4fce4b0c195","target":"graph","created_at":"2026-05-18T01:21:18Z","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 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).","authors_text":"Manuel Sorge, Rolf Niedermeier, Stefan Kratsch, Till Fluschnik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T16:40:49Z","title":"The Parameterized Complexity of the Minimum Shared Edges Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01739","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:e67df6f26fe5d48d8e6e0ace5fbeab525d4ef922f85115d5f46a12ce4296eb1b","target":"record","created_at":"2026-05-18T01:21:18Z","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":"a2da7db95e6f23c3bea731afb32e2a4577cf5c0d738b00c563e6ec7f650ec5cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T16:40:49Z","title_canon_sha256":"51014cdf7d853e100fcd9468dad4f4cd5eafe2007f7ad7bbf9b5f6eda24cde06"},"schema_version":"1.0","source":{"id":"1602.01739","kind":"arxiv","version":1}},"canonical_sha256":"9995fcd82474fe614ac1af6bab895673cccce269b2876530a1ca5b1e338d9b9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9995fcd82474fe614ac1af6bab895673cccce269b2876530a1ca5b1e338d9b9c","first_computed_at":"2026-05-18T01:21:18.225247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.225247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"49fUVdp33fQE1M8tssR69RG6kiWA1LkmaxklJkF/xtvbHLiSXk7SpALWrbHCFH2VoB54bfr5+tQL5ndBgNjzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.225758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e67df6f26fe5d48d8e6e0ace5fbeab525d4ef922f85115d5f46a12ce4296eb1b","sha256:14528aec3f5a62cc11bfef7c3d07f8e40405daf58a389f4c61bba4fce4b0c195"],"state_sha256":"fdb5f4792e3b65e5d617faef018eaedcb4848ece3ef17b1a486955a415badcfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tw1lWbo12bKu78pDpub05iQVC87z9iFh2Vab53c6wApfFtqp4ybeYCi29Tb3EAjXHauZc7uxzdMgMor7bgVvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:15:04.682843Z","bundle_sha256":"96ce668ed7ef1110e00c8d1cf26f739d546fdee950178dc42d8fdb61c61dbe96"}}