{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6VGVFTRXJ7W6THKR24GDSWKX6Q","short_pith_number":"pith:6VGVFTRX","schema_version":"1.0","canonical_sha256":"f54d52ce374fede99d51d70c395957f417c48558e183535d261fdccbc36f5424","source":{"kind":"arxiv","id":"1507.05980","version":1},"attestation_state":"computed","paper":{"title":"Towards single face shortest vertex-disjoint paths in undirected planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Nayyeri, Farzad Zafarani, Glencora Borradaile","submitted_at":"2015-07-21T20:20:10Z","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"},"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":"1507.05980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-21T20:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"f2dd445fd665129efade73c334dd23764b4fbf07cdb0f26724bcd0da5b3678c2","abstract_canon_sha256":"16796fba1a0c694a3c8bade33517e5e2b4d637b1add1bfa8fb7a716c93d7a094"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:27.037999Z","signature_b64":"Sap9osDjsTlF+vZVJcc/dO/ZFc5aicZ9sIueeK5pypxMpNsDeh2YbetMRwmxOU4/2PXl6baEE178R5IK119YAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f54d52ce374fede99d51d70c395957f417c48558e183535d261fdccbc36f5424","last_reissued_at":"2026-05-18T01:36:27.037411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:27.037411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards single face shortest vertex-disjoint paths in undirected planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Nayyeri, Farzad Zafarani, Glencora Borradaile","submitted_at":"2015-07-21T20:20:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05980","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":"1507.05980","created_at":"2026-05-18T01:36:27.037506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05980v1","created_at":"2026-05-18T01:36:27.037506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05980","created_at":"2026-05-18T01:36:27.037506+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VGVFTRXJ7W6","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VGVFTRXJ7W6THKR","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VGVFTRX","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/6VGVFTRXJ7W6THKR24GDSWKX6Q","json":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q.json","graph_json":"https://pith.science/api/pith-number/6VGVFTRXJ7W6THKR24GDSWKX6Q/graph.json","events_json":"https://pith.science/api/pith-number/6VGVFTRXJ7W6THKR24GDSWKX6Q/events.json","paper":"https://pith.science/paper/6VGVFTRX"},"agent_actions":{"view_html":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q","download_json":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q.json","view_paper":"https://pith.science/paper/6VGVFTRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05980&json=true","fetch_graph":"https://pith.science/api/pith-number/6VGVFTRXJ7W6THKR24GDSWKX6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/6VGVFTRXJ7W6THKR24GDSWKX6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/action/storage_attestation","attest_author":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/action/author_attestation","sign_citation":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/action/citation_signature","submit_replication":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/action/replication_record"}},"created_at":"2026-05-18T01:36:27.037506+00:00","updated_at":"2026-05-18T01:36:27.037506+00:00"}