{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6JJ4IPFML7GSMBIAFXT7BTZIMF","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":"77dc68c696c7ee3b967397b509864255147aaa234a91b0b539ab5c8f5e20d493","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-16T13:36:39Z","title_canon_sha256":"16c84a37b858015c156a79cdd5ae426d1386473082fa3d2fbc42cf11a63e9ff6"},"schema_version":"1.0","source":{"id":"1511.04952","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04952","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04952v2","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04952","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"6JJ4IPFML7GS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6JJ4IPFML7GSMBIA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6JJ4IPFM","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:a4c6d50622560df5c07dff6a24140d9dd235e9422db8fb420965d7bc07d85922","target":"graph","created_at":"2026-05-18T01:26:40Z","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":"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 ","authors_text":"Dimitrios M. Thilikos, Isolde Adler, Stavros G. Kolliopoulos","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-16T13:36:39Z","title":"Planar Disjoint-Paths Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04952","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:daf42a6305378290ef8eadcf25912a8fd94aeced55167ecd4c47d3f2278f2615","target":"record","created_at":"2026-05-18T01:26:40Z","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":"77dc68c696c7ee3b967397b509864255147aaa234a91b0b539ab5c8f5e20d493","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-16T13:36:39Z","title_canon_sha256":"16c84a37b858015c156a79cdd5ae426d1386473082fa3d2fbc42cf11a63e9ff6"},"schema_version":"1.0","source":{"id":"1511.04952","kind":"arxiv","version":2}},"canonical_sha256":"f253c43cac5fcd2605002de7f0cf286140f3038576d2342cad10dd368a87ba0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f253c43cac5fcd2605002de7f0cf286140f3038576d2342cad10dd368a87ba0b","first_computed_at":"2026-05-18T01:26:40.543206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:40.543206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BHSYatmnfMs+BteQFUn4p6rAE7KBopleKDbNY7wodaVkKyzQGB+DARTZLq9wyA+NDVcLwBpcFCxneZQ5yduKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:40.543862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04952","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:daf42a6305378290ef8eadcf25912a8fd94aeced55167ecd4c47d3f2278f2615","sha256:a4c6d50622560df5c07dff6a24140d9dd235e9422db8fb420965d7bc07d85922"],"state_sha256":"6cb18dc90bcf14f91df098b86c3bd63e359d2492f1c0ca6589c37ed491ab3a21"}