{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:OWWAPJE5RSLUKQWPIYAGIXBXCY","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":"e555422d6b1ffc200bccfec1adfe9bab2d0ae87c5bba9be322f3b4f4a9f2bbb7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-09-11T01:45:34Z","title_canon_sha256":"c6086493e5e0a379b7b7999e13f5f4466b087a72796ac8c37622da96a1785842"},"schema_version":"1.0","source":{"id":"2109.05151","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.05151","created_at":"2026-07-05T04:24:22Z"},{"alias_kind":"arxiv_version","alias_value":"2109.05151v3","created_at":"2026-07-05T04:24:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.05151","created_at":"2026-07-05T04:24:22Z"},{"alias_kind":"pith_short_12","alias_value":"OWWAPJE5RSLU","created_at":"2026-07-05T04:24:22Z"},{"alias_kind":"pith_short_16","alias_value":"OWWAPJE5RSLUKQWP","created_at":"2026-07-05T04:24:22Z"},{"alias_kind":"pith_short_8","alias_value":"OWWAPJE5","created_at":"2026-07-05T04:24:22Z"}],"graph_snapshots":[{"event_id":"sha256:b889b09ba2b6bdea16585e067f1985ea160a9bb9ea3c3e5b24cd0654e820fcb7","target":"graph","created_at":"2026-07-05T04:24:22Z","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/2109.05151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we refine the (almost) \\emph{existentially optimal} distributed Laplacian solver recently developed by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS `21) into an (almost) \\emph{universally optimal} distributed Laplacian solver.\n  Specifically, when the topology is known, we show that any Laplacian system on an $n$-node graph with \\emph{shortcut quality} $\\text{SQ}(G)$ can be solved within $n^{o(1)} \\text{SQ}(G) \\log(1/\\varepsilon)$ rounds, where $\\varepsilon$ is the required accuracy. This almost matches our lower bound which guarantees that any correct algorithm on $G$ require","authors_text":"Bernhard Haeupler, Christoph Lenzen, Goran Zuzic, Ioannis Anagnostides, Themis Gouleakis","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-09-11T01:45:34Z","title":"Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.05151","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:1ac4e17d994546e18fb7a4469a7166c5ed5c8277e96728a12d023f1df2816e91","target":"record","created_at":"2026-07-05T04:24:22Z","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":"e555422d6b1ffc200bccfec1adfe9bab2d0ae87c5bba9be322f3b4f4a9f2bbb7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-09-11T01:45:34Z","title_canon_sha256":"c6086493e5e0a379b7b7999e13f5f4466b087a72796ac8c37622da96a1785842"},"schema_version":"1.0","source":{"id":"2109.05151","kind":"arxiv","version":3}},"canonical_sha256":"75ac07a49d8c974542cf4600645c37160ea0e9c521dab2d9543f04d493709718","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75ac07a49d8c974542cf4600645c37160ea0e9c521dab2d9543f04d493709718","first_computed_at":"2026-07-05T04:24:22.669340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:24:22.669340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1htYrTsrESX/+TToNbeOxG1wKaShWVOJ2UjL7i3vIYOMEWKUcWIm8SlR6Rkb+NIrxMItvG5nhuhNsyQ6BsPdAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:24:22.669744Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.05151","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ac4e17d994546e18fb7a4469a7166c5ed5c8277e96728a12d023f1df2816e91","sha256:b889b09ba2b6bdea16585e067f1985ea160a9bb9ea3c3e5b24cd0654e820fcb7"],"state_sha256":"fc3e9eeb6affed260b04fe3887a145c079dbaedd059f906e9e3fb9d62584cd9e"}