{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KSFEQEMNWDRMEM62RN3JYDXGRP","short_pith_number":"pith:KSFEQEMN","schema_version":"1.0","canonical_sha256":"548a48118db0e2c233da8b769c0ee68bdcf91083c565e44f19f6a5ee5abfe801","source":{"kind":"arxiv","id":"1202.0314","version":2},"attestation_state":"computed","paper":{"title":"Multiple-Source Shortest Paths in Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Erin Wolf Chambers, Jeff Erickson, Sergio Cabello","submitted_at":"2012-02-01T22:24:46Z","abstract_excerpt":"Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe a randomized algorithm to preprocess the graph in O(gn log n) time with high probability, so that the shortest-path distance from any vertex on the boundary of f to any other vertex in G can be retrieved in O(log n) time. Our result directly generalizes the O(n log n)-time algorithm of Klein [SODA 2005] for multiple-source shortest paths in planar graphs. Intuitively, our preprocessing algorithm maintains a shortest-path tr"},"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":"1202.0314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T22:24:46Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"569f803d010b2cb9b755b49d57e8a96d2ac2f18111c8ce63dc352814ec259e47","abstract_canon_sha256":"f0b18d74050febc58394a15a46b4e8b0b341c28ddfa9ad54e3d2e7b1e6462263"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:08.899496Z","signature_b64":"4saY4x0LRNeviJ82pW+phjAPG8wIu4lZE5VEMj3xwgOdxH5ZUCkboGx4E3jxTFa/cMCJnukwVzpUji3G5ZmLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"548a48118db0e2c233da8b769c0ee68bdcf91083c565e44f19f6a5ee5abfe801","last_reissued_at":"2026-05-18T03:26:08.898578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:08.898578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple-Source Shortest Paths in Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Erin Wolf Chambers, Jeff Erickson, Sergio Cabello","submitted_at":"2012-02-01T22:24:46Z","abstract_excerpt":"Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe a randomized algorithm to preprocess the graph in O(gn log n) time with high probability, so that the shortest-path distance from any vertex on the boundary of f to any other vertex in G can be retrieved in O(log n) time. Our result directly generalizes the O(n log n)-time algorithm of Klein [SODA 2005] for multiple-source shortest paths in planar graphs. Intuitively, our preprocessing algorithm maintains a shortest-path tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0314","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":"1202.0314","created_at":"2026-05-18T03:26:08.898737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0314v2","created_at":"2026-05-18T03:26:08.898737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0314","created_at":"2026-05-18T03:26:08.898737+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSFEQEMNWDRM","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSFEQEMNWDRMEM62","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSFEQEMN","created_at":"2026-05-18T12:27:11.947152+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/KSFEQEMNWDRMEM62RN3JYDXGRP","json":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP.json","graph_json":"https://pith.science/api/pith-number/KSFEQEMNWDRMEM62RN3JYDXGRP/graph.json","events_json":"https://pith.science/api/pith-number/KSFEQEMNWDRMEM62RN3JYDXGRP/events.json","paper":"https://pith.science/paper/KSFEQEMN"},"agent_actions":{"view_html":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP","download_json":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP.json","view_paper":"https://pith.science/paper/KSFEQEMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0314&json=true","fetch_graph":"https://pith.science/api/pith-number/KSFEQEMNWDRMEM62RN3JYDXGRP/graph.json","fetch_events":"https://pith.science/api/pith-number/KSFEQEMNWDRMEM62RN3JYDXGRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/action/storage_attestation","attest_author":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/action/author_attestation","sign_citation":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/action/citation_signature","submit_replication":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/action/replication_record"}},"created_at":"2026-05-18T03:26:08.898737+00:00","updated_at":"2026-05-18T03:26:08.898737+00:00"}