{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6NVY6FMCWVNBIM2CW26LRWW3ZC","short_pith_number":"pith:6NVY6FMC","schema_version":"1.0","canonical_sha256":"f36b8f1582b55a143342b6bcb8dadbc8b12b33543377a343d68c42e0eb6b026e","source":{"kind":"arxiv","id":"2303.00709","version":2},"attestation_state":"computed","paper":{"title":"Robust and Practical Solution of Laplacian Equations by Approximate Elimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS","cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel A. Spielman, Rasmus Kyng, Yuan Gao","submitted_at":"2023-03-01T18:07:51Z","abstract_excerpt":"We introduce a new algorithm and software for solving linear equations in symmetric diagonally dominant matrices with non-positive off-diagonal entries (SDDM matrices), including Laplacian matrices. We use pre-conditioned conjugate gradient (PCG) to solve the system of linear equations. Our preconditioner is a variant of the Approximate Cholesky factorization of Kyng and Sachdeva (FOCS 2016). Our factorization approach is simple: we eliminate matrix rows/columns one at a time and update the remaining matrix using sampling to approximate the outcome of complete Cholesky factorization. Unlike ea"},"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":"2303.00709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-03-01T18:07:51Z","cross_cats_sorted":["cs.DS","cs.MS","cs.NA"],"title_canon_sha256":"11f15604ba26109b1708dfd8779c40aaae1a51c15cdbf5347563d63a298408e4","abstract_canon_sha256":"1c56c3a750892ccbe2e65ca5acc5c2dbd52ec8384358ea8b1c4dfc533e4c5255"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:41.330480Z","signature_b64":"nuVHAb9QfwUXEqyl45Fn7FIVbzjMWidMyRBo+8KfKASXr7HDfaDhUQpNVL2cd2lrvzAgTdjz1ZTEO+7bni0GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f36b8f1582b55a143342b6bcb8dadbc8b12b33543377a343d68c42e0eb6b026e","last_reissued_at":"2026-07-05T06:20:41.330064Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:41.330064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Practical Solution of Laplacian Equations by Approximate Elimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS","cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel A. Spielman, Rasmus Kyng, Yuan Gao","submitted_at":"2023-03-01T18:07:51Z","abstract_excerpt":"We introduce a new algorithm and software for solving linear equations in symmetric diagonally dominant matrices with non-positive off-diagonal entries (SDDM matrices), including Laplacian matrices. We use pre-conditioned conjugate gradient (PCG) to solve the system of linear equations. Our preconditioner is a variant of the Approximate Cholesky factorization of Kyng and Sachdeva (FOCS 2016). Our factorization approach is simple: we eliminate matrix rows/columns one at a time and update the remaining matrix using sampling to approximate the outcome of complete Cholesky factorization. Unlike ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.00709","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.00709/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.00709","created_at":"2026-07-05T06:20:41.330119+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.00709v2","created_at":"2026-07-05T06:20:41.330119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.00709","created_at":"2026-07-05T06:20:41.330119+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NVY6FMCWVNB","created_at":"2026-07-05T06:20:41.330119+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NVY6FMCWVNBIM2C","created_at":"2026-07-05T06:20:41.330119+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NVY6FMC","created_at":"2026-07-05T06:20:41.330119+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24791","citing_title":"LAMG+: A Robust Lean Algebraic Multigrid Solver for Graph Laplacians","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC","json":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC.json","graph_json":"https://pith.science/api/pith-number/6NVY6FMCWVNBIM2CW26LRWW3ZC/graph.json","events_json":"https://pith.science/api/pith-number/6NVY6FMCWVNBIM2CW26LRWW3ZC/events.json","paper":"https://pith.science/paper/6NVY6FMC"},"agent_actions":{"view_html":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC","download_json":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC.json","view_paper":"https://pith.science/paper/6NVY6FMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.00709&json=true","fetch_graph":"https://pith.science/api/pith-number/6NVY6FMCWVNBIM2CW26LRWW3ZC/graph.json","fetch_events":"https://pith.science/api/pith-number/6NVY6FMCWVNBIM2CW26LRWW3ZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC/action/storage_attestation","attest_author":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC/action/author_attestation","sign_citation":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC/action/citation_signature","submit_replication":"https://pith.science/pith/6NVY6FMCWVNBIM2CW26LRWW3ZC/action/replication_record"}},"created_at":"2026-07-05T06:20:41.330119+00:00","updated_at":"2026-07-05T06:20:41.330119+00:00"}