{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TRQYHYJTWX7P2WSWJGD62GLW7N","short_pith_number":"pith:TRQYHYJT","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"},"canonical_sha256":"9c6183e133b5fefd5a564987ed1976fb766dfda766410b733c63f9af820a39ed","source":{"kind":"arxiv","id":"1703.02332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02332","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02332v2","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02332","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"TRQYHYJTWX7P","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRQYHYJTWX7P2WSW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRQYHYJT","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TRQYHYJTWX7P2WSWJGD62GLW7N","target":"record","payload":{"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"},"canonical_sha256":"9c6183e133b5fefd5a564987ed1976fb766dfda766410b733c63f9af820a39ed","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"},"source_kind":"arxiv","source_id":"1703.02332","source_version":2,"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-18T00:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZorO9tdTyTE5u3e/VDGS60y0/IIFR4bdZQlEeoT5NcXcVnspgRcBzWWmNFMJKi1EPHwbCgQE5aEa//8apiHTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:17:07.791951Z"},"content_sha256":"c245b7e4bfbe35a47fafed3a599c8a268daba358597b8545e1091a57c4c26400","schema_version":"1.0","event_id":"sha256:c245b7e4bfbe35a47fafed3a599c8a268daba358597b8545e1091a57c4c26400"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TRQYHYJTWX7P2WSWJGD62GLW7N","target":"graph","payload":{"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"},"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-18T00:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJo52KQtr0GreHa5R6htlp8RLRWogEx2Og1/QtAZgkyqos5hQ9/PUayjUIeS7s/0dzN6VtFRGSvzADeDZQ6cDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:17:07.792652Z"},"content_sha256":"159a5a88df3b84cdd6c2db244cd4e2468170abbd4d1575005dabe9f7b7a15603","schema_version":"1.0","event_id":"sha256:159a5a88df3b84cdd6c2db244cd4e2468170abbd4d1575005dabe9f7b7a15603"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/bundle.json","state_url":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/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-11T17:17:07Z","links":{"resolver":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N","bundle":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/bundle.json","state":"https://pith.science/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRQYHYJTWX7P2WSWJGD62GLW7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TRQYHYJTWX7P2WSWJGD62GLW7N","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":"efc4d086bc3db790fb5bde2f6251d3519ab4d964358dd389ee5a094b641ec86f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-07T11:22:53Z","title_canon_sha256":"cdd5ebeeea78a6452af58efda8771e0dfb53eccc9a7d14a6bf5ef1316407896c"},"schema_version":"1.0","source":{"id":"1703.02332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02332","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02332v2","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02332","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"TRQYHYJTWX7P","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRQYHYJTWX7P2WSW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRQYHYJT","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:159a5a88df3b84cdd6c2db244cd4e2468170abbd4d1575005dabe9f7b7a15603","target":"graph","created_at":"2026-05-18T00:42:51Z","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-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","authors_text":"Hendrik Molter, Henning Seidler, Meike Hatzel, Steffen H\\\"artlein, Till Fluschnik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-07T11:22:53Z","title":"The Minimum Shared Edges Problem on Grid-like Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02332","kind":"arxiv","version":2},"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:c245b7e4bfbe35a47fafed3a599c8a268daba358597b8545e1091a57c4c26400","target":"record","created_at":"2026-05-18T00:42:51Z","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":"efc4d086bc3db790fb5bde2f6251d3519ab4d964358dd389ee5a094b641ec86f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-07T11:22:53Z","title_canon_sha256":"cdd5ebeeea78a6452af58efda8771e0dfb53eccc9a7d14a6bf5ef1316407896c"},"schema_version":"1.0","source":{"id":"1703.02332","kind":"arxiv","version":2}},"canonical_sha256":"9c6183e133b5fefd5a564987ed1976fb766dfda766410b733c63f9af820a39ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c6183e133b5fefd5a564987ed1976fb766dfda766410b733c63f9af820a39ed","first_computed_at":"2026-05-18T00:42:51.231805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:51.231805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X7duWGyGWyfXiEQOxYbokJUgxdPLTf3jaa6TYPA1bBDebnhVhKAnVaxGElR3hwO5jqTogQLTwHznMKeIsdZuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:51.232486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c245b7e4bfbe35a47fafed3a599c8a268daba358597b8545e1091a57c4c26400","sha256:159a5a88df3b84cdd6c2db244cd4e2468170abbd4d1575005dabe9f7b7a15603"],"state_sha256":"a4813eaf67f7fa5800330128c9da34c07024ae1830cc47d1150c89cce1951330"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gL5fFnDfDev+OB6VVqEqUBJMj8IZ5Zx1wDOdmfDr+Jz/rmua6/sB9muXEed5VJuQMMDPoya42AW55LfpYpyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:17:07.796560Z","bundle_sha256":"1137f4a82727d8330331acc6f2df065b99b401caeba3c489f88bd4872ce9aa43"}}