{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UUYNZ324B64U6T2DTMJPQFLJQK","short_pith_number":"pith:UUYNZ324","schema_version":"1.0","canonical_sha256":"a530dcef5c0fb94f4f439b12f81569829e73190ce5201c8c38b2e9d1acea1e21","source":{"kind":"arxiv","id":"1602.01385","version":1},"attestation_state":"computed","paper":{"title":"The Minimum Shared Edges Problem on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Till Fluschnik","submitted_at":"2016-02-03T17:38:15Z","abstract_excerpt":"We study the Minimum Shared Edges problem introduced by Omran et al. [Journal of Combinatorial Optimization, 2015] on planar graphs: Planar MSE asks, given a planar graph G = (V,E), two distinct vertices s,t in V , and two integers p, k, whether there are p s-t paths in G that share at most k edges, where an edges is called shared if it appears in at least two of the p s-t paths. We show that Planar MSE is NP-hard by reduction from Vertex Cover. We make use of a grid-like structure, where the alignment (horizontal/vertical) of the edges in the grid correspond to selection and validation gadget"},"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.01385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-03T17:38:15Z","cross_cats_sorted":[],"title_canon_sha256":"7123c5441111cbe9490136143e67dc6cd8d271eefc4e825bffbb19a618435f99","abstract_canon_sha256":"e5216f36dfdef8d924c8a48eb4e361ba85c58f4778d111204a979dca2aff3df3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:20.319562Z","signature_b64":"BlEYFbOGPTQMGoImHZVwQamvafOw3OYQrB/6gJRUrfMZoZuZ/pEt0qQ4/70vsmuweQthr9PzWoBRyPXm/olwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a530dcef5c0fb94f4f439b12f81569829e73190ce5201c8c38b2e9d1acea1e21","last_reissued_at":"2026-05-18T01:21:20.318809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:20.318809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Minimum Shared Edges Problem on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Till Fluschnik","submitted_at":"2016-02-03T17:38:15Z","abstract_excerpt":"We study the Minimum Shared Edges problem introduced by Omran et al. [Journal of Combinatorial Optimization, 2015] on planar graphs: Planar MSE asks, given a planar graph G = (V,E), two distinct vertices s,t in V , and two integers p, k, whether there are p s-t paths in G that share at most k edges, where an edges is called shared if it appears in at least two of the p s-t paths. We show that Planar MSE is NP-hard by reduction from Vertex Cover. We make use of a grid-like structure, where the alignment (horizontal/vertical) of the edges in the grid correspond to selection and validation gadget"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01385","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.01385","created_at":"2026-05-18T01:21:20.318931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01385v1","created_at":"2026-05-18T01:21:20.318931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01385","created_at":"2026-05-18T01:21:20.318931+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUYNZ324B64U","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUYNZ324B64U6T2D","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUYNZ324","created_at":"2026-05-18T12:30:46.583412+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/UUYNZ324B64U6T2DTMJPQFLJQK","json":"https://pith.science/pith/UUYNZ324B64U6T2DTMJPQFLJQK.json","graph_json":"https://pith.science/api/pith-number/UUYNZ324B64U6T2DTMJPQFLJQK/graph.json","events_json":"https://pith.science/api/pith-number/UUYNZ324B64U6T2DTMJPQFLJQK/events.json","paper":"https://pith.science/paper/UUYNZ324"},"agent_actions":{"view_html":"https://pith.science/pith/UUYNZ324B64U6T2DTMJPQFLJQK","download_json":"https://pith.science/pith/UUYNZ324B64U6T2DTMJPQFLJQK.json","view_paper":"https://pith.science/paper/UUYNZ324","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01385&json=true","fetch_graph":"https://pith.science/api/pith-number/UUYNZ324B64U6T2DTMJPQFLJQK/graph.json","fetch_events":"https://pith.science/api/pith-number/UUYNZ324B64U6T2DTMJPQFLJQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUYNZ324B64U6T2DTMJPQFLJQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUYNZ324B64U6T2DTMJPQFLJQK/action/storage_attestation","attest_author":"https://pith.science/pith/UUYNZ324B64U6T2DTMJPQFLJQK/action/author_attestation","sign_citation":"https://pith.science/pith/UUYNZ324B64U6T2DTMJPQFLJQK/action/citation_signature","submit_replication":"https://pith.science/pith/UUYNZ324B64U6T2DTMJPQFLJQK/action/replication_record"}},"created_at":"2026-05-18T01:21:20.318931+00:00","updated_at":"2026-05-18T01:21:20.318931+00:00"}