{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OAT4I42DCUXGF52G5G4OUOJ6A7","short_pith_number":"pith:OAT4I42D","schema_version":"1.0","canonical_sha256":"7027c47343152e62f746e9b8ea393e07d95264ed0e629fb8e1a1f78e54e837d5","source":{"kind":"arxiv","id":"1612.07838","version":1},"attestation_state":"computed","paper":{"title":"Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alim Virani, Behrooz Sepehry, Hoyt Koepke, Issam Laradji, Julie Nutini, Mark Schmidt","submitted_at":"2016-12-22T23:31:35Z","abstract_excerpt":"The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Vershynin [J. Fourier Anal. Appl., 15(2):262-278, 2009] gave a non-asymptotic convergence rate analysis for this algorithm, spurring numerous extensions and generalizations of the Kaczmarz method. Rather than the randomized selection rule analyzed in that work, in this paper we instead discuss greedy and approximate greedy selection rules. We show that in some applications the computational costs of greedy and random s"},"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":"1612.07838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-22T23:31:35Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e40e8f2951d5e14de659658a73da51dd98e08b9c7b0f78219e433c2ac3189e8d","abstract_canon_sha256":"60fd7f41c1c289afc9b69dfc7d241df2bef0d10f05b78c4e7a2446ce30ed2ca1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:05.588934Z","signature_b64":"H7TGteBi6HmZGVohDa0VlxNKQHEGTo7GZA6FvS8omvfy9n/ZwHdbE6hiGM1ogYq2gl7P59B0qL83pdy207d4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7027c47343152e62f746e9b8ea393e07d95264ed0e629fb8e1a1f78e54e837d5","last_reissued_at":"2026-05-18T00:54:05.588481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:05.588481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alim Virani, Behrooz Sepehry, Hoyt Koepke, Issam Laradji, Julie Nutini, Mark Schmidt","submitted_at":"2016-12-22T23:31:35Z","abstract_excerpt":"The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Vershynin [J. Fourier Anal. Appl., 15(2):262-278, 2009] gave a non-asymptotic convergence rate analysis for this algorithm, spurring numerous extensions and generalizations of the Kaczmarz method. Rather than the randomized selection rule analyzed in that work, in this paper we instead discuss greedy and approximate greedy selection rules. We show that in some applications the computational costs of greedy and random s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07838","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":"1612.07838","created_at":"2026-05-18T00:54:05.588554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07838v1","created_at":"2026-05-18T00:54:05.588554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07838","created_at":"2026-05-18T00:54:05.588554+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAT4I42DCUXG","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAT4I42DCUXGF52G","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAT4I42D","created_at":"2026-05-18T12:30:36.002864+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/OAT4I42DCUXGF52G5G4OUOJ6A7","json":"https://pith.science/pith/OAT4I42DCUXGF52G5G4OUOJ6A7.json","graph_json":"https://pith.science/api/pith-number/OAT4I42DCUXGF52G5G4OUOJ6A7/graph.json","events_json":"https://pith.science/api/pith-number/OAT4I42DCUXGF52G5G4OUOJ6A7/events.json","paper":"https://pith.science/paper/OAT4I42D"},"agent_actions":{"view_html":"https://pith.science/pith/OAT4I42DCUXGF52G5G4OUOJ6A7","download_json":"https://pith.science/pith/OAT4I42DCUXGF52G5G4OUOJ6A7.json","view_paper":"https://pith.science/paper/OAT4I42D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07838&json=true","fetch_graph":"https://pith.science/api/pith-number/OAT4I42DCUXGF52G5G4OUOJ6A7/graph.json","fetch_events":"https://pith.science/api/pith-number/OAT4I42DCUXGF52G5G4OUOJ6A7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAT4I42DCUXGF52G5G4OUOJ6A7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAT4I42DCUXGF52G5G4OUOJ6A7/action/storage_attestation","attest_author":"https://pith.science/pith/OAT4I42DCUXGF52G5G4OUOJ6A7/action/author_attestation","sign_citation":"https://pith.science/pith/OAT4I42DCUXGF52G5G4OUOJ6A7/action/citation_signature","submit_replication":"https://pith.science/pith/OAT4I42DCUXGF52G5G4OUOJ6A7/action/replication_record"}},"created_at":"2026-05-18T00:54:05.588554+00:00","updated_at":"2026-05-18T00:54:05.588554+00:00"}