{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KSFEQEMNWDRMEM62RN3JYDXGRP","short_pith_number":"pith:KSFEQEMN","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"},"canonical_sha256":"548a48118db0e2c233da8b769c0ee68bdcf91083c565e44f19f6a5ee5abfe801","source":{"kind":"arxiv","id":"1202.0314","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0314","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0314v2","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0314","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"KSFEQEMNWDRM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KSFEQEMNWDRMEM62","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KSFEQEMN","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KSFEQEMNWDRMEM62RN3JYDXGRP","target":"record","payload":{"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"},"canonical_sha256":"548a48118db0e2c233da8b769c0ee68bdcf91083c565e44f19f6a5ee5abfe801","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"},"source_kind":"arxiv","source_id":"1202.0314","source_version":2,"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-18T03:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouYCYQVn+hRyVH6NM/OZ6SZc3SYwV+vePYRZfpRbbY7lxP93GCwm5JJicXhfWbRUSq4ahKGXgpKMnMWflf5DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:27:57.906423Z"},"content_sha256":"bb914d523fe3cf7a2d58ba42ae2e82e2f178f15de1eeb06dccc01e9ea82c9d75","schema_version":"1.0","event_id":"sha256:bb914d523fe3cf7a2d58ba42ae2e82e2f178f15de1eeb06dccc01e9ea82c9d75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KSFEQEMNWDRMEM62RN3JYDXGRP","target":"graph","payload":{"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"},"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-18T03:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1wND5GgW7vB6Z7BAAbg7JNQQOik82mZ30NgMZOBS6Gylduu7K5qmDRWHPpMhIwTggOSCi+ZlFa4GbFzTlspAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:27:57.906781Z"},"content_sha256":"29fbef557c087aafa04ca388168cbefaf4d28e306fcec9dfd78942bab9af907c","schema_version":"1.0","event_id":"sha256:29fbef557c087aafa04ca388168cbefaf4d28e306fcec9dfd78942bab9af907c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/bundle.json","state_url":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/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-01T15:27:57Z","links":{"resolver":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP","bundle":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/bundle.json","state":"https://pith.science/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSFEQEMNWDRMEM62RN3JYDXGRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KSFEQEMNWDRMEM62RN3JYDXGRP","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":"f0b18d74050febc58394a15a46b4e8b0b341c28ddfa9ad54e3d2e7b1e6462263","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T22:24:46Z","title_canon_sha256":"569f803d010b2cb9b755b49d57e8a96d2ac2f18111c8ce63dc352814ec259e47"},"schema_version":"1.0","source":{"id":"1202.0314","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0314","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0314v2","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0314","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"KSFEQEMNWDRM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KSFEQEMNWDRMEM62","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KSFEQEMN","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:29fbef557c087aafa04ca388168cbefaf4d28e306fcec9dfd78942bab9af907c","target":"graph","created_at":"2026-05-18T03:26:08Z","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":"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","authors_text":"Erin Wolf Chambers, Jeff Erickson, Sergio Cabello","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T22:24:46Z","title":"Multiple-Source Shortest Paths in Embedded Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0314","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:bb914d523fe3cf7a2d58ba42ae2e82e2f178f15de1eeb06dccc01e9ea82c9d75","target":"record","created_at":"2026-05-18T03:26:08Z","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":"f0b18d74050febc58394a15a46b4e8b0b341c28ddfa9ad54e3d2e7b1e6462263","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T22:24:46Z","title_canon_sha256":"569f803d010b2cb9b755b49d57e8a96d2ac2f18111c8ce63dc352814ec259e47"},"schema_version":"1.0","source":{"id":"1202.0314","kind":"arxiv","version":2}},"canonical_sha256":"548a48118db0e2c233da8b769c0ee68bdcf91083c565e44f19f6a5ee5abfe801","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"548a48118db0e2c233da8b769c0ee68bdcf91083c565e44f19f6a5ee5abfe801","first_computed_at":"2026-05-18T03:26:08.898578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:08.898578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4saY4x0LRNeviJ82pW+phjAPG8wIu4lZE5VEMj3xwgOdxH5ZUCkboGx4E3jxTFa/cMCJnukwVzpUji3G5ZmLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:08.899496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0314","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb914d523fe3cf7a2d58ba42ae2e82e2f178f15de1eeb06dccc01e9ea82c9d75","sha256:29fbef557c087aafa04ca388168cbefaf4d28e306fcec9dfd78942bab9af907c"],"state_sha256":"13c2fdfc262d9e036d25d79bc0f225f0f53e18c0da1ae1c73339cebe06fb328f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EfwiF824eYtSD0CWxmsex++bstEYmm7rdufDpjv9FSBK5VMf4ihGmEqK/HbCab+/KnVReYwrzuNAyeV6y0s/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:27:57.908796Z","bundle_sha256":"3ea8f306025d3fbe08ddcccb50f29ca39cd15309d8ab6e475795f3821e04e334"}}