{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UB7DSL5MWA5MAZQFKQZ7IVMC4M","short_pith_number":"pith:UB7DSL5M","schema_version":"1.0","canonical_sha256":"a07e392facb03ac066055433f45582e315128dedc8f2fbd9677eb7e0f3fd27ba","source":{"kind":"arxiv","id":"1404.3327","version":1},"attestation_state":"computed","paper":{"title":"Supremum-Norm Convergence for Step-Asynchronous Successive Overrelaxation on M-matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Sebastiano Vigna","submitted_at":"2014-04-12T23:25:52Z","abstract_excerpt":"Step-asynchronous successive overrelaxation updates the values contained in a single vector using the usual Gau\\ss-Seidel-like weighted rule, but arbitrarily mixing old and new values, the only constraint being temporal coherence: you cannot use a value before it has been computed. We show that given a nonnegative real matrix $A$, a $\\sigma\\geq\\rho(A)$ and a vector $\\boldsymbol w>0$ such that $A\\boldsymbol w\\leq\\sigma\\boldsymbol w$, every iteration of step-asynchronous successive overrelaxation for the problem $(sI- A)\\boldsymbol x=\\boldsymbol b$, with $s >\\sigma$, reduces geometrically the $\\"},"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":"1404.3327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-12T23:25:52Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"44558ec351c701b42613a68306e8be86aa7541e48bfa6fcefac1f76d32ab9a65","abstract_canon_sha256":"d895646fd766af77308a404541512634f6b3fa05d88b2d31b1f551a48d71ce02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:15.382047Z","signature_b64":"aGE7YBkuC1d/eTJTj56A8dFD4q5W/lW9wPxyHNx3tEJ3LkbE+IQ4kOvC8120ZG26haG2yNNOvz+Rg5t2LWj5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a07e392facb03ac066055433f45582e315128dedc8f2fbd9677eb7e0f3fd27ba","last_reissued_at":"2026-05-18T02:54:15.381573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:15.381573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supremum-Norm Convergence for Step-Asynchronous Successive Overrelaxation on M-matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Sebastiano Vigna","submitted_at":"2014-04-12T23:25:52Z","abstract_excerpt":"Step-asynchronous successive overrelaxation updates the values contained in a single vector using the usual Gau\\ss-Seidel-like weighted rule, but arbitrarily mixing old and new values, the only constraint being temporal coherence: you cannot use a value before it has been computed. We show that given a nonnegative real matrix $A$, a $\\sigma\\geq\\rho(A)$ and a vector $\\boldsymbol w>0$ such that $A\\boldsymbol w\\leq\\sigma\\boldsymbol w$, every iteration of step-asynchronous successive overrelaxation for the problem $(sI- A)\\boldsymbol x=\\boldsymbol b$, with $s >\\sigma$, reduces geometrically the $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3327","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":"1404.3327","created_at":"2026-05-18T02:54:15.381649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3327v1","created_at":"2026-05-18T02:54:15.381649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3327","created_at":"2026-05-18T02:54:15.381649+00:00"},{"alias_kind":"pith_short_12","alias_value":"UB7DSL5MWA5M","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UB7DSL5MWA5MAZQF","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UB7DSL5M","created_at":"2026-05-18T12:28:52.271510+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/UB7DSL5MWA5MAZQFKQZ7IVMC4M","json":"https://pith.science/pith/UB7DSL5MWA5MAZQFKQZ7IVMC4M.json","graph_json":"https://pith.science/api/pith-number/UB7DSL5MWA5MAZQFKQZ7IVMC4M/graph.json","events_json":"https://pith.science/api/pith-number/UB7DSL5MWA5MAZQFKQZ7IVMC4M/events.json","paper":"https://pith.science/paper/UB7DSL5M"},"agent_actions":{"view_html":"https://pith.science/pith/UB7DSL5MWA5MAZQFKQZ7IVMC4M","download_json":"https://pith.science/pith/UB7DSL5MWA5MAZQFKQZ7IVMC4M.json","view_paper":"https://pith.science/paper/UB7DSL5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3327&json=true","fetch_graph":"https://pith.science/api/pith-number/UB7DSL5MWA5MAZQFKQZ7IVMC4M/graph.json","fetch_events":"https://pith.science/api/pith-number/UB7DSL5MWA5MAZQFKQZ7IVMC4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UB7DSL5MWA5MAZQFKQZ7IVMC4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UB7DSL5MWA5MAZQFKQZ7IVMC4M/action/storage_attestation","attest_author":"https://pith.science/pith/UB7DSL5MWA5MAZQFKQZ7IVMC4M/action/author_attestation","sign_citation":"https://pith.science/pith/UB7DSL5MWA5MAZQFKQZ7IVMC4M/action/citation_signature","submit_replication":"https://pith.science/pith/UB7DSL5MWA5MAZQFKQZ7IVMC4M/action/replication_record"}},"created_at":"2026-05-18T02:54:15.381649+00:00","updated_at":"2026-05-18T02:54:15.381649+00:00"}