{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CYGQ5HL65I4SGWU7BZ7OUAFTX6","short_pith_number":"pith:CYGQ5HL6","canonical_record":{"source":{"id":"1305.0507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-02T16:47:27Z","cross_cats_sorted":["cs.DB","physics.soc-ph"],"title_canon_sha256":"c8ca51fc991be78b889b389597285a6ebeaeaed98eb5e5cdf928c0295a0a2e9d","abstract_canon_sha256":"535aca884514f141bd0dec92de406a98d33eed79ac86c36eb9552f82950ffbec"},"schema_version":"1.0"},"canonical_sha256":"160d0e9d7eea39235a9f0e7eea00b3bfab774d92da430ca4b7f8760e41a5d7b0","source":{"kind":"arxiv","id":"1305.0507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0507","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0507v1","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0507","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"CYGQ5HL65I4S","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CYGQ5HL65I4SGWU7","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CYGQ5HL6","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CYGQ5HL65I4SGWU7BZ7OUAFTX6","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-02T16:47:27Z","cross_cats_sorted":["cs.DB","physics.soc-ph"],"title_canon_sha256":"c8ca51fc991be78b889b389597285a6ebeaeaed98eb5e5cdf928c0295a0a2e9d","abstract_canon_sha256":"535aca884514f141bd0dec92de406a98d33eed79ac86c36eb9552f82950ffbec"},"schema_version":"1.0"},"canonical_sha256":"160d0e9d7eea39235a9f0e7eea00b3bfab774d92da430ca4b7f8760e41a5d7b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.040890Z","signature_b64":"HTzG7shnSM4fIuBsH/UFYJf0tw37vUsfqxqer3rRuFTB9wuTxsxbAr7wkvkWRpTQJhNgWRURIZRkobpmQc5FBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"160d0e9d7eea39235a9f0e7eea00b3bfab774d92da430ca4b7f8760e41a5d7b0","last_reissued_at":"2026-05-18T03:26:40.040243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.040243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0507","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1fqeMw546dCbvuWoNitLHfQXXCrLIkYxPulF9mfSlPrj1LXcyYNokcSI4mgwyD0nz1VZOiylAvl2vPxEhRhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:30:31.426766Z"},"content_sha256":"ab853abb3daa1b755f466bac7ff98c6d1e24e607e2fe949b41631636db6f690c","schema_version":"1.0","event_id":"sha256:ab853abb3daa1b755f466bac7ff98c6d1e24e607e2fe949b41631636db6f690c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CYGQ5HL65I4SGWU7BZ7OUAFTX6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bo You, Haixun Wang, Ning Ruan, Ruoming Jin","submitted_at":"2013-05-02T16:47:27Z","abstract_excerpt":"Shortest path computation is one of the most fundamental operations for managing and analyzing large social networks. Though existing techniques are quite effective for finding the shortest path on large but sparse road networks, social graphs have quite different characteristics: they are generally non-spatial, non-weighted, scale-free, and they exhibit small-world properties in addition to their massive size. In particular, the existence of hubs, those vertices with a large number of connections, explodes the search space, making the shortest path computation surprisingly challenging. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0507","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+iNG23OuI4zz4CR4DaGIstP8aof3cVdi7DwwyZ2CHNEBa8P6zKhYjBNUIFIRCrdUjkFlnNhQsStYLKU5lUPkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:30:31.427100Z"},"content_sha256":"1535faa04a9f34cac66783e75f8657b1291efb773ad97c20e88745bb8ca73f8e","schema_version":"1.0","event_id":"sha256:1535faa04a9f34cac66783e75f8657b1291efb773ad97c20e88745bb8ca73f8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYGQ5HL65I4SGWU7BZ7OUAFTX6/bundle.json","state_url":"https://pith.science/pith/CYGQ5HL65I4SGWU7BZ7OUAFTX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYGQ5HL65I4SGWU7BZ7OUAFTX6/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-01T16:30:31Z","links":{"resolver":"https://pith.science/pith/CYGQ5HL65I4SGWU7BZ7OUAFTX6","bundle":"https://pith.science/pith/CYGQ5HL65I4SGWU7BZ7OUAFTX6/bundle.json","state":"https://pith.science/pith/CYGQ5HL65I4SGWU7BZ7OUAFTX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYGQ5HL65I4SGWU7BZ7OUAFTX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CYGQ5HL65I4SGWU7BZ7OUAFTX6","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":"535aca884514f141bd0dec92de406a98d33eed79ac86c36eb9552f82950ffbec","cross_cats_sorted":["cs.DB","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-02T16:47:27Z","title_canon_sha256":"c8ca51fc991be78b889b389597285a6ebeaeaed98eb5e5cdf928c0295a0a2e9d"},"schema_version":"1.0","source":{"id":"1305.0507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0507","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0507v1","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0507","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"CYGQ5HL65I4S","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CYGQ5HL65I4SGWU7","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CYGQ5HL6","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:1535faa04a9f34cac66783e75f8657b1291efb773ad97c20e88745bb8ca73f8e","target":"graph","created_at":"2026-05-18T03:26:40Z","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":"Shortest path computation is one of the most fundamental operations for managing and analyzing large social networks. Though existing techniques are quite effective for finding the shortest path on large but sparse road networks, social graphs have quite different characteristics: they are generally non-spatial, non-weighted, scale-free, and they exhibit small-world properties in addition to their massive size. In particular, the existence of hubs, those vertices with a large number of connections, explodes the search space, making the shortest path computation surprisingly challenging. In thi","authors_text":"Bo You, Haixun Wang, Ning Ruan, Ruoming Jin","cross_cats":["cs.DB","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-02T16:47:27Z","title":"Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0507","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:ab853abb3daa1b755f466bac7ff98c6d1e24e607e2fe949b41631636db6f690c","target":"record","created_at":"2026-05-18T03:26:40Z","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":"535aca884514f141bd0dec92de406a98d33eed79ac86c36eb9552f82950ffbec","cross_cats_sorted":["cs.DB","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-02T16:47:27Z","title_canon_sha256":"c8ca51fc991be78b889b389597285a6ebeaeaed98eb5e5cdf928c0295a0a2e9d"},"schema_version":"1.0","source":{"id":"1305.0507","kind":"arxiv","version":1}},"canonical_sha256":"160d0e9d7eea39235a9f0e7eea00b3bfab774d92da430ca4b7f8760e41a5d7b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"160d0e9d7eea39235a9f0e7eea00b3bfab774d92da430ca4b7f8760e41a5d7b0","first_computed_at":"2026-05-18T03:26:40.040243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:40.040243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HTzG7shnSM4fIuBsH/UFYJf0tw37vUsfqxqer3rRuFTB9wuTxsxbAr7wkvkWRpTQJhNgWRURIZRkobpmQc5FBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:40.040890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab853abb3daa1b755f466bac7ff98c6d1e24e607e2fe949b41631636db6f690c","sha256:1535faa04a9f34cac66783e75f8657b1291efb773ad97c20e88745bb8ca73f8e"],"state_sha256":"22c26d13dd6ed0198355b8e12641463db4017987a1adc1f7f08b7e739ce8bf77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpOo3jggnCFa5Gubslo1e3akHpCL/skytBHrQuZzNyRXJT0X47p/YOXg0SG5uoj/mgpPsvc0Y5BMZOYu/hojBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:30:31.428853Z","bundle_sha256":"f185f7a6d07a4f40c5cbe1c54dd85e8b2a162ac681512f7fb06e3a59c0651d61"}}