{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NKKMSLUZU7IHFXUCXXQAGKEBPI","short_pith_number":"pith:NKKMSLUZ","schema_version":"1.0","canonical_sha256":"6a94c92e99a7d072de82bde00328817a37e4392d1cf11053e4035bac373ea8c2","source":{"kind":"arxiv","id":"2110.04703","version":2},"attestation_state":"computed","paper":{"title":"Selectable Set Randomized Kaczmarz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daji Landis, Deanna Needell, Jacob D. Moorman, Thomas Tu, William Swartworth, Yotam Yaniv","submitted_at":"2021-10-10T04:39:43Z","abstract_excerpt":"The Randomized Kaczmarz method (RK) is a stochastic iterative method for solving linear systems that has recently grown in popularity due to its speed and low memory requirement. Selectable Set Randomized Kaczmarz (SSRK) is an variant of RK that leverages existing information about the Kaczmarz iterate to identify an adaptive \"selectable set\" and thus yields an improved convergence guarantee. In this paper, we propose a general perspective for selectable set approaches and prove a convergence result for that framework. In addition, we define two specific selectable set sampling strategies that"},"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":"2110.04703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2021-10-10T04:39:43Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"986beaf7eb6cf5bc99bc1bb7802eb11a65204db53e95226f75df34c02e2e0681","abstract_canon_sha256":"ae88d3578cba0e9773f85b61959bdb902f968cac4fdbda48d6449a98ac808cc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:53:49.513963Z","signature_b64":"deh3Pm7qLwDEJWUHFSWWftzXP669ExDaMBxJD110hXwg/8dbWJmD98idYk4y+4hLeM+nJ8nVZ+XpbkwCCL5RBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a94c92e99a7d072de82bde00328817a37e4392d1cf11053e4035bac373ea8c2","last_reissued_at":"2026-07-05T03:53:49.513559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:53:49.513559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selectable Set Randomized Kaczmarz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daji Landis, Deanna Needell, Jacob D. Moorman, Thomas Tu, William Swartworth, Yotam Yaniv","submitted_at":"2021-10-10T04:39:43Z","abstract_excerpt":"The Randomized Kaczmarz method (RK) is a stochastic iterative method for solving linear systems that has recently grown in popularity due to its speed and low memory requirement. Selectable Set Randomized Kaczmarz (SSRK) is an variant of RK that leverages existing information about the Kaczmarz iterate to identify an adaptive \"selectable set\" and thus yields an improved convergence guarantee. In this paper, we propose a general perspective for selectable set approaches and prove a convergence result for that framework. In addition, we define two specific selectable set sampling strategies that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04703","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.04703/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.04703","created_at":"2026-07-05T03:53:49.513617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.04703v2","created_at":"2026-07-05T03:53:49.513617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04703","created_at":"2026-07-05T03:53:49.513617+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKKMSLUZU7IH","created_at":"2026-07-05T03:53:49.513617+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKKMSLUZU7IHFXUC","created_at":"2026-07-05T03:53:49.513617+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKKMSLUZ","created_at":"2026-07-05T03:53:49.513617+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/NKKMSLUZU7IHFXUCXXQAGKEBPI","json":"https://pith.science/pith/NKKMSLUZU7IHFXUCXXQAGKEBPI.json","graph_json":"https://pith.science/api/pith-number/NKKMSLUZU7IHFXUCXXQAGKEBPI/graph.json","events_json":"https://pith.science/api/pith-number/NKKMSLUZU7IHFXUCXXQAGKEBPI/events.json","paper":"https://pith.science/paper/NKKMSLUZ"},"agent_actions":{"view_html":"https://pith.science/pith/NKKMSLUZU7IHFXUCXXQAGKEBPI","download_json":"https://pith.science/pith/NKKMSLUZU7IHFXUCXXQAGKEBPI.json","view_paper":"https://pith.science/paper/NKKMSLUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.04703&json=true","fetch_graph":"https://pith.science/api/pith-number/NKKMSLUZU7IHFXUCXXQAGKEBPI/graph.json","fetch_events":"https://pith.science/api/pith-number/NKKMSLUZU7IHFXUCXXQAGKEBPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKKMSLUZU7IHFXUCXXQAGKEBPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKKMSLUZU7IHFXUCXXQAGKEBPI/action/storage_attestation","attest_author":"https://pith.science/pith/NKKMSLUZU7IHFXUCXXQAGKEBPI/action/author_attestation","sign_citation":"https://pith.science/pith/NKKMSLUZU7IHFXUCXXQAGKEBPI/action/citation_signature","submit_replication":"https://pith.science/pith/NKKMSLUZU7IHFXUCXXQAGKEBPI/action/replication_record"}},"created_at":"2026-07-05T03:53:49.513617+00:00","updated_at":"2026-07-05T03:53:49.513617+00:00"}