{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:E2VZQVAJ4XHKO7ABIIPRJRF4OX","short_pith_number":"pith:E2VZQVAJ","schema_version":"1.0","canonical_sha256":"26ab985409e5cea77c01421f14c4bc75c8d898a77f19b59309798a5a674f3dcf","source":{"kind":"arxiv","id":"1502.03158","version":1},"attestation_state":"computed","paper":{"title":"A Fast Distributed Solver for Symmetric Diagonally Dominant Linear Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ali Jadbabaie, Haitham Bou Ammar, Rasul Tutunov","submitted_at":"2015-02-11T00:32:28Z","abstract_excerpt":"In this paper, we propose a fast distributed solver for linear equations given by symmetric diagonally dominant M-Matrices. Our approach is based on a distributed implementation of the parallel solver of Spielman and Peng by considering a specific approximated inverse chain which can be computed efficiently in a distributed fashion. Representing the system of equations by a graph $\\mathbb{G}$, the proposed distributed algorithm is capable of attaining $\\epsilon$-close solutions (for arbitrary $\\epsilon$) in time proportional to $n^{3}$ (number of nodes in $\\mathbb{G}$), ${\\alpha}$ (upper bound"},"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":"1502.03158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T00:32:28Z","cross_cats_sorted":[],"title_canon_sha256":"e2a8732133e1d9b364d7ba5bf6295245b400c2881974c00b4d966212dbe01907","abstract_canon_sha256":"cf1dfaf3138abc472c921a5b45b57a23e310fbe1d5b5597380a258ee6e9527a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:20.368167Z","signature_b64":"Fqwx2Dh4TsPJP3P6ZxfTOuR/kA/gH+BliLGjcsMH+9Cs1728CE1KZjJEu3OUR4wAawqrYOz5SrznKab95fFcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26ab985409e5cea77c01421f14c4bc75c8d898a77f19b59309798a5a674f3dcf","last_reissued_at":"2026-05-18T02:27:20.367435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:20.367435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Distributed Solver for Symmetric Diagonally Dominant Linear Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ali Jadbabaie, Haitham Bou Ammar, Rasul Tutunov","submitted_at":"2015-02-11T00:32:28Z","abstract_excerpt":"In this paper, we propose a fast distributed solver for linear equations given by symmetric diagonally dominant M-Matrices. Our approach is based on a distributed implementation of the parallel solver of Spielman and Peng by considering a specific approximated inverse chain which can be computed efficiently in a distributed fashion. Representing the system of equations by a graph $\\mathbb{G}$, the proposed distributed algorithm is capable of attaining $\\epsilon$-close solutions (for arbitrary $\\epsilon$) in time proportional to $n^{3}$ (number of nodes in $\\mathbb{G}$), ${\\alpha}$ (upper bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03158","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":"1502.03158","created_at":"2026-05-18T02:27:20.367568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03158v1","created_at":"2026-05-18T02:27:20.367568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03158","created_at":"2026-05-18T02:27:20.367568+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2VZQVAJ4XHK","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2VZQVAJ4XHKO7AB","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2VZQVAJ","created_at":"2026-05-18T12:29:17.054201+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/E2VZQVAJ4XHKO7ABIIPRJRF4OX","json":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX.json","graph_json":"https://pith.science/api/pith-number/E2VZQVAJ4XHKO7ABIIPRJRF4OX/graph.json","events_json":"https://pith.science/api/pith-number/E2VZQVAJ4XHKO7ABIIPRJRF4OX/events.json","paper":"https://pith.science/paper/E2VZQVAJ"},"agent_actions":{"view_html":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX","download_json":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX.json","view_paper":"https://pith.science/paper/E2VZQVAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03158&json=true","fetch_graph":"https://pith.science/api/pith-number/E2VZQVAJ4XHKO7ABIIPRJRF4OX/graph.json","fetch_events":"https://pith.science/api/pith-number/E2VZQVAJ4XHKO7ABIIPRJRF4OX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/action/storage_attestation","attest_author":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/action/author_attestation","sign_citation":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/action/citation_signature","submit_replication":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/action/replication_record"}},"created_at":"2026-05-18T02:27:20.367568+00:00","updated_at":"2026-05-18T02:27:20.367568+00:00"}