{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6JJ4IPFML7GSMBIAFXT7BTZIMF","short_pith_number":"pith:6JJ4IPFM","schema_version":"1.0","canonical_sha256":"f253c43cac5fcd2605002de7f0cf286140f3038576d2342cad10dd368a87ba0b","source":{"kind":"arxiv","id":"1511.04952","version":2},"attestation_state":"computed","paper":{"title":"Planar Disjoint-Paths Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Isolde Adler, Stavros G. Kolliopoulos","submitted_at":"2015-11-16T13:36:39Z","abstract_excerpt":"introduce {\\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$ pairs of terminals, and a face $F$ of $G,$ find a minimum-size set of edges, if one exists, to be added inside $F$ so that the embedding remains planar and the pairs become connected by $k$ disjoint paths in the augmented network. Our results are twofold: first, we give an upper bound on the number of necessary additional edges when a solution exists. This "},"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":"1511.04952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-16T13:36:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"16c84a37b858015c156a79cdd5ae426d1386473082fa3d2fbc42cf11a63e9ff6","abstract_canon_sha256":"77dc68c696c7ee3b967397b509864255147aaa234a91b0b539ab5c8f5e20d493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:40.543862Z","signature_b64":"BHSYatmnfMs+BteQFUn4p6rAE7KBopleKDbNY7wodaVkKyzQGB+DARTZLq9wyA+NDVcLwBpcFCxneZQ5yduKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f253c43cac5fcd2605002de7f0cf286140f3038576d2342cad10dd368a87ba0b","last_reissued_at":"2026-05-18T01:26:40.543206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:40.543206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Disjoint-Paths Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Isolde Adler, Stavros G. Kolliopoulos","submitted_at":"2015-11-16T13:36:39Z","abstract_excerpt":"introduce {\\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$ pairs of terminals, and a face $F$ of $G,$ find a minimum-size set of edges, if one exists, to be added inside $F$ so that the embedding remains planar and the pairs become connected by $k$ disjoint paths in the augmented network. Our results are twofold: first, we give an upper bound on the number of necessary additional edges when a solution exists. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04952","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":"1511.04952","created_at":"2026-05-18T01:26:40.543297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04952v2","created_at":"2026-05-18T01:26:40.543297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04952","created_at":"2026-05-18T01:26:40.543297+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JJ4IPFML7GS","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JJ4IPFML7GSMBIA","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JJ4IPFM","created_at":"2026-05-18T12:29:07.941421+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/6JJ4IPFML7GSMBIAFXT7BTZIMF","json":"https://pith.science/pith/6JJ4IPFML7GSMBIAFXT7BTZIMF.json","graph_json":"https://pith.science/api/pith-number/6JJ4IPFML7GSMBIAFXT7BTZIMF/graph.json","events_json":"https://pith.science/api/pith-number/6JJ4IPFML7GSMBIAFXT7BTZIMF/events.json","paper":"https://pith.science/paper/6JJ4IPFM"},"agent_actions":{"view_html":"https://pith.science/pith/6JJ4IPFML7GSMBIAFXT7BTZIMF","download_json":"https://pith.science/pith/6JJ4IPFML7GSMBIAFXT7BTZIMF.json","view_paper":"https://pith.science/paper/6JJ4IPFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04952&json=true","fetch_graph":"https://pith.science/api/pith-number/6JJ4IPFML7GSMBIAFXT7BTZIMF/graph.json","fetch_events":"https://pith.science/api/pith-number/6JJ4IPFML7GSMBIAFXT7BTZIMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JJ4IPFML7GSMBIAFXT7BTZIMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JJ4IPFML7GSMBIAFXT7BTZIMF/action/storage_attestation","attest_author":"https://pith.science/pith/6JJ4IPFML7GSMBIAFXT7BTZIMF/action/author_attestation","sign_citation":"https://pith.science/pith/6JJ4IPFML7GSMBIAFXT7BTZIMF/action/citation_signature","submit_replication":"https://pith.science/pith/6JJ4IPFML7GSMBIAFXT7BTZIMF/action/replication_record"}},"created_at":"2026-05-18T01:26:40.543297+00:00","updated_at":"2026-05-18T01:26:40.543297+00:00"}