{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZLEMQRQQC2BSKGMUM73AE3J3TQ","short_pith_number":"pith:ZLEMQRQQ","schema_version":"1.0","canonical_sha256":"cac8c84610168325199467f6026d3b9c3941c94876b0d127037d40e28b763ab8","source":{"kind":"arxiv","id":"1802.03126","version":2},"attestation_state":"computed","paper":{"title":"On Motzkin's Method for Inconsistent Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Deanna Needell, Jamie Haddock","submitted_at":"2018-02-09T04:37:22Z","abstract_excerpt":"Iterative linear solvers have gained recent popularity due to their computational efficiency and low memory footprint for large-scale linear systems. The relaxation method, or Motzkin's method, can be viewed as an iterative method that projects the current estimation onto the solution hyperplane corresponding to the most violated constraint. Although this leads to an optimal selection strategy for consistent systems, for inconsistent least square problems, the strategy presents a tradeoff between convergence rate and solution accuracy. We provide a theoretical analysis that shows Motzkin's met"},"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":"1802.03126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-02-09T04:37:22Z","cross_cats_sorted":[],"title_canon_sha256":"f67f7992967aaf5381a4e49becea509ad207e3415cf2cf5bd84c884932fdbd3a","abstract_canon_sha256":"81587d4c46a9a58ce149044f574a327caffc18244fc8faca1e23a5ca0e255f1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:12.965723Z","signature_b64":"r9WCGJgkxzaYFJOhRYd46/uO0iM8YAEFKHQCAqmJWxRwUBEX7IxGGaPuC6r56RulQ7XINJww2B0B6UFOtyoVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac8c84610168325199467f6026d3b9c3941c94876b0d127037d40e28b763ab8","last_reissued_at":"2026-05-18T00:02:12.965079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:12.965079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Motzkin's Method for Inconsistent Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Deanna Needell, Jamie Haddock","submitted_at":"2018-02-09T04:37:22Z","abstract_excerpt":"Iterative linear solvers have gained recent popularity due to their computational efficiency and low memory footprint for large-scale linear systems. The relaxation method, or Motzkin's method, can be viewed as an iterative method that projects the current estimation onto the solution hyperplane corresponding to the most violated constraint. Although this leads to an optimal selection strategy for consistent systems, for inconsistent least square problems, the strategy presents a tradeoff between convergence rate and solution accuracy. We provide a theoretical analysis that shows Motzkin's met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03126","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":"1802.03126","created_at":"2026-05-18T00:02:12.965180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03126v2","created_at":"2026-05-18T00:02:12.965180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03126","created_at":"2026-05-18T00:02:12.965180+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLEMQRQQC2BS","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLEMQRQQC2BSKGMU","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLEMQRQQ","created_at":"2026-05-18T12:33:07.085635+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/ZLEMQRQQC2BSKGMUM73AE3J3TQ","json":"https://pith.science/pith/ZLEMQRQQC2BSKGMUM73AE3J3TQ.json","graph_json":"https://pith.science/api/pith-number/ZLEMQRQQC2BSKGMUM73AE3J3TQ/graph.json","events_json":"https://pith.science/api/pith-number/ZLEMQRQQC2BSKGMUM73AE3J3TQ/events.json","paper":"https://pith.science/paper/ZLEMQRQQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZLEMQRQQC2BSKGMUM73AE3J3TQ","download_json":"https://pith.science/pith/ZLEMQRQQC2BSKGMUM73AE3J3TQ.json","view_paper":"https://pith.science/paper/ZLEMQRQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03126&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLEMQRQQC2BSKGMUM73AE3J3TQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLEMQRQQC2BSKGMUM73AE3J3TQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLEMQRQQC2BSKGMUM73AE3J3TQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLEMQRQQC2BSKGMUM73AE3J3TQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZLEMQRQQC2BSKGMUM73AE3J3TQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZLEMQRQQC2BSKGMUM73AE3J3TQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZLEMQRQQC2BSKGMUM73AE3J3TQ/action/replication_record"}},"created_at":"2026-05-18T00:02:12.965180+00:00","updated_at":"2026-05-18T00:02:12.965180+00:00"}