{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P5PWNZAX4BQFQBIK6WVCFGY3HH","short_pith_number":"pith:P5PWNZAX","canonical_record":{"source":{"id":"1911.01956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-05T17:33:02Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7c3747a9bdcc9c9db1a863122983bea4640b5fd5a7f2bbb8b04b76b5d8b6bc74","abstract_canon_sha256":"1c135a9ef2d76f36e031d6e382cff83d3b0c972476b2441a55f1eff533acad87"},"schema_version":"1.0"},"canonical_sha256":"7f5f66e417e06058050af5aa229b1b39f1ae7f8a3459ed30a73a6e625d1c95e9","source":{"kind":"arxiv","id":"1911.01956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.01956","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1911.01956v1","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01956","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"P5PWNZAX4BQF","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"pith_short_16","alias_value":"P5PWNZAX4BQFQBIK","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"pith_short_8","alias_value":"P5PWNZAX","created_at":"2026-07-05T00:17:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P5PWNZAX4BQFQBIK6WVCFGY3HH","target":"record","payload":{"canonical_record":{"source":{"id":"1911.01956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-05T17:33:02Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7c3747a9bdcc9c9db1a863122983bea4640b5fd5a7f2bbb8b04b76b5d8b6bc74","abstract_canon_sha256":"1c135a9ef2d76f36e031d6e382cff83d3b0c972476b2441a55f1eff533acad87"},"schema_version":"1.0"},"canonical_sha256":"7f5f66e417e06058050af5aa229b1b39f1ae7f8a3459ed30a73a6e625d1c95e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:23.288787Z","signature_b64":"JAURHG+iIfNvtDihD2ZJeTfxpDRJ/rZR1OwsofIesZvUPs7eBiI733FPxjIKUUfz2BaJIxQZbw85EacqHKa7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f5f66e417e06058050af5aa229b1b39f1ae7f8a3459ed30a73a6e625d1c95e9","last_reissued_at":"2026-07-05T00:17:23.288405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:23.288405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.01956","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-07-05T00:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmJQgZzXPdYLcD6ROfkpddMUSekU6sQ8F94kmlF/yob7WLAUMsnLhB11583kVfdOIudXvQHjPkhRXt0g7dGXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:14:58.039161Z"},"content_sha256":"ff301a9d63f44605560d45052a0b388474764e2f59996714f1a3d4e3075876b1","schema_version":"1.0","event_id":"sha256:ff301a9d63f44605560d45052a0b388474764e2f59996714f1a3d4e3075876b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P5PWNZAX4BQFQBIK6WVCFGY3HH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Clifford Stein, Peilin Zhong","submitted_at":"2019-11-05T17:33:02Z","abstract_excerpt":"We present a $(1+\\varepsilon)$-approximate parallel algorithm for computing shortest paths in undirected graphs, achieving $\\mathrm{poly}(\\log n)$ depth and $m\\mathrm{poly}(\\log n)$ work for $n$-nodes $m$-edges graphs. Although sequential algorithms with (nearly) optimal running time have been known for several decades, near-optimal parallel algorithms have turned out to be a much tougher challenge. For $(1+\\varepsilon)$-approximation, all prior algorithms with $\\mathrm{poly}(\\log n)$ depth perform at least $\\Omega(mn^{c})$ work for some constant $c>0$. Improving this long-standing upper bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01956","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.01956/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKCVLoQqmoBiVKkBTq926jXcQFTRfvhCy+tIv05UkE1duR1Yky8k9RcwEBvovRjYM8Ew6mnqNdVmQwkVlgIaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:14:58.039720Z"},"content_sha256":"0d2d788a6c698ab7f57420eedd098943d576dc014e311ce10fa1aa3c8d8763e2","schema_version":"1.0","event_id":"sha256:0d2d788a6c698ab7f57420eedd098943d576dc014e311ce10fa1aa3c8d8763e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/bundle.json","state_url":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/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-08-16T11:14:58Z","links":{"resolver":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH","bundle":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/bundle.json","state":"https://pith.science/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5PWNZAX4BQFQBIK6WVCFGY3HH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P5PWNZAX4BQFQBIK6WVCFGY3HH","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":"1c135a9ef2d76f36e031d6e382cff83d3b0c972476b2441a55f1eff533acad87","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-05T17:33:02Z","title_canon_sha256":"7c3747a9bdcc9c9db1a863122983bea4640b5fd5a7f2bbb8b04b76b5d8b6bc74"},"schema_version":"1.0","source":{"id":"1911.01956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.01956","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1911.01956v1","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01956","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"P5PWNZAX4BQF","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"pith_short_16","alias_value":"P5PWNZAX4BQFQBIK","created_at":"2026-07-05T00:17:23Z"},{"alias_kind":"pith_short_8","alias_value":"P5PWNZAX","created_at":"2026-07-05T00:17:23Z"}],"graph_snapshots":[{"event_id":"sha256:0d2d788a6c698ab7f57420eedd098943d576dc014e311ce10fa1aa3c8d8763e2","target":"graph","created_at":"2026-07-05T00:17:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.01956/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a $(1+\\varepsilon)$-approximate parallel algorithm for computing shortest paths in undirected graphs, achieving $\\mathrm{poly}(\\log n)$ depth and $m\\mathrm{poly}(\\log n)$ work for $n$-nodes $m$-edges graphs. Although sequential algorithms with (nearly) optimal running time have been known for several decades, near-optimal parallel algorithms have turned out to be a much tougher challenge. For $(1+\\varepsilon)$-approximation, all prior algorithms with $\\mathrm{poly}(\\log n)$ depth perform at least $\\Omega(mn^{c})$ work for some constant $c>0$. Improving this long-standing upper bound","authors_text":"Alexandr Andoni, Clifford Stein, Peilin Zhong","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-05T17:33:02Z","title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01956","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:ff301a9d63f44605560d45052a0b388474764e2f59996714f1a3d4e3075876b1","target":"record","created_at":"2026-07-05T00:17:23Z","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":"1c135a9ef2d76f36e031d6e382cff83d3b0c972476b2441a55f1eff533acad87","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-05T17:33:02Z","title_canon_sha256":"7c3747a9bdcc9c9db1a863122983bea4640b5fd5a7f2bbb8b04b76b5d8b6bc74"},"schema_version":"1.0","source":{"id":"1911.01956","kind":"arxiv","version":1}},"canonical_sha256":"7f5f66e417e06058050af5aa229b1b39f1ae7f8a3459ed30a73a6e625d1c95e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f5f66e417e06058050af5aa229b1b39f1ae7f8a3459ed30a73a6e625d1c95e9","first_computed_at":"2026-07-05T00:17:23.288405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:17:23.288405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JAURHG+iIfNvtDihD2ZJeTfxpDRJ/rZR1OwsofIesZvUPs7eBiI733FPxjIKUUfz2BaJIxQZbw85EacqHKa7Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T00:17:23.288787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.01956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff301a9d63f44605560d45052a0b388474764e2f59996714f1a3d4e3075876b1","sha256:0d2d788a6c698ab7f57420eedd098943d576dc014e311ce10fa1aa3c8d8763e2"],"state_sha256":"9ba5e941a7277f4bc3f34e617cde4527182d5fb10940b2acf5eb13117a647c89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIj3rDcdA/p8bBDrzI1bpmfeSMvNWLHYks2nviyZGjwOt8C0bVMxaUS4HczesL2MDCmfyAAOXu/kh7KYN3oiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:14:58.043127Z","bundle_sha256":"9d036581d4dc8aa1aa449d1ff49a957e86c277810dc24e03114487d0c8cba1cf"}}