{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QQEI464ZWK7MWJXSN47CNTLNSX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96fd09a4d6d1860cc73bdb393e31792d8b1857de15b7f4995665d2e2abd840cf","cross_cats_sorted":["cs.DS","cs.LG","cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-04-17T14:00:57Z","title_canon_sha256":"f1409633cca170c8478e9b18a5f533ee865e53d2ef6777d22a2ff12a86c0f296"},"schema_version":"1.0","source":{"id":"2604.16075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.16075","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"arxiv_version","alias_value":"2604.16075v2","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.16075","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_12","alias_value":"QQEI464ZWK7M","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_16","alias_value":"QQEI464ZWK7MWJXS","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_8","alias_value":"QQEI464Z","created_at":"2026-05-26T01:02:34Z"}],"graph_snapshots":[{"event_id":"sha256:3fda79b2c02c77be9f9a49a6470ec1d17a1db439e8e349e38516e46a31ffbc5a","target":"graph","created_at":"2026-05-26T01:02:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"the classical and simple Richardson iteration incurs at most 1/k (relative) backward error after k iterations on any positive semidefinite (PSD) linear system, irrespective of its condition number"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The matrix must be positive semidefinite for the 1/k backward error guarantee to hold unconditionally; the extension to general matrices relies on normal equations and is only observed empirically."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Richardson iteration achieves universal 1/k backward error on PSD systems, enabling O(n²/ε) solvers; MINBERR reaches O(1/k²) rate and O(n²/√ε) complexity, with empirical O(1/k) extension to general systems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Richardson iteration achieves at most 1/k relative backward error after k steps on any positive semidefinite linear system, independent of condition number."}],"snapshot_sha256":"296c97727af9d370131e898df2a6e0c137dc908f1ce359b9eb2930fdadf6a131"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.16075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quest for an algorithm that solves an $n\\times n$ linear system in $O(n^2)$ time complexity, or $O(n^2 \\text{poly}(1/\\epsilon))$ when solving up to $\\epsilon$ relative error, is a long-standing open problem in numerical linear algebra and theoretical computer science. There are two predominant paradigms for measuring relative error: forward error (i.e., distance from the output to the optimum solution) and backward error (i.e., distance to the nearest problem solved by the output). In most prior studies, convergence of iterative linear system solvers is measured via various notions of forw","authors_text":"Elizaveta Rebrova, Micha{\\l} Derezi\\'nski, Yuji Nakatsukasa","cross_cats":["cs.DS","cs.LG","cs.NA","math.OC"],"headline":"Richardson iteration achieves at most 1/k relative backward error after k steps on any positive semidefinite linear system, independent of condition number.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-04-17T14:00:57Z","title":"Towards Universal Convergence of Backward Error in Linear System Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.16075","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T08:06:33.910136Z","id":"77ba5a25-dfa2-4daf-9dbc-fc08b96efe1a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Richardson iteration achieves universal 1/k backward error on PSD systems, enabling O(n²/ε) solvers; MINBERR reaches O(1/k²) rate and O(n²/√ε) complexity, with empirical O(1/k) extension to general systems.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Richardson iteration achieves at most 1/k relative backward error after k steps on any positive semidefinite linear system, independent of condition number.","strongest_claim":"the classical and simple Richardson iteration incurs at most 1/k (relative) backward error after k iterations on any positive semidefinite (PSD) linear system, irrespective of its condition number","weakest_assumption":"The matrix must be positive semidefinite for the 1/k backward error guarantee to hold unconditionally; the extension to general matrices relies on normal equations and is only observed empirically."}},"verdict_id":"77ba5a25-dfa2-4daf-9dbc-fc08b96efe1a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6b70cdef10a9735f5804b6dc27ee889084bc3a3fe9e410a2614dd65d4859188b","target":"record","created_at":"2026-05-26T01:02:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"96fd09a4d6d1860cc73bdb393e31792d8b1857de15b7f4995665d2e2abd840cf","cross_cats_sorted":["cs.DS","cs.LG","cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-04-17T14:00:57Z","title_canon_sha256":"f1409633cca170c8478e9b18a5f533ee865e53d2ef6777d22a2ff12a86c0f296"},"schema_version":"1.0","source":{"id":"2604.16075","kind":"arxiv","version":2}},"canonical_sha256":"84088e7b99b2becb26f26f3e26cd6d95dc1d3c7f143a8d2fb60b57387cea6b52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84088e7b99b2becb26f26f3e26cd6d95dc1d3c7f143a8d2fb60b57387cea6b52","first_computed_at":"2026-05-26T01:02:34.186019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:02:34.186019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0i0bMmkwnNPKS3daRhJFd/OZSETAWc1X8aRoz9SDlzbyBByYl2kCh/WwNdErM74/Bp7SpZFZ6Kmy3MYicZrVDw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:02:34.187009Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.16075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b70cdef10a9735f5804b6dc27ee889084bc3a3fe9e410a2614dd65d4859188b","sha256:3fda79b2c02c77be9f9a49a6470ec1d17a1db439e8e349e38516e46a31ffbc5a"],"state_sha256":"46fbc808890c52a092dfcdf1d57251e95a0b1653b2bc462051b5a3b78d5840d6"}