{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TSRWDKQ66JN2HMAM7HUSLBJKSY","short_pith_number":"pith:TSRWDKQ6","schema_version":"1.0","canonical_sha256":"9ca361aa1ef25ba3b00cf9e925852a9631908c2c872ba54b788e45737cc1b416","source":{"kind":"arxiv","id":"1206.1134","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.1134","created_at":"2026-05-18T03:54:06.864904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1134v1","created_at":"2026-05-18T03:54:06.864904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1134","created_at":"2026-05-18T03:54:06.864904+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSRWDKQ66JN2","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSRWDKQ66JN2HMAM","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSRWDKQ6","created_at":"2026-05-18T12:27:23.164592+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/TSRWDKQ66JN2HMAM7HUSLBJKSY","json":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY.json","graph_json":"https://pith.science/api/pith-number/TSRWDKQ66JN2HMAM7HUSLBJKSY/graph.json","events_json":"https://pith.science/api/pith-number/TSRWDKQ66JN2HMAM7HUSLBJKSY/events.json","paper":"https://pith.science/paper/TSRWDKQ6"},"agent_actions":{"view_html":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY","download_json":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY.json","view_paper":"https://pith.science/paper/TSRWDKQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1134&json=true","fetch_graph":"https://pith.science/api/pith-number/TSRWDKQ66JN2HMAM7HUSLBJKSY/graph.json","fetch_events":"https://pith.science/api/pith-number/TSRWDKQ66JN2HMAM7HUSLBJKSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/action/storage_attestation","attest_author":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/action/author_attestation","sign_citation":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/action/citation_signature","submit_replication":"https://pith.science/pith/TSRWDKQ66JN2HMAM7HUSLBJKSY/action/replication_record"}},"created_at":"2026-05-18T03:54:06.864904+00:00","updated_at":"2026-05-18T03:54:06.864904+00:00"}