{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6VGVFTRXJ7W6THKR24GDSWKX6Q","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":"16796fba1a0c694a3c8bade33517e5e2b4d637b1add1bfa8fb7a716c93d7a094","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-21T20:20:10Z","title_canon_sha256":"f2dd445fd665129efade73c334dd23764b4fbf07cdb0f26724bcd0da5b3678c2"},"schema_version":"1.0","source":{"id":"1507.05980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05980","created_at":"2026-05-18T01:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05980v1","created_at":"2026-05-18T01:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05980","created_at":"2026-05-18T01:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"6VGVFTRXJ7W6","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6VGVFTRXJ7W6THKR","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6VGVFTRX","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:138cb5addfddd692c8b8b87349c3063121a67ec01669bf4d8614a887d0ff8546","target":"graph","created_at":"2026-05-18T01:36:27Z","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":"Given $k$ pairs of terminals $\\{(s_{1}, t_{1}), \\ldots, (s_{k}, t_{k})\\}$ in a graph $G$, the min-sum $k$ vertex-disjoint paths problem is to find a collection $\\{Q_{1}, Q_{2}, \\ldots, Q_{k}\\}$ of vertex-disjoint paths with minimum total length, where $Q_{i}$ is an $s_i$-to-$t_i$ path between $s_i$ and $t_i$. We consider the problem in planar graphs, where little is known about computational tractability, even in restricted cases. Kobayashi and Sommer propose a polynomial-time algorithm for $k \\le 3$ in undirected planar graphs assuming all terminals are adjacent to at most two faces. Colin de","authors_text":"Amir Nayyeri, Farzad Zafarani, Glencora Borradaile","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-21T20:20:10Z","title":"Towards single face shortest vertex-disjoint paths in undirected planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05980","kind":"arxiv","version":1},"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:3466bdfa4a41343f0254505dcbb46f43f4c2e3ad51abaf82489d192e36df25e1","target":"record","created_at":"2026-05-18T01:36:27Z","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":"16796fba1a0c694a3c8bade33517e5e2b4d637b1add1bfa8fb7a716c93d7a094","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-21T20:20:10Z","title_canon_sha256":"f2dd445fd665129efade73c334dd23764b4fbf07cdb0f26724bcd0da5b3678c2"},"schema_version":"1.0","source":{"id":"1507.05980","kind":"arxiv","version":1}},"canonical_sha256":"f54d52ce374fede99d51d70c395957f417c48558e183535d261fdccbc36f5424","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f54d52ce374fede99d51d70c395957f417c48558e183535d261fdccbc36f5424","first_computed_at":"2026-05-18T01:36:27.037411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:27.037411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sap9osDjsTlF+vZVJcc/dO/ZFc5aicZ9sIueeK5pypxMpNsDeh2YbetMRwmxOU4/2PXl6baEE178R5IK119YAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:27.037999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3466bdfa4a41343f0254505dcbb46f43f4c2e3ad51abaf82489d192e36df25e1","sha256:138cb5addfddd692c8b8b87349c3063121a67ec01669bf4d8614a887d0ff8546"],"state_sha256":"b5fc233f294c8cc66bc926ed66d84938b767981a9c29c9f0fa0dc9a5232d1a41"}