{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ONK5OMO3CXZV7MTI7M6YQ522LM","short_pith_number":"pith:ONK5OMO3","canonical_record":{"source":{"id":"1712.08709","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-12-23T03:55:22Z","cross_cats_sorted":["cs.DS","math.PR","physics.soc-ph"],"title_canon_sha256":"014720e69657509ff2b2ae288a6d599b778f219e338c3fcd80b31c2b06b40a9f","abstract_canon_sha256":"3692e8218af2368402db3b05448b743314bfedc30be597f09285d5967489eb4d"},"schema_version":"1.0"},"canonical_sha256":"7355d731db15f35fb268fb3d88775a5b30f374da201b7cf2404c6e648a7abc20","source":{"kind":"arxiv","id":"1712.08709","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08709","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08709v3","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08709","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"ONK5OMO3CXZV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ONK5OMO3CXZV7MTI","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ONK5OMO3","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ONK5OMO3CXZV7MTI7M6YQ522LM","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08709","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-12-23T03:55:22Z","cross_cats_sorted":["cs.DS","math.PR","physics.soc-ph"],"title_canon_sha256":"014720e69657509ff2b2ae288a6d599b778f219e338c3fcd80b31c2b06b40a9f","abstract_canon_sha256":"3692e8218af2368402db3b05448b743314bfedc30be597f09285d5967489eb4d"},"schema_version":"1.0"},"canonical_sha256":"7355d731db15f35fb268fb3d88775a5b30f374da201b7cf2404c6e648a7abc20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:26.515031Z","signature_b64":"K2j3qwONBXjBNkAHmI/F6aTAC/PseWLjfiyk2voaQVhLSLEg+Q5Tp/+61Y9VytlbKSBNgVxJl5LhBE8B8IubCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7355d731db15f35fb268fb3d88775a5b30f374da201b7cf2404c6e648a7abc20","last_reissued_at":"2026-05-17T23:54:26.514454Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:26.514454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08709","source_version":3,"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-17T23:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThHRFQfDI6LJ0OaG16x0LMTvd/8/3TbbmBMCPQPdF4OT5l9z9dUvleyeuKdeT6bEpx0RyuwOuk+YZjAa3aaKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:27:37.448662Z"},"content_sha256":"998cd70538b5de11e9929b0daacb6ef134d682b659ba3c94d00f1d29916c3af8","schema_version":"1.0","event_id":"sha256:998cd70538b5de11e9929b0daacb6ef134d682b659ba3c94d00f1d29916c3af8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ONK5OMO3CXZV7MTI7M6YQ522LM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pruning based Distance Sketches with Provable Guarantees on Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ashish Goel, Hongyang Zhang, Huacheng Yu","submitted_at":"2017-12-23T03:55:22Z","abstract_excerpt":"Measuring the distances between vertices on graphs is one of the most fundamental components in network analysis. Since finding shortest paths requires traversing the graph, it is challenging to obtain distance information on large graphs very quickly. In this work, we present a preprocessing algorithm that is able to create landmark based distance sketches efficiently, with strong theoretical guarantees. When evaluated on a diverse set of social and information networks, our algorithm significantly improves over existing approaches by reducing the number of landmarks stored, preprocessing tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08709","kind":"arxiv","version":3},"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-17T23:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPoi0GeHJdGjf0/r/gB37KKRkx42QZDokg1OKYKvgmaKMUj9kdvZwP1Vmrp7bwHFLrWYX5y2HnDPqGBvMmtqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:27:37.449615Z"},"content_sha256":"13d826c9ab7d76f126e6b90c1e7f08de6d8d13e3126e5c9ff8150612a07c40f5","schema_version":"1.0","event_id":"sha256:13d826c9ab7d76f126e6b90c1e7f08de6d8d13e3126e5c9ff8150612a07c40f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONK5OMO3CXZV7MTI7M6YQ522LM/bundle.json","state_url":"https://pith.science/pith/ONK5OMO3CXZV7MTI7M6YQ522LM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONK5OMO3CXZV7MTI7M6YQ522LM/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-06T17:27:37Z","links":{"resolver":"https://pith.science/pith/ONK5OMO3CXZV7MTI7M6YQ522LM","bundle":"https://pith.science/pith/ONK5OMO3CXZV7MTI7M6YQ522LM/bundle.json","state":"https://pith.science/pith/ONK5OMO3CXZV7MTI7M6YQ522LM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONK5OMO3CXZV7MTI7M6YQ522LM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ONK5OMO3CXZV7MTI7M6YQ522LM","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":"3692e8218af2368402db3b05448b743314bfedc30be597f09285d5967489eb4d","cross_cats_sorted":["cs.DS","math.PR","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-12-23T03:55:22Z","title_canon_sha256":"014720e69657509ff2b2ae288a6d599b778f219e338c3fcd80b31c2b06b40a9f"},"schema_version":"1.0","source":{"id":"1712.08709","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08709","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08709v3","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08709","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"ONK5OMO3CXZV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ONK5OMO3CXZV7MTI","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ONK5OMO3","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:13d826c9ab7d76f126e6b90c1e7f08de6d8d13e3126e5c9ff8150612a07c40f5","target":"graph","created_at":"2026-05-17T23:54:26Z","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":"Measuring the distances between vertices on graphs is one of the most fundamental components in network analysis. Since finding shortest paths requires traversing the graph, it is challenging to obtain distance information on large graphs very quickly. In this work, we present a preprocessing algorithm that is able to create landmark based distance sketches efficiently, with strong theoretical guarantees. When evaluated on a diverse set of social and information networks, our algorithm significantly improves over existing approaches by reducing the number of landmarks stored, preprocessing tim","authors_text":"Ashish Goel, Hongyang Zhang, Huacheng Yu","cross_cats":["cs.DS","math.PR","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-12-23T03:55:22Z","title":"Pruning based Distance Sketches with Provable Guarantees on Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08709","kind":"arxiv","version":3},"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:998cd70538b5de11e9929b0daacb6ef134d682b659ba3c94d00f1d29916c3af8","target":"record","created_at":"2026-05-17T23:54:26Z","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":"3692e8218af2368402db3b05448b743314bfedc30be597f09285d5967489eb4d","cross_cats_sorted":["cs.DS","math.PR","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-12-23T03:55:22Z","title_canon_sha256":"014720e69657509ff2b2ae288a6d599b778f219e338c3fcd80b31c2b06b40a9f"},"schema_version":"1.0","source":{"id":"1712.08709","kind":"arxiv","version":3}},"canonical_sha256":"7355d731db15f35fb268fb3d88775a5b30f374da201b7cf2404c6e648a7abc20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7355d731db15f35fb268fb3d88775a5b30f374da201b7cf2404c6e648a7abc20","first_computed_at":"2026-05-17T23:54:26.514454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:26.514454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K2j3qwONBXjBNkAHmI/F6aTAC/PseWLjfiyk2voaQVhLSLEg+Q5Tp/+61Y9VytlbKSBNgVxJl5LhBE8B8IubCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:26.515031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08709","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:998cd70538b5de11e9929b0daacb6ef134d682b659ba3c94d00f1d29916c3af8","sha256:13d826c9ab7d76f126e6b90c1e7f08de6d8d13e3126e5c9ff8150612a07c40f5"],"state_sha256":"d4c75eb899db19941706633b4702c1bd8151389095d32f19f10974fd164170db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOUCL2PfuSDrMJObxhNU58cWqB+AV4LMH5qif6MJ39x3+9Y4QcvicA/X/7Ilhl1oLRgOm2IwSDdo3MBIR6ZACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:27:37.453095Z","bundle_sha256":"9d49f245473f5fd261cafa0fb04dab183b41120cb279dcfa6e5f6b8effba90d4"}}