{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6VGVFTRXJ7W6THKR24GDSWKX6Q","short_pith_number":"pith:6VGVFTRX","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"},"canonical_sha256":"f54d52ce374fede99d51d70c395957f417c48558e183535d261fdccbc36f5424","source":{"kind":"arxiv","id":"1507.05980","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6VGVFTRXJ7W6THKR24GDSWKX6Q","target":"record","payload":{"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"},"canonical_sha256":"f54d52ce374fede99d51d70c395957f417c48558e183535d261fdccbc36f5424","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"},"source_kind":"arxiv","source_id":"1507.05980","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Egd6ppPZK8MXfakzsGZyqKj2BuRbMnmVkZMf6wJmO4QPc7kZ/+v9ogkIw7Qbcfr+6wYPgIO52tIDjzoKLsIcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:45:55.651972Z"},"content_sha256":"3466bdfa4a41343f0254505dcbb46f43f4c2e3ad51abaf82489d192e36df25e1","schema_version":"1.0","event_id":"sha256:3466bdfa4a41343f0254505dcbb46f43f4c2e3ad51abaf82489d192e36df25e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6VGVFTRXJ7W6THKR24GDSWKX6Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnin08lmhCNboumH9hzbV+CHaUIfyB2vLpGqKqEm0cm2VIlDlB9QnPubhLrFy+eKXYf2HRJINhyfVIe5AFs/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:45:55.652334Z"},"content_sha256":"138cb5addfddd692c8b8b87349c3063121a67ec01669bf4d8614a887d0ff8546","schema_version":"1.0","event_id":"sha256:138cb5addfddd692c8b8b87349c3063121a67ec01669bf4d8614a887d0ff8546"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/bundle.json","state_url":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T11:45:55Z","links":{"resolver":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q","bundle":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/bundle.json","state":"https://pith.science/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VGVFTRXJ7W6THKR24GDSWKX6Q/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7JKSoyiKuCSzY3LjzgFvnZOi3q26y9rVHZRelKyHMHRovHBbkBQZhaMU/hIy/Lp00QaROqNUTilRWawV+slBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:45:55.654361Z","bundle_sha256":"5e22ebb9b8e286ff86b153f06878a507f65b5c41bafba15ca1157cf8983efb24"}}