{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:EXOB7CDI3LYMB7TL25IIIOQXKE","short_pith_number":"pith:EXOB7CDI","canonical_record":{"source":{"id":"2110.15944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-29T17:48:05Z","cross_cats_sorted":[],"title_canon_sha256":"7a7089244e82288deafcbb4fcd598e78c8d11401c7d2679c00e6cce4c7dd51ca","abstract_canon_sha256":"7bddfdf4de38741b947541dd5b2294b23e46688966cb095e988a8023ca8d8be0"},"schema_version":"1.0"},"canonical_sha256":"25dc1f8868daf0c0fe6bd750843a1751278f63982e2004e6a27d47fa1c509cc2","source":{"kind":"arxiv","id":"2110.15944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.15944","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"2110.15944v1","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.15944","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"EXOB7CDI3LYM","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"pith_short_16","alias_value":"EXOB7CDI3LYMB7TL","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"pith_short_8","alias_value":"EXOB7CDI","created_at":"2026-07-05T03:27:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:EXOB7CDI3LYMB7TL25IIIOQXKE","target":"record","payload":{"canonical_record":{"source":{"id":"2110.15944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-29T17:48:05Z","cross_cats_sorted":[],"title_canon_sha256":"7a7089244e82288deafcbb4fcd598e78c8d11401c7d2679c00e6cce4c7dd51ca","abstract_canon_sha256":"7bddfdf4de38741b947541dd5b2294b23e46688966cb095e988a8023ca8d8be0"},"schema_version":"1.0"},"canonical_sha256":"25dc1f8868daf0c0fe6bd750843a1751278f63982e2004e6a27d47fa1c509cc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:15.948021Z","signature_b64":"/1WSN9/e4XCkG1WotShBE8v093MPg/hIj6vCSWZrQBR9Fav5U+yDF/fh7Bava6o/+CBVlv5+reygPTNJSEPfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25dc1f8868daf0c0fe6bd750843a1751278f63982e2004e6a27d47fa1c509cc2","last_reissued_at":"2026-07-05T03:27:15.947556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:15.947556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.15944","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-05T03:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/cZEx3oD37HYm5MNqr1C2/IKttEy0wXfO6W5+PKlDpdDAI6fxMUqOGjyLFtawqU4QcCtG82hIBNQmTma2p2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:54:58.458490Z"},"content_sha256":"fbf1fa462f07730135f85969c0b3d40f69f5b48284f8bca56e63cba1c424c567","schema_version":"1.0","event_id":"sha256:fbf1fa462f07730135f85969c0b3d40f69f5b48284f8bca56e63cba1c424c567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:EXOB7CDI3LYMB7TL25IIIOQXKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Goran Zuzic, Gramoz Goranci, Mingquan Ye, Xiaorui Sun","submitted_at":"2021-10-29T17:48:05Z","abstract_excerpt":"We provide universally-optimal distributed graph algorithms for $(1+\\varepsilon)$-approximate shortest path problems including shortest-path-tree and transshipment.\n  The universal optimality of our algorithms guarantees that, on any $n$-node network $G$, our algorithm completes in $T \\cdot n^{o(1)}$ rounds whenever a $T$-round algorithm exists for $G$. This includes $D \\cdot n^{o(1)}$-round algorithms for any planar or excluded-minor network. Our algorithms never require more than $(\\sqrt{n} + D) \\cdot n^{o(1)}$ rounds, resulting in the first sub-linear-round distributed algorithm for transsh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.15944","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/2110.15944/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-05T03:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlEELQDHSRT1lZ6EjOyr3FBvwqlmbTEoNn+iV36YFsc1BCJQwlFm9PauwUDFtSs7T93HJuwah12rakTA4cOABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:54:58.458866Z"},"content_sha256":"4c0f548dcfa0afb686392364b85402c20fe00946c678bd07fab602d7b86b8c2a","schema_version":"1.0","event_id":"sha256:4c0f548dcfa0afb686392364b85402c20fe00946c678bd07fab602d7b86b8c2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXOB7CDI3LYMB7TL25IIIOQXKE/bundle.json","state_url":"https://pith.science/pith/EXOB7CDI3LYMB7TL25IIIOQXKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXOB7CDI3LYMB7TL25IIIOQXKE/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-07-08T16:54:58Z","links":{"resolver":"https://pith.science/pith/EXOB7CDI3LYMB7TL25IIIOQXKE","bundle":"https://pith.science/pith/EXOB7CDI3LYMB7TL25IIIOQXKE/bundle.json","state":"https://pith.science/pith/EXOB7CDI3LYMB7TL25IIIOQXKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXOB7CDI3LYMB7TL25IIIOQXKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EXOB7CDI3LYMB7TL25IIIOQXKE","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":"7bddfdf4de38741b947541dd5b2294b23e46688966cb095e988a8023ca8d8be0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-29T17:48:05Z","title_canon_sha256":"7a7089244e82288deafcbb4fcd598e78c8d11401c7d2679c00e6cce4c7dd51ca"},"schema_version":"1.0","source":{"id":"2110.15944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.15944","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"2110.15944v1","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.15944","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"EXOB7CDI3LYM","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"pith_short_16","alias_value":"EXOB7CDI3LYMB7TL","created_at":"2026-07-05T03:27:15Z"},{"alias_kind":"pith_short_8","alias_value":"EXOB7CDI","created_at":"2026-07-05T03:27:15Z"}],"graph_snapshots":[{"event_id":"sha256:4c0f548dcfa0afb686392364b85402c20fe00946c678bd07fab602d7b86b8c2a","target":"graph","created_at":"2026-07-05T03:27: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/2110.15944/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide universally-optimal distributed graph algorithms for $(1+\\varepsilon)$-approximate shortest path problems including shortest-path-tree and transshipment.\n  The universal optimality of our algorithms guarantees that, on any $n$-node network $G$, our algorithm completes in $T \\cdot n^{o(1)}$ rounds whenever a $T$-round algorithm exists for $G$. This includes $D \\cdot n^{o(1)}$-round algorithms for any planar or excluded-minor network. Our algorithms never require more than $(\\sqrt{n} + D) \\cdot n^{o(1)}$ rounds, resulting in the first sub-linear-round distributed algorithm for transsh","authors_text":"Bernhard Haeupler, Goran Zuzic, Gramoz Goranci, Mingquan Ye, Xiaorui Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-29T17:48:05Z","title":"Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.15944","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:fbf1fa462f07730135f85969c0b3d40f69f5b48284f8bca56e63cba1c424c567","target":"record","created_at":"2026-07-05T03:27: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":"7bddfdf4de38741b947541dd5b2294b23e46688966cb095e988a8023ca8d8be0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-29T17:48:05Z","title_canon_sha256":"7a7089244e82288deafcbb4fcd598e78c8d11401c7d2679c00e6cce4c7dd51ca"},"schema_version":"1.0","source":{"id":"2110.15944","kind":"arxiv","version":1}},"canonical_sha256":"25dc1f8868daf0c0fe6bd750843a1751278f63982e2004e6a27d47fa1c509cc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25dc1f8868daf0c0fe6bd750843a1751278f63982e2004e6a27d47fa1c509cc2","first_computed_at":"2026-07-05T03:27:15.947556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:27:15.947556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/1WSN9/e4XCkG1WotShBE8v093MPg/hIj6vCSWZrQBR9Fav5U+yDF/fh7Bava6o/+CBVlv5+reygPTNJSEPfAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:27:15.948021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.15944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbf1fa462f07730135f85969c0b3d40f69f5b48284f8bca56e63cba1c424c567","sha256:4c0f548dcfa0afb686392364b85402c20fe00946c678bd07fab602d7b86b8c2a"],"state_sha256":"87dc18d15cc7961cd160f45ca2ea52f01c43ddd2d107f84f445927fbf51413bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uu+Whkkq4SS37/3gpXMRYwOqiSvwNGFFJkgGYsYv2Y8Ev1dy4AkYpd6rynjysyBKJEUCO4rCcwXnlwPXMlmTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T16:54:58.460786Z","bundle_sha256":"a4c75d771a029f53d37b841b724caaf456a2fc04e029585383671a39b649a05f"}}