{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:72X7VM7FMXZSYDJET2AO6F5Q6I","short_pith_number":"pith:72X7VM7F","canonical_record":{"source":{"id":"1907.11422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T08:23:44Z","cross_cats_sorted":[],"title_canon_sha256":"aef384ca4748c6a071a9581da59f2ca18f86cc45da5346d276081e57e52f3601","abstract_canon_sha256":"329a1fab8adbfd750b2de79bdee91a83d6d9685cc900354e890a24dc73b234b2"},"schema_version":"1.0"},"canonical_sha256":"feaffab3e565f32c0d249e80ef17b0f2099360ac9e4dda0b75766c5454cd0aae","source":{"kind":"arxiv","id":"1907.11422","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11422","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11422v3","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11422","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"72X7VM7FMXZS","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"pith_short_16","alias_value":"72X7VM7FMXZSYDJE","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"pith_short_8","alias_value":"72X7VM7F","created_at":"2026-07-05T04:39:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:72X7VM7FMXZSYDJET2AO6F5Q6I","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T08:23:44Z","cross_cats_sorted":[],"title_canon_sha256":"aef384ca4748c6a071a9581da59f2ca18f86cc45da5346d276081e57e52f3601","abstract_canon_sha256":"329a1fab8adbfd750b2de79bdee91a83d6d9685cc900354e890a24dc73b234b2"},"schema_version":"1.0"},"canonical_sha256":"feaffab3e565f32c0d249e80ef17b0f2099360ac9e4dda0b75766c5454cd0aae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:39:15.133474Z","signature_b64":"zicEbjHsGNMzjosMd/2iEjBl66Y24kyfwrDQTgLJ9a46Twxibf27avGXUBMhrUOBn5S7EusgqRKRXX81gfWpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feaffab3e565f32c0d249e80ef17b0f2099360ac9e4dda0b75766c5454cd0aae","last_reissued_at":"2026-07-05T04:39:15.133011Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:39:15.133011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11422","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-07-05T04:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTCXRx7ZBCx3/pTzhxM/TZM/LAFNAS08Qatgz2zub71FrhSFo+UioQE0rUutuPKbUbr/wRGBgdgvOtqb2fA9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T19:49:23.271117Z"},"content_sha256":"10aff0d750b9951c97aa9ce953cf498c95c440614ee40335bfc2cca53b5f3e5a","schema_version":"1.0","event_id":"sha256:10aff0d750b9951c97aa9ce953cf498c95c440614ee40335bfc2cca53b5f3e5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:72X7VM7FMXZSYDJET2AO6F5Q6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Shortest Paths with Near-Additive Error in Weighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Elkin, Ofer Neiman, Yuval Gitlitz","submitted_at":"2019-07-26T08:23:44Z","abstract_excerpt":"Let $G=(V,E,w)$ be a weighted undirected graph with $n$ vertices and $m$ edges, and fix a set of $s$ sources $S\\subseteq V$. We study the problem of computing {\\em almost shortest paths} (ASP) for all pairs in $S \\times V$ in both classical centralized and parallel (PRAM) models of computation. Consider the regime of multiplicative approximation of $1+\\epsilon$, for an arbitrarily small constant $\\epsilon > 0$ . In this regime existing centralized algorithms require $\\Omega(\\min\\{|E|s,n^\\omega\\})$ time, where $\\omega < 2.372$ is the matrix multiplication exponent. Existing PRAM algorithms with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11422","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.11422/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-05T04:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OkUeYtmvaEoRl97o1n6MIwarYcJGHeEc805jHP12kK1L80wjBQ2ew8Y0Is8qNA+z3Y31TL/jIgnj2mazYMq5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T19:49:23.271610Z"},"content_sha256":"17ef53c4870027f5be46bf82e8c289271ab5e48a727c9940334dcd21f01449dd","schema_version":"1.0","event_id":"sha256:17ef53c4870027f5be46bf82e8c289271ab5e48a727c9940334dcd21f01449dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72X7VM7FMXZSYDJET2AO6F5Q6I/bundle.json","state_url":"https://pith.science/pith/72X7VM7FMXZSYDJET2AO6F5Q6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72X7VM7FMXZSYDJET2AO6F5Q6I/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-20T19:49:23Z","links":{"resolver":"https://pith.science/pith/72X7VM7FMXZSYDJET2AO6F5Q6I","bundle":"https://pith.science/pith/72X7VM7FMXZSYDJET2AO6F5Q6I/bundle.json","state":"https://pith.science/pith/72X7VM7FMXZSYDJET2AO6F5Q6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72X7VM7FMXZSYDJET2AO6F5Q6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:72X7VM7FMXZSYDJET2AO6F5Q6I","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":"329a1fab8adbfd750b2de79bdee91a83d6d9685cc900354e890a24dc73b234b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T08:23:44Z","title_canon_sha256":"aef384ca4748c6a071a9581da59f2ca18f86cc45da5346d276081e57e52f3601"},"schema_version":"1.0","source":{"id":"1907.11422","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11422","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11422v3","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11422","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"72X7VM7FMXZS","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"pith_short_16","alias_value":"72X7VM7FMXZSYDJE","created_at":"2026-07-05T04:39:15Z"},{"alias_kind":"pith_short_8","alias_value":"72X7VM7F","created_at":"2026-07-05T04:39:15Z"}],"graph_snapshots":[{"event_id":"sha256:17ef53c4870027f5be46bf82e8c289271ab5e48a727c9940334dcd21f01449dd","target":"graph","created_at":"2026-07-05T04:39:15Z","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/1907.11422/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G=(V,E,w)$ be a weighted undirected graph with $n$ vertices and $m$ edges, and fix a set of $s$ sources $S\\subseteq V$. We study the problem of computing {\\em almost shortest paths} (ASP) for all pairs in $S \\times V$ in both classical centralized and parallel (PRAM) models of computation. Consider the regime of multiplicative approximation of $1+\\epsilon$, for an arbitrarily small constant $\\epsilon > 0$ . In this regime existing centralized algorithms require $\\Omega(\\min\\{|E|s,n^\\omega\\})$ time, where $\\omega < 2.372$ is the matrix multiplication exponent. Existing PRAM algorithms with","authors_text":"Michael Elkin, Ofer Neiman, Yuval Gitlitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T08:23:44Z","title":"Almost Shortest Paths with Near-Additive Error in Weighted Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11422","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:10aff0d750b9951c97aa9ce953cf498c95c440614ee40335bfc2cca53b5f3e5a","target":"record","created_at":"2026-07-05T04:39:15Z","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":"329a1fab8adbfd750b2de79bdee91a83d6d9685cc900354e890a24dc73b234b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T08:23:44Z","title_canon_sha256":"aef384ca4748c6a071a9581da59f2ca18f86cc45da5346d276081e57e52f3601"},"schema_version":"1.0","source":{"id":"1907.11422","kind":"arxiv","version":3}},"canonical_sha256":"feaffab3e565f32c0d249e80ef17b0f2099360ac9e4dda0b75766c5454cd0aae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"feaffab3e565f32c0d249e80ef17b0f2099360ac9e4dda0b75766c5454cd0aae","first_computed_at":"2026-07-05T04:39:15.133011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:39:15.133011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zicEbjHsGNMzjosMd/2iEjBl66Y24kyfwrDQTgLJ9a46Twxibf27avGXUBMhrUOBn5S7EusgqRKRXX81gfWpAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:39:15.133474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11422","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10aff0d750b9951c97aa9ce953cf498c95c440614ee40335bfc2cca53b5f3e5a","sha256:17ef53c4870027f5be46bf82e8c289271ab5e48a727c9940334dcd21f01449dd"],"state_sha256":"4ce530f4ed018a159ef703d64ca00fa2210cb9401c3f13b30b3e2e4deccecd71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ma9JsuTv87RcIK9qVG58kw2zriGPYRcRWxucZoIRBBlzo+u+XJvcQJSf0G2WpwxSfJtJKT4zsmlgBAS2tpUFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T19:49:23.275150Z","bundle_sha256":"8ad4085d455261e0e532410fa28fc35f1a2ad5ceeed3651104b78a319942d906"}}