{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TSRWDKQ66JN2HMAM7HUSLBJKSY","short_pith_number":"pith:TSRWDKQ6","canonical_record":{"source":{"id":"1206.1134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-06-06T07:13:37Z","cross_cats_sorted":["cs.DB","physics.soc-ph"],"title_canon_sha256":"8203540a0e6beabf93d2783d7b806b5235b71e6c83160abd143d61a5305ad4f9","abstract_canon_sha256":"30dd40471b8ccedc5aee3f665d9337b8fbf66518779bb295001cec59db237307"},"schema_version":"1.0"},"canonical_sha256":"9ca361aa1ef25ba3b00cf9e925852a9631908c2c872ba54b788e45737cc1b416","source":{"kind":"arxiv","id":"1206.1134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1134","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1134v1","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1134","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"TSRWDKQ66JN2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TSRWDKQ66JN2HMAM","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TSRWDKQ6","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TSRWDKQ66JN2HMAM7HUSLBJKSY","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-06-06T07:13:37Z","cross_cats_sorted":["cs.DB","physics.soc-ph"],"title_canon_sha256":"8203540a0e6beabf93d2783d7b806b5235b71e6c83160abd143d61a5305ad4f9","abstract_canon_sha256":"30dd40471b8ccedc5aee3f665d9337b8fbf66518779bb295001cec59db237307"},"schema_version":"1.0"},"canonical_sha256":"9ca361aa1ef25ba3b00cf9e925852a9631908c2c872ba54b788e45737cc1b416","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.865502Z","signature_b64":"jBLWfMl5hnlnuQFi8C5RTOYNF7ch3SKKOl2Al39X0re56WqwavgzYNu82/+h+bW1Zt/Vh1Ud6Kr5BDysVO1aBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ca361aa1ef25ba3b00cf9e925852a9631908c2c872ba54b788e45737cc1b416","last_reissued_at":"2026-05-18T03:54:06.864783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.864783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1134","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:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBnFODblkF/FTAEFkJfCF/AdON1EwMjkph2n/u1hhaFc+0MQ0sxtKZymhmeU8YcFLP+NznXbrG5OxkLk+sVoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:43.540665Z"},"content_sha256":"8169d77691136836b7a045443a5fa930dd0a09c8ba9569b6a8b3be82cd3b02be","schema_version":"1.0","event_id":"sha256:8169d77691136836b7a045443a5fa930dd0a09c8ba9569b6a8b3be82cd3b02be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TSRWDKQ66JN2HMAM7HUSLBJKSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Paths in Less Than a Millisecond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ben Y. Zhao, Matthew Caesar, P. Brighten Godfrey, Rachit Agarwal","submitted_at":"2012-06-06T07:13:37Z","abstract_excerpt":"We consider the problem of answering point-to-point shortest path queries on massive social networks. The goal is to answer queries within tens of milliseconds while minimizing the memory requirements. We present a technique that achieves this goal for an extremely large fraction of path queries by exploiting the structure of the social networks.\n  Using evaluations on real-world datasets, we argue that our technique offers a unique trade-off between latency, memory and accuracy. For instance, for the LiveJournal social network (roughly 5 million nodes and 69 million edges), our technique can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1134","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:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A81NOGMouk0Hvt+KRSQuay+5ZgYwcraB963I1yEx5xUdd/5bUlT7q68H/6lL+2u4FPDYy0tO227kl+72SDIaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:43.541257Z"},"content_sha256":"1cacf4a74602968f8eb79c80f36108a3caca46d0d67cd4ceb2c8f3c02efc95e8","schema_version":"1.0","event_id":"sha256:1cacf4a74602968f8eb79c80f36108a3caca46d0d67cd4ceb2c8f3c02efc95e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/bundle.json","state_url":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/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-05-26T19:59:43Z","links":{"resolver":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY","bundle":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/bundle.json","state":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TSRWDKQ66JN2HMAM7HUSLBJKSY","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":"30dd40471b8ccedc5aee3f665d9337b8fbf66518779bb295001cec59db237307","cross_cats_sorted":["cs.DB","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-06-06T07:13:37Z","title_canon_sha256":"8203540a0e6beabf93d2783d7b806b5235b71e6c83160abd143d61a5305ad4f9"},"schema_version":"1.0","source":{"id":"1206.1134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1134","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1134v1","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1134","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"TSRWDKQ66JN2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TSRWDKQ66JN2HMAM","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TSRWDKQ6","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:1cacf4a74602968f8eb79c80f36108a3caca46d0d67cd4ceb2c8f3c02efc95e8","target":"graph","created_at":"2026-05-18T03:54:06Z","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":"We consider the problem of answering point-to-point shortest path queries on massive social networks. The goal is to answer queries within tens of milliseconds while minimizing the memory requirements. We present a technique that achieves this goal for an extremely large fraction of path queries by exploiting the structure of the social networks.\n  Using evaluations on real-world datasets, we argue that our technique offers a unique trade-off between latency, memory and accuracy. For instance, for the LiveJournal social network (roughly 5 million nodes and 69 million edges), our technique can ","authors_text":"Ben Y. Zhao, Matthew Caesar, P. Brighten Godfrey, Rachit Agarwal","cross_cats":["cs.DB","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-06-06T07:13:37Z","title":"Shortest Paths in Less Than a Millisecond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1134","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:8169d77691136836b7a045443a5fa930dd0a09c8ba9569b6a8b3be82cd3b02be","target":"record","created_at":"2026-05-18T03:54:06Z","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":"30dd40471b8ccedc5aee3f665d9337b8fbf66518779bb295001cec59db237307","cross_cats_sorted":["cs.DB","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-06-06T07:13:37Z","title_canon_sha256":"8203540a0e6beabf93d2783d7b806b5235b71e6c83160abd143d61a5305ad4f9"},"schema_version":"1.0","source":{"id":"1206.1134","kind":"arxiv","version":1}},"canonical_sha256":"9ca361aa1ef25ba3b00cf9e925852a9631908c2c872ba54b788e45737cc1b416","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ca361aa1ef25ba3b00cf9e925852a9631908c2c872ba54b788e45737cc1b416","first_computed_at":"2026-05-18T03:54:06.864783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:06.864783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jBLWfMl5hnlnuQFi8C5RTOYNF7ch3SKKOl2Al39X0re56WqwavgzYNu82/+h+bW1Zt/Vh1Ud6Kr5BDysVO1aBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:06.865502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8169d77691136836b7a045443a5fa930dd0a09c8ba9569b6a8b3be82cd3b02be","sha256:1cacf4a74602968f8eb79c80f36108a3caca46d0d67cd4ceb2c8f3c02efc95e8"],"state_sha256":"e9bb2d1a28b9a255a917cd1b4d0f6ff0cd79f2b9aad01e02ed49a4dd751e96c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44l8xCRhYUBO08NWqWag1Lkk0FxILX0tYFHgYvSUSoBFED8uvjJIhebdNLmjLJUcnDu+PrFrOF9pqbXhmaQ1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:59:43.544782Z","bundle_sha256":"9ba9f7343fe0dbaa190604e61df0bf75880ab190b2bb5e943086c4cbf9c1b4aa"}}