{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JTTHKZEUKPNE5UEDXJWCIQP6QF","short_pith_number":"pith:JTTHKZEU","schema_version":"1.0","canonical_sha256":"4ce675649453da4ed083ba6c2441fe815543c806b0555db1abb62a693185fbe6","source":{"kind":"arxiv","id":"1311.3286","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Parallel Solver for SDD Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NA","authors_text":"Daniel A. Spielman, Richard Peng","submitted_at":"2013-11-13T20:41:01Z","abstract_excerpt":"We present the first parallel algorithm for solving systems of linear equations in symmetric, diagonally dominant (SDD) matrices that runs in polylogarithmic time and nearly-linear work. The heart of our algorithm is a construction of a sparse approximate inverse chain for the input matrix: a sequence of sparse matrices whose product approximates its inverse. Whereas other fast algorithms for solving systems of equations in SDD matrices exploit low-stretch spanning trees, our algorithm only requires spectral graph sparsifiers."},"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":"1311.3286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-11-13T20:41:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ff486eaf2006e1cad6b7e47374d66e9e67b39b2f7ac8cd2eef4f2d94984c66f","abstract_canon_sha256":"951df00018ddc510b23db25606aef3e49fa90395df786e90720a774fa839dd48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:12.504640Z","signature_b64":"HjeNjct+zzu4g15EXEAcyUJDQnEtclPvrRHQyXEfRXZ4at8qomVmmc/PJM+E79YFpigoT8K8O5oaKxeXdfXuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ce675649453da4ed083ba6c2441fe815543c806b0555db1abb62a693185fbe6","last_reissued_at":"2026-05-18T03:07:12.503814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:12.503814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Parallel Solver for SDD Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NA","authors_text":"Daniel A. Spielman, Richard Peng","submitted_at":"2013-11-13T20:41:01Z","abstract_excerpt":"We present the first parallel algorithm for solving systems of linear equations in symmetric, diagonally dominant (SDD) matrices that runs in polylogarithmic time and nearly-linear work. The heart of our algorithm is a construction of a sparse approximate inverse chain for the input matrix: a sequence of sparse matrices whose product approximates its inverse. Whereas other fast algorithms for solving systems of equations in SDD matrices exploit low-stretch spanning trees, our algorithm only requires spectral graph sparsifiers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3286","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":"1311.3286","created_at":"2026-05-18T03:07:12.503954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3286v1","created_at":"2026-05-18T03:07:12.503954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3286","created_at":"2026-05-18T03:07:12.503954+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTTHKZEUKPNE","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTTHKZEUKPNE5UED","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTTHKZEU","created_at":"2026-05-18T12:27:49.015174+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":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF","json":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF.json","graph_json":"https://pith.science/api/pith-number/JTTHKZEUKPNE5UEDXJWCIQP6QF/graph.json","events_json":"https://pith.science/api/pith-number/JTTHKZEUKPNE5UEDXJWCIQP6QF/events.json","paper":"https://pith.science/paper/JTTHKZEU"},"agent_actions":{"view_html":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF","download_json":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF.json","view_paper":"https://pith.science/paper/JTTHKZEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3286&json=true","fetch_graph":"https://pith.science/api/pith-number/JTTHKZEUKPNE5UEDXJWCIQP6QF/graph.json","fetch_events":"https://pith.science/api/pith-number/JTTHKZEUKPNE5UEDXJWCIQP6QF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/action/storage_attestation","attest_author":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/action/author_attestation","sign_citation":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/action/citation_signature","submit_replication":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/action/replication_record"}},"created_at":"2026-05-18T03:07:12.503954+00:00","updated_at":"2026-05-18T03:07:12.503954+00:00"}