{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4DPRLMCTYIDVYM6UHUXPNCMNZV","short_pith_number":"pith:4DPRLMCT","canonical_record":{"source":{"id":"1306.1153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-06-05T15:46:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b63642cc2059c83dc98e84268868b207eec13b26cea8e2df6a752069454101dc","abstract_canon_sha256":"d3cbd92888bc3872dc26bf7bfc1392a0501bd91560eaca3c2dc8deb3721b24ff"},"schema_version":"1.0"},"canonical_sha256":"e0df15b053c2075c33d43d2ef6898dcd7139353aa4ebbb17b4981ad01eb7fb5f","source":{"kind":"arxiv","id":"1306.1153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1153","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1153v1","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1153","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"4DPRLMCTYIDV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4DPRLMCTYIDVYM6U","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4DPRLMCT","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4DPRLMCTYIDVYM6UHUXPNCMNZV","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-06-05T15:46:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b63642cc2059c83dc98e84268868b207eec13b26cea8e2df6a752069454101dc","abstract_canon_sha256":"d3cbd92888bc3872dc26bf7bfc1392a0501bd91560eaca3c2dc8deb3721b24ff"},"schema_version":"1.0"},"canonical_sha256":"e0df15b053c2075c33d43d2ef6898dcd7139353aa4ebbb17b4981ad01eb7fb5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:44.134292Z","signature_b64":"1Tcajy9vDsUF1Dw9JPljbqx9VIdxyts5HG34HDv9bwmTiIixp1KTp2TKp9NI9cu56OGZODriMEtoN1OB7aj/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0df15b053c2075c33d43d2ef6898dcd7139353aa4ebbb17b4981ad01eb7fb5f","last_reissued_at":"2026-05-18T03:21:44.133706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:44.133706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1153","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-18T03:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHuYVGrc8qN2yxTyWHNqE/p+xNlIA6p3rMvO8WksXTtTqSFWTPwxORA36Prm4ut60cNnJQs1Ta3RvxLv0U7kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:11:18.912884Z"},"content_sha256":"d804e0979ca74e41274aee053c8d17812bf634a0e94917344104d090cde89de2","schema_version":"1.0","event_id":"sha256:d804e0979ca74e41274aee053c8d17812bf634a0e94917344104d090cde89de2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4DPRLMCTYIDVYM6UHUXPNCMNZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Single-Source Shortest Path and Distance Queries on Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Andy Diwen Zhu, Sibo Wang, Wenqing Lin, Xiaokui Xiao","submitted_at":"2013-06-05T15:46:33Z","abstract_excerpt":"This paper investigates two types of graph queries: {\\em single source distance (SSD)} queries and {\\em single source shortest path (SSSP)} queries. Given a node $v$ in a graph $G$, an SSD query from $v$ asks for the distance from $v$ to any other node in $G$, while an SSSP query retrieves the shortest path from $v$ to any other node. These two types of queries are fundamental building blocks of numerous graph algorithms, and they find important applications in graph analysis, especially in the computation of graph measures. Most of the existing solutions for SSD and SSSP queries, however, req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1153","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-18T03:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ffnAugOyLyylWgxQprvvaobu6Y/aLsdjNpcDj7Xz0qK/26lg0wtdAw+FT9WykSnyGJt0RFg1NpuqC0w01yzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:11:18.913449Z"},"content_sha256":"6ea6778800f1658a520b0ba1f0ea699e7f67631cc1419e761efd8747cbd7dd12","schema_version":"1.0","event_id":"sha256:6ea6778800f1658a520b0ba1f0ea699e7f67631cc1419e761efd8747cbd7dd12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DPRLMCTYIDVYM6UHUXPNCMNZV/bundle.json","state_url":"https://pith.science/pith/4DPRLMCTYIDVYM6UHUXPNCMNZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DPRLMCTYIDVYM6UHUXPNCMNZV/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-27T04:11:18Z","links":{"resolver":"https://pith.science/pith/4DPRLMCTYIDVYM6UHUXPNCMNZV","bundle":"https://pith.science/pith/4DPRLMCTYIDVYM6UHUXPNCMNZV/bundle.json","state":"https://pith.science/pith/4DPRLMCTYIDVYM6UHUXPNCMNZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DPRLMCTYIDVYM6UHUXPNCMNZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4DPRLMCTYIDVYM6UHUXPNCMNZV","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":"d3cbd92888bc3872dc26bf7bfc1392a0501bd91560eaca3c2dc8deb3721b24ff","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-06-05T15:46:33Z","title_canon_sha256":"b63642cc2059c83dc98e84268868b207eec13b26cea8e2df6a752069454101dc"},"schema_version":"1.0","source":{"id":"1306.1153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1153","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1153v1","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1153","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"4DPRLMCTYIDV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4DPRLMCTYIDVYM6U","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4DPRLMCT","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:6ea6778800f1658a520b0ba1f0ea699e7f67631cc1419e761efd8747cbd7dd12","target":"graph","created_at":"2026-05-18T03:21:44Z","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":"This paper investigates two types of graph queries: {\\em single source distance (SSD)} queries and {\\em single source shortest path (SSSP)} queries. Given a node $v$ in a graph $G$, an SSD query from $v$ asks for the distance from $v$ to any other node in $G$, while an SSSP query retrieves the shortest path from $v$ to any other node. These two types of queries are fundamental building blocks of numerous graph algorithms, and they find important applications in graph analysis, especially in the computation of graph measures. Most of the existing solutions for SSD and SSSP queries, however, req","authors_text":"Andy Diwen Zhu, Sibo Wang, Wenqing Lin, Xiaokui Xiao","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-06-05T15:46:33Z","title":"Efficient Single-Source Shortest Path and Distance Queries on Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1153","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:d804e0979ca74e41274aee053c8d17812bf634a0e94917344104d090cde89de2","target":"record","created_at":"2026-05-18T03:21:44Z","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":"d3cbd92888bc3872dc26bf7bfc1392a0501bd91560eaca3c2dc8deb3721b24ff","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-06-05T15:46:33Z","title_canon_sha256":"b63642cc2059c83dc98e84268868b207eec13b26cea8e2df6a752069454101dc"},"schema_version":"1.0","source":{"id":"1306.1153","kind":"arxiv","version":1}},"canonical_sha256":"e0df15b053c2075c33d43d2ef6898dcd7139353aa4ebbb17b4981ad01eb7fb5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0df15b053c2075c33d43d2ef6898dcd7139353aa4ebbb17b4981ad01eb7fb5f","first_computed_at":"2026-05-18T03:21:44.133706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:44.133706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Tcajy9vDsUF1Dw9JPljbqx9VIdxyts5HG34HDv9bwmTiIixp1KTp2TKp9NI9cu56OGZODriMEtoN1OB7aj/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:44.134292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d804e0979ca74e41274aee053c8d17812bf634a0e94917344104d090cde89de2","sha256:6ea6778800f1658a520b0ba1f0ea699e7f67631cc1419e761efd8747cbd7dd12"],"state_sha256":"d071a2ddb1d7ee7c4536b308423cc8096d3d5ab0bd3c31984c19fdede395a4de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaNNPZE6kxcPRd5XzFd9XVuvyzIn0zq33LWdw6rX/AhR7KazX1TBtXLDMp3sJOKcblrCtEJLe+zvRnZHaXE4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:11:18.915939Z","bundle_sha256":"c251c706b0cad13bbb89392ead1e330a352ec4da7c8fd4d136814b8265ee73cb"}}