{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TRQYHYJTWX7P2WSWJGD62GLW7N","short_pith_number":"pith:TRQYHYJT","schema_version":"1.0","canonical_sha256":"9c6183e133b5fefd5a564987ed1976fb766dfda766410b733c63f9af820a39ed","source":{"kind":"arxiv","id":"1703.02332","version":2},"attestation_state":"computed","paper":{"title":"The Minimum Shared Edges Problem on Grid-like Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hendrik Molter, Henning Seidler, Meike Hatzel, Steffen H\\\"artlein, Till Fluschnik","submitted_at":"2017-03-07T11:22:53Z","abstract_excerpt":"We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route $p$ paths from a start vertex to a target vertex in a given graph while using at most $k$ edges more than once. We show that MSE can be decided on bounded (i.e. finite) grids in linear time when both dimensions are either small or large compared to the number $p$ of paths. On the contrary, we show that MSE remains NP-hard on subgraphs of bounded grids. Finally, we study MSE from a parametrised complexity point of view. It is known that MSE is fixed-parameter tractable with respect to the n"},"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":"1703.02332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-07T11:22:53Z","cross_cats_sorted":[],"title_canon_sha256":"cdd5ebeeea78a6452af58efda8771e0dfb53eccc9a7d14a6bf5ef1316407896c","abstract_canon_sha256":"efc4d086bc3db790fb5bde2f6251d3519ab4d964358dd389ee5a094b641ec86f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:51.232486Z","signature_b64":"X7duWGyGWyfXiEQOxYbokJUgxdPLTf3jaa6TYPA1bBDebnhVhKAnVaxGElR3hwO5jqTogQLTwHznMKeIsdZuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6183e133b5fefd5a564987ed1976fb766dfda766410b733c63f9af820a39ed","last_reissued_at":"2026-05-18T00:42:51.231805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:51.231805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Minimum Shared Edges Problem on Grid-like Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hendrik Molter, Henning Seidler, Meike Hatzel, Steffen H\\\"artlein, Till Fluschnik","submitted_at":"2017-03-07T11:22:53Z","abstract_excerpt":"We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route $p$ paths from a start vertex to a target vertex in a given graph while using at most $k$ edges more than once. We show that MSE can be decided on bounded (i.e. finite) grids in linear time when both dimensions are either small or large compared to the number $p$ of paths. On the contrary, we show that MSE remains NP-hard on subgraphs of bounded grids. Finally, we study MSE from a parametrised complexity point of view. It is known that MSE is fixed-parameter tractable with respect to the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02332","kind":"arxiv","version":2},"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":"1703.02332","created_at":"2026-05-18T00:42:51.231908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02332v2","created_at":"2026-05-18T00:42:51.231908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02332","created_at":"2026-05-18T00:42:51.231908+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRQYHYJTWX7P","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRQYHYJTWX7P2WSW","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRQYHYJT","created_at":"2026-05-18T12:31:46.661854+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/TRQYHYJTWX7P2WSWJGD62GLW7N","json":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N.json","graph_json":"https://pith.science/api/pith-number/TRQYHYJTWX7P2WSWJGD62GLW7N/graph.json","events_json":"https://pith.science/api/pith-number/TRQYHYJTWX7P2WSWJGD62GLW7N/events.json","paper":"https://pith.science/paper/TRQYHYJT"},"agent_actions":{"view_html":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N","download_json":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N.json","view_paper":"https://pith.science/paper/TRQYHYJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02332&json=true","fetch_graph":"https://pith.science/api/pith-number/TRQYHYJTWX7P2WSWJGD62GLW7N/graph.json","fetch_events":"https://pith.science/api/pith-number/TRQYHYJTWX7P2WSWJGD62GLW7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/action/storage_attestation","attest_author":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/action/author_attestation","sign_citation":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/action/citation_signature","submit_replication":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/action/replication_record"}},"created_at":"2026-05-18T00:42:51.231908+00:00","updated_at":"2026-05-18T00:42:51.231908+00:00"}