{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S2NGZ2QRYLNQWKU7MDWD7WJKJR","short_pith_number":"pith:S2NGZ2QR","schema_version":"1.0","canonical_sha256":"969a6cea11c2db0b2a9f60ec3fd92a4c75451b78e9b2aa91c1dcf0cafa4090f7","source":{"kind":"arxiv","id":"1506.08204","version":2},"attestation_state":"computed","paper":{"title":"Sparsified Cholesky Solvers for SDD linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel A. Spielman, Richard Peng, Yin Tat Lee","submitted_at":"2015-06-26T20:00:41Z","abstract_excerpt":"We show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. We show that these matrices have constant-factor approximations of the form $L L^{T}$, where $L$ is a lower-triangular matrix with a number of nonzero entries linear in its dimension. Furthermore linear systems in $L$ and $L^{T}$ can be solved in $O (n)$ work and $O(\\log{n}\\log^2\\log{n})$ depth, where $n$ is the dimension of the matrix.\n  We present nearly linear time algorithms that construct solvers that are almost this efficient. In doing so, we gi"},"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":"1506.08204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T20:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"0fdaff71e52044d4e73eec179d4fa1fbea7e8e1a3fdaeb8b60710f4c66246366","abstract_canon_sha256":"5208d043c0a01150cc0501fbf09f3c96bc86a21b1820577e64b498275e9af672"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:22.090953Z","signature_b64":"1Qv0ayLCe10pIOZhohYDjrbVkbLe9OsxDo1oWSH8btLVOOgkaHEy6ZL4/7UX3IijZMpbbzg00fvqxc/qIzKbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"969a6cea11c2db0b2a9f60ec3fd92a4c75451b78e9b2aa91c1dcf0cafa4090f7","last_reissued_at":"2026-05-18T01:35:22.090126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:22.090126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsified Cholesky Solvers for SDD linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel A. Spielman, Richard Peng, Yin Tat Lee","submitted_at":"2015-06-26T20:00:41Z","abstract_excerpt":"We show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. We show that these matrices have constant-factor approximations of the form $L L^{T}$, where $L$ is a lower-triangular matrix with a number of nonzero entries linear in its dimension. Furthermore linear systems in $L$ and $L^{T}$ can be solved in $O (n)$ work and $O(\\log{n}\\log^2\\log{n})$ depth, where $n$ is the dimension of the matrix.\n  We present nearly linear time algorithms that construct solvers that are almost this efficient. In doing so, we gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08204","kind":"arxiv","version":2},"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":"1506.08204","created_at":"2026-05-18T01:35:22.090270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08204v2","created_at":"2026-05-18T01:35:22.090270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08204","created_at":"2026-05-18T01:35:22.090270+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2NGZ2QRYLNQ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2NGZ2QRYLNQWKU7","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2NGZ2QR","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10340","citing_title":"Flows in Almost Linear Time via Adaptive Preconditioning","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR","json":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR.json","graph_json":"https://pith.science/api/pith-number/S2NGZ2QRYLNQWKU7MDWD7WJKJR/graph.json","events_json":"https://pith.science/api/pith-number/S2NGZ2QRYLNQWKU7MDWD7WJKJR/events.json","paper":"https://pith.science/paper/S2NGZ2QR"},"agent_actions":{"view_html":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR","download_json":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR.json","view_paper":"https://pith.science/paper/S2NGZ2QR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08204&json=true","fetch_graph":"https://pith.science/api/pith-number/S2NGZ2QRYLNQWKU7MDWD7WJKJR/graph.json","fetch_events":"https://pith.science/api/pith-number/S2NGZ2QRYLNQWKU7MDWD7WJKJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/action/storage_attestation","attest_author":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/action/author_attestation","sign_citation":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/action/citation_signature","submit_replication":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/action/replication_record"}},"created_at":"2026-05-18T01:35:22.090270+00:00","updated_at":"2026-05-18T01:35:22.090270+00:00"}