{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LA7PB4XJ3K3WSZNBFCJ64RPNMP","short_pith_number":"pith:LA7PB4XJ","canonical_record":{"source":{"id":"1201.2703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T23:03:18Z","cross_cats_sorted":["cs.DC","cs.NI","cs.SI"],"title_canon_sha256":"3f643ac046d7a27523270d11e6bc4b5fbc59ed546c39e1a56ecf7a6a319cbe1e","abstract_canon_sha256":"484cb60b98f1145d0cb379a2f1f1ec8d828a2ae07924683b586014ff0effd50e"},"schema_version":"1.0"},"canonical_sha256":"583ef0f2e9dab76965a12893ee45ed63e9ff41c246ce69e87161aaeaffd2b87a","source":{"kind":"arxiv","id":"1201.2703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2703","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2703v1","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2703","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"LA7PB4XJ3K3W","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LA7PB4XJ3K3WSZNB","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LA7PB4XJ","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LA7PB4XJ3K3WSZNBFCJ64RPNMP","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T23:03:18Z","cross_cats_sorted":["cs.DC","cs.NI","cs.SI"],"title_canon_sha256":"3f643ac046d7a27523270d11e6bc4b5fbc59ed546c39e1a56ecf7a6a319cbe1e","abstract_canon_sha256":"484cb60b98f1145d0cb379a2f1f1ec8d828a2ae07924683b586014ff0effd50e"},"schema_version":"1.0"},"canonical_sha256":"583ef0f2e9dab76965a12893ee45ed63e9ff41c246ce69e87161aaeaffd2b87a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:43.265680Z","signature_b64":"gpfTDKYOHl5dJg+AQVmR4NDSC1Y9Y01Z4IkQ3ou5fcZ62oGr6EW4HArN5WVGZsjiUB7IA25/PGfjjxiiE0H4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"583ef0f2e9dab76965a12893ee45ed63e9ff41c246ce69e87161aaeaffd2b87a","last_reissued_at":"2026-05-18T04:04:43.265072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:43.265072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2703","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-18T04:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Lp/X0QpNntS1fMY1/6d9ffoa7PhuGid76FdCmzgkxlsoTYHZ7anmWlVGbYh6TAESm2PwaP0iG2zL7Hyy1P/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:41:51.281341Z"},"content_sha256":"5ff15a389feb9db2991d2ff0a137374f886fa61f2cef72d0fa0f61004babc0c1","schema_version":"1.0","event_id":"sha256:5ff15a389feb9db2991d2ff0a137374f886fa61f2cef72d0fa0f61004babc0c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LA7PB4XJ3K3WSZNBFCJ64RPNMP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Approximate Distance Queries and Compact Routing in Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","cs.SI"],"primary_cat":"cs.DS","authors_text":"P. Brighten Godfrey, Rachit Agarwal, Sariel Har-Peled","submitted_at":"2012-01-12T23:03:18Z","abstract_excerpt":"A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to approximate shortest paths between any pair of vertices. Any distance oracle that returns paths of worst-case stretch (2k-1) must require space $\\Omega(n^{1 + 1/k})$ for graphs of n nodes. The hard cases that enforce this lower bound are, however, rather dense graphs with average degree \\Omega(n^{1/k}).\n  We present distance oracles that, for sparse graphs, substantially break the lower bound barrier at the expense of higher query time. For any 1 \\leq \\alpha \\leq n, our distance oracl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2703","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-18T04:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npxIZ9q+m08JiILdiRFPSBSPCzsq6A2DenmaevGURK58bzgc40k1wyb7cBRNjDI7dLN9xz2j6MGN5+DtyocAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:41:51.281766Z"},"content_sha256":"095241f467092a57e92800524c003fc74e774d0d920a502dd690da81d4df012a","schema_version":"1.0","event_id":"sha256:095241f467092a57e92800524c003fc74e774d0d920a502dd690da81d4df012a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LA7PB4XJ3K3WSZNBFCJ64RPNMP/bundle.json","state_url":"https://pith.science/pith/LA7PB4XJ3K3WSZNBFCJ64RPNMP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LA7PB4XJ3K3WSZNBFCJ64RPNMP/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-26T09:41:51Z","links":{"resolver":"https://pith.science/pith/LA7PB4XJ3K3WSZNBFCJ64RPNMP","bundle":"https://pith.science/pith/LA7PB4XJ3K3WSZNBFCJ64RPNMP/bundle.json","state":"https://pith.science/pith/LA7PB4XJ3K3WSZNBFCJ64RPNMP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LA7PB4XJ3K3WSZNBFCJ64RPNMP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LA7PB4XJ3K3WSZNBFCJ64RPNMP","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":"484cb60b98f1145d0cb379a2f1f1ec8d828a2ae07924683b586014ff0effd50e","cross_cats_sorted":["cs.DC","cs.NI","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T23:03:18Z","title_canon_sha256":"3f643ac046d7a27523270d11e6bc4b5fbc59ed546c39e1a56ecf7a6a319cbe1e"},"schema_version":"1.0","source":{"id":"1201.2703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2703","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2703v1","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2703","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"LA7PB4XJ3K3W","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LA7PB4XJ3K3WSZNB","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LA7PB4XJ","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:095241f467092a57e92800524c003fc74e774d0d920a502dd690da81d4df012a","target":"graph","created_at":"2026-05-18T04:04:43Z","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":"A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to approximate shortest paths between any pair of vertices. Any distance oracle that returns paths of worst-case stretch (2k-1) must require space $\\Omega(n^{1 + 1/k})$ for graphs of n nodes. The hard cases that enforce this lower bound are, however, rather dense graphs with average degree \\Omega(n^{1/k}).\n  We present distance oracles that, for sparse graphs, substantially break the lower bound barrier at the expense of higher query time. For any 1 \\leq \\alpha \\leq n, our distance oracl","authors_text":"P. Brighten Godfrey, Rachit Agarwal, Sariel Har-Peled","cross_cats":["cs.DC","cs.NI","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T23:03:18Z","title":"Faster Approximate Distance Queries and Compact Routing in Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2703","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:5ff15a389feb9db2991d2ff0a137374f886fa61f2cef72d0fa0f61004babc0c1","target":"record","created_at":"2026-05-18T04:04:43Z","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":"484cb60b98f1145d0cb379a2f1f1ec8d828a2ae07924683b586014ff0effd50e","cross_cats_sorted":["cs.DC","cs.NI","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T23:03:18Z","title_canon_sha256":"3f643ac046d7a27523270d11e6bc4b5fbc59ed546c39e1a56ecf7a6a319cbe1e"},"schema_version":"1.0","source":{"id":"1201.2703","kind":"arxiv","version":1}},"canonical_sha256":"583ef0f2e9dab76965a12893ee45ed63e9ff41c246ce69e87161aaeaffd2b87a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"583ef0f2e9dab76965a12893ee45ed63e9ff41c246ce69e87161aaeaffd2b87a","first_computed_at":"2026-05-18T04:04:43.265072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:43.265072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gpfTDKYOHl5dJg+AQVmR4NDSC1Y9Y01Z4IkQ3ou5fcZ62oGr6EW4HArN5WVGZsjiUB7IA25/PGfjjxiiE0H4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:43.265680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ff15a389feb9db2991d2ff0a137374f886fa61f2cef72d0fa0f61004babc0c1","sha256:095241f467092a57e92800524c003fc74e774d0d920a502dd690da81d4df012a"],"state_sha256":"2d6ffbbccc6da2703da6b4acf73b5f0932c619c6cd4d581580b524fce0a4137d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwi0bfoCPMFqEtGv7c1bEw4CsGQkXx14yGzgxo9Ya8MZ8Nm6GSLx9lqxUuXxcomOi6LArcW9Fim8+RCCyat+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:41:51.284972Z","bundle_sha256":"b0ef1e36e37f85d23f7da581c115647d1f0d0eecbb91c0b348d7e961479dbf29"}}