{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:USCVM22FAI3TLTPZQU6JP7NPQ6","short_pith_number":"pith:USCVM22F","schema_version":"1.0","canonical_sha256":"a485566b45023735cdf9853c97fdaf87a00d941f819b678c70691a4bb2727d4e","source":{"kind":"arxiv","id":"1411.2647","version":4},"attestation_state":"computed","paper":{"title":"Asynchronous Approximation of a Single Component of the Solution to a Linear System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asuman Ozdaglar, Christina Lee Yu, Devavrat Shah","submitted_at":"2014-11-10T22:15:17Z","abstract_excerpt":"We present a distributed asynchronous algorithm for approximating a single component of the solution to a system of linear equations $Ax = b$, where $A$ is a positive definite real matrix, and $b \\in \\mathbb{R}^n$. This is equivalent to solving for $x_i$ in $x = Gx + z$ for some $G$ and $z$ such that the spectral radius of $G$ is less than 1. Our algorithm relies on the Neumann series characterization of the component $x_i$, and is based on residual updates. We analyze our algorithm within the context of a cloud computation model, in which the computation is split into small update tasks perfo"},"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":"1411.2647","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-10T22:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"bc77f8bb1a13ef841dcc62dd70e1c92678add70294dbf25681e5ddc473a68a1d","abstract_canon_sha256":"7947b5f1a50380574e08bc7e50fc7064d1c280ea40f781281e6b620395c89e0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:01.008714Z","signature_b64":"DHusuntuRf09clAmNgQGv/myVOjuLSiXcHC+H3uchfjd/W2oLxSeie/FL/9cT1EEkMFBf6xXUUlw/3XvSOFGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a485566b45023735cdf9853c97fdaf87a00d941f819b678c70691a4bb2727d4e","last_reissued_at":"2026-05-17T23:56:01.008077Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:01.008077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Approximation of a Single Component of the Solution to a Linear System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asuman Ozdaglar, Christina Lee Yu, Devavrat Shah","submitted_at":"2014-11-10T22:15:17Z","abstract_excerpt":"We present a distributed asynchronous algorithm for approximating a single component of the solution to a system of linear equations $Ax = b$, where $A$ is a positive definite real matrix, and $b \\in \\mathbb{R}^n$. This is equivalent to solving for $x_i$ in $x = Gx + z$ for some $G$ and $z$ such that the spectral radius of $G$ is less than 1. Our algorithm relies on the Neumann series characterization of the component $x_i$, and is based on residual updates. We analyze our algorithm within the context of a cloud computation model, in which the computation is split into small update tasks perfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2647","kind":"arxiv","version":4},"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":"1411.2647","created_at":"2026-05-17T23:56:01.008191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2647v4","created_at":"2026-05-17T23:56:01.008191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2647","created_at":"2026-05-17T23:56:01.008191+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/USCVM22FAI3TLTPZQU6JP7NPQ6","json":"https://pith.science/pith/USCVM22FAI3TLTPZQU6JP7NPQ6.json","graph_json":"https://pith.science/api/pith-number/USCVM22FAI3TLTPZQU6JP7NPQ6/graph.json","events_json":"https://pith.science/api/pith-number/USCVM22FAI3TLTPZQU6JP7NPQ6/events.json","paper":"https://pith.science/paper/USCVM22F"},"agent_actions":{"view_html":"https://pith.science/pith/USCVM22FAI3TLTPZQU6JP7NPQ6","download_json":"https://pith.science/pith/USCVM22FAI3TLTPZQU6JP7NPQ6.json","view_paper":"https://pith.science/paper/USCVM22F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2647&json=true","fetch_graph":"https://pith.science/api/pith-number/USCVM22FAI3TLTPZQU6JP7NPQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/USCVM22FAI3TLTPZQU6JP7NPQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USCVM22FAI3TLTPZQU6JP7NPQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USCVM22FAI3TLTPZQU6JP7NPQ6/action/storage_attestation","attest_author":"https://pith.science/pith/USCVM22FAI3TLTPZQU6JP7NPQ6/action/author_attestation","sign_citation":"https://pith.science/pith/USCVM22FAI3TLTPZQU6JP7NPQ6/action/citation_signature","submit_replication":"https://pith.science/pith/USCVM22FAI3TLTPZQU6JP7NPQ6/action/replication_record"}},"created_at":"2026-05-17T23:56:01.008191+00:00","updated_at":"2026-05-17T23:56:01.008191+00:00"}