{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JZVTLRXC4NFV2BLHC2SVWIMZRR","short_pith_number":"pith:JZVTLRXC","schema_version":"1.0","canonical_sha256":"4e6b35c6e2e34b5d056716a55b21998c63d3f40b3ff99e0ac2a75c755c6b10c1","source":{"kind":"arxiv","id":"1811.10722","version":1},"attestation_state":"computed","paper":{"title":"Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Anup B. Rao, John Peebles, Jonathan Kelner, Michael B. Cohen, Rasmus Kyng, Richard Peng","submitted_at":"2018-11-26T22:33:44Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.10722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-26T22:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"3364765463b3881e582e3744e098f4d2b2e26110453075a71b0be586625d2673","abstract_canon_sha256":"19d7d1b0436f4636c439839be20547499e8bd81915052c2e41af155e74f299a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.733358Z","signature_b64":"w0AbnNKXqmlpaAhojj0EyL/7+jkD9XL4hQEk7+rQO9WIWy9Bro3eU/knICBxz2duLjhZtPm8hRYIXSceE1MXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e6b35c6e2e34b5d056716a55b21998c63d3f40b3ff99e0ac2a75c755c6b10c1","last_reissued_at":"2026-05-17T23:59:47.732816Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.732816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Anup B. Rao, John Peebles, Jonathan Kelner, Michael B. Cohen, Rasmus Kyng, Richard Peng","submitted_at":"2018-11-26T22:33:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10722","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.10722","created_at":"2026-05-17T23:59:47.732890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10722v1","created_at":"2026-05-17T23:59:47.732890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10722","created_at":"2026-05-17T23:59:47.732890+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZVTLRXC4NFV","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZVTLRXC4NFV2BLH","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZVTLRXC","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR","json":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR.json","graph_json":"https://pith.science/api/pith-number/JZVTLRXC4NFV2BLHC2SVWIMZRR/graph.json","events_json":"https://pith.science/api/pith-number/JZVTLRXC4NFV2BLHC2SVWIMZRR/events.json","paper":"https://pith.science/paper/JZVTLRXC"},"agent_actions":{"view_html":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR","download_json":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR.json","view_paper":"https://pith.science/paper/JZVTLRXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10722&json=true","fetch_graph":"https://pith.science/api/pith-number/JZVTLRXC4NFV2BLHC2SVWIMZRR/graph.json","fetch_events":"https://pith.science/api/pith-number/JZVTLRXC4NFV2BLHC2SVWIMZRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR/action/storage_attestation","attest_author":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR/action/author_attestation","sign_citation":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR/action/citation_signature","submit_replication":"https://pith.science/pith/JZVTLRXC4NFV2BLHC2SVWIMZRR/action/replication_record"}},"created_at":"2026-05-17T23:59:47.732890+00:00","updated_at":"2026-05-17T23:59:47.732890+00:00"}