{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JZVTLRXC4NFV2BLHC2SVWIMZRR","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":"19d7d1b0436f4636c439839be20547499e8bd81915052c2e41af155e74f299a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-26T22:33:44Z","title_canon_sha256":"3364765463b3881e582e3744e098f4d2b2e26110453075a71b0be586625d2673"},"schema_version":"1.0","source":{"id":"1811.10722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10722","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10722v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10722","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"JZVTLRXC4NFV","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JZVTLRXC4NFV2BLH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JZVTLRXC","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:d403c4f512e421eb340c579de34743346aeb391f3e7e46af4329188f03547f67","target":"graph","created_at":"2026-05-17T23:59:47Z","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":"We show how to solve directed Laplacian systems in nearly-linear time. Given a linear system in an $n \\times n$ Eulerian directed Laplacian with $m$ nonzero entries, we show how to compute an $\\epsilon$-approximate solution in time $O(m \\log^{O(1)} (n) \\log (1/\\epsilon))$. Through reductions from [Cohen et al. FOCS'16] , this gives the first nearly-linear time algorithms for computing $\\epsilon$-approximate solutions to row or column diagonally dominant linear systems (including arbitrary directed Laplacians) and computing $\\epsilon$-approximations to various properties of random walks on dire","authors_text":"Aaron Sidford, Anup B. Rao, John Peebles, Jonathan Kelner, Michael B. Cohen, Rasmus Kyng, Richard Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-26T22:33:44Z","title":"Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10722","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:af1b4f2999076fe280280e33913e09388da3244082615d79b5716ae0d33f400b","target":"record","created_at":"2026-05-17T23:59:47Z","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":"19d7d1b0436f4636c439839be20547499e8bd81915052c2e41af155e74f299a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-26T22:33:44Z","title_canon_sha256":"3364765463b3881e582e3744e098f4d2b2e26110453075a71b0be586625d2673"},"schema_version":"1.0","source":{"id":"1811.10722","kind":"arxiv","version":1}},"canonical_sha256":"4e6b35c6e2e34b5d056716a55b21998c63d3f40b3ff99e0ac2a75c755c6b10c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e6b35c6e2e34b5d056716a55b21998c63d3f40b3ff99e0ac2a75c755c6b10c1","first_computed_at":"2026-05-17T23:59:47.732816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:47.732816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w0AbnNKXqmlpaAhojj0EyL/7+jkD9XL4hQEk7+rQO9WIWy9Bro3eU/knICBxz2duLjhZtPm8hRYIXSceE1MXCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:47.733358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af1b4f2999076fe280280e33913e09388da3244082615d79b5716ae0d33f400b","sha256:d403c4f512e421eb340c579de34743346aeb391f3e7e46af4329188f03547f67"],"state_sha256":"841f0d54acda3976fc71bbaa7d7ed9e5dd33c73719fd63df33fb1672fad9e8ac"}