{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VQ5PZOOL4JE2ADXHDTJTX6S6H6","short_pith_number":"pith:VQ5PZOOL","schema_version":"1.0","canonical_sha256":"ac3afcb9cbe249a00ee71cd33bfa5e3f8d2faf12c303f44b7be52d4a39f2c5bb","source":{"kind":"arxiv","id":"1810.05251","version":2},"attestation_state":"computed","paper":{"title":"A Linearly Convergent Doubly Stochastic Gauss-Seidel Algorithm for Solving Linear Equations and A Certain Class of Over-Parameterized Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Meisam Razaviyayn, Mingyi Hong, Navid Reyhanian, Zhi-Quan Luo","submitted_at":"2018-10-11T21:17:59Z","abstract_excerpt":"Consider the classical problem of solving a general linear system of equations $Ax=b$. It is well known that the (successively over relaxed) Gauss-Seidel scheme and many of its variants may not converge when $A$ is neither diagonally dominant nor symmetric positive definite. Can we have a linearly convergent G-S type algorithm that works for {\\it any} $A$? In this paper we answer this question affirmatively by proposing a doubly stochastic G-S algorithm that is provably linearly convergent (in the mean square error sense) for any feasible linear system of equations. The key in the algorithm de"},"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":"1810.05251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T21:17:59Z","cross_cats_sorted":[],"title_canon_sha256":"c52f1113651ad80321e2395a46db861d9584614159918486464eb8885aad0ea1","abstract_canon_sha256":"95433071ec9d96f61cdf1cc1c2c3d880de814436642d5700f7fceba8dd62cd73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:29.809776Z","signature_b64":"i9XfDuj9OOxYeytdvNibXxAskocDcaWsU2aJ5HyO5MDUEpjZDhr/QdNuKrlgn+wnv7vY+TnWKAreCfrk8EI/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac3afcb9cbe249a00ee71cd33bfa5e3f8d2faf12c303f44b7be52d4a39f2c5bb","last_reissued_at":"2026-05-17T23:46:29.809222Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:29.809222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linearly Convergent Doubly Stochastic Gauss-Seidel Algorithm for Solving Linear Equations and A Certain Class of Over-Parameterized Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Meisam Razaviyayn, Mingyi Hong, Navid Reyhanian, Zhi-Quan Luo","submitted_at":"2018-10-11T21:17:59Z","abstract_excerpt":"Consider the classical problem of solving a general linear system of equations $Ax=b$. It is well known that the (successively over relaxed) Gauss-Seidel scheme and many of its variants may not converge when $A$ is neither diagonally dominant nor symmetric positive definite. Can we have a linearly convergent G-S type algorithm that works for {\\it any} $A$? In this paper we answer this question affirmatively by proposing a doubly stochastic G-S algorithm that is provably linearly convergent (in the mean square error sense) for any feasible linear system of equations. The key in the algorithm de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05251","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":"1810.05251","created_at":"2026-05-17T23:46:29.809327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05251v2","created_at":"2026-05-17T23:46:29.809327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05251","created_at":"2026-05-17T23:46:29.809327+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQ5PZOOL4JE2","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQ5PZOOL4JE2ADXH","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQ5PZOOL","created_at":"2026-05-18T12:32:59.047623+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/VQ5PZOOL4JE2ADXHDTJTX6S6H6","json":"https://pith.science/pith/VQ5PZOOL4JE2ADXHDTJTX6S6H6.json","graph_json":"https://pith.science/api/pith-number/VQ5PZOOL4JE2ADXHDTJTX6S6H6/graph.json","events_json":"https://pith.science/api/pith-number/VQ5PZOOL4JE2ADXHDTJTX6S6H6/events.json","paper":"https://pith.science/paper/VQ5PZOOL"},"agent_actions":{"view_html":"https://pith.science/pith/VQ5PZOOL4JE2ADXHDTJTX6S6H6","download_json":"https://pith.science/pith/VQ5PZOOL4JE2ADXHDTJTX6S6H6.json","view_paper":"https://pith.science/paper/VQ5PZOOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05251&json=true","fetch_graph":"https://pith.science/api/pith-number/VQ5PZOOL4JE2ADXHDTJTX6S6H6/graph.json","fetch_events":"https://pith.science/api/pith-number/VQ5PZOOL4JE2ADXHDTJTX6S6H6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQ5PZOOL4JE2ADXHDTJTX6S6H6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQ5PZOOL4JE2ADXHDTJTX6S6H6/action/storage_attestation","attest_author":"https://pith.science/pith/VQ5PZOOL4JE2ADXHDTJTX6S6H6/action/author_attestation","sign_citation":"https://pith.science/pith/VQ5PZOOL4JE2ADXHDTJTX6S6H6/action/citation_signature","submit_replication":"https://pith.science/pith/VQ5PZOOL4JE2ADXHDTJTX6S6H6/action/replication_record"}},"created_at":"2026-05-17T23:46:29.809327+00:00","updated_at":"2026-05-17T23:46:29.809327+00:00"}