{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AJLHKJAZ6MWFIO3U35UZHBWAN2","short_pith_number":"pith:AJLHKJAZ","schema_version":"1.0","canonical_sha256":"0256752419f32c543b74df699386c06ea80e5818fd4be1fafa88a61b0483419c","source":{"kind":"arxiv","id":"2304.10123","version":1},"attestation_state":"computed","paper":{"title":"Linear Convergence of Reshuffling Kaczmarz Methods With Sparse Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"Deanna Needell, Halyun Jeong","submitted_at":"2023-04-20T07:14:24Z","abstract_excerpt":"The Kaczmarz method (KZ) and its variants, which are types of stochastic gradient descent (SGD) methods, have been extensively studied due to their simplicity and efficiency in solving linear equation systems. The iterative thresholding (IHT) method has gained popularity in various research fields, including compressed sensing or sparse linear regression, machine learning with additional structure, and optimization with nonconvex constraints. Recently, a hybrid method called Kaczmarz-based IHT (KZIHT) has been proposed, combining the benefits of both approaches, but its theoretical guarantees "},"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":"2304.10123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-04-20T07:14:24Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"8ee88531a0cbfe470cb853813f37769daafddebc10fea1b3044459def02964a5","abstract_canon_sha256":"82782493fb313a22869df8a97aaf1835506162e15bf06666103f53476c3c2476"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:54.346086Z","signature_b64":"2w74OT0u8/wbMCH4BFkhGiPgk10TIKYUTBcIg4qvj5Ii3/84UzHnZ6pWHRye8fL3jklS0J+SW1zl3CiXte9JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0256752419f32c543b74df699386c06ea80e5818fd4be1fafa88a61b0483419c","last_reissued_at":"2026-07-05T06:02:54.345719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:54.345719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Convergence of Reshuffling Kaczmarz Methods With Sparse Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"Deanna Needell, Halyun Jeong","submitted_at":"2023-04-20T07:14:24Z","abstract_excerpt":"The Kaczmarz method (KZ) and its variants, which are types of stochastic gradient descent (SGD) methods, have been extensively studied due to their simplicity and efficiency in solving linear equation systems. The iterative thresholding (IHT) method has gained popularity in various research fields, including compressed sensing or sparse linear regression, machine learning with additional structure, and optimization with nonconvex constraints. Recently, a hybrid method called Kaczmarz-based IHT (KZIHT) has been proposed, combining the benefits of both approaches, but its theoretical guarantees "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.10123","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.10123/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":"2304.10123","created_at":"2026-07-05T06:02:54.345784+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.10123v1","created_at":"2026-07-05T06:02:54.345784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.10123","created_at":"2026-07-05T06:02:54.345784+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJLHKJAZ6MWF","created_at":"2026-07-05T06:02:54.345784+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJLHKJAZ6MWFIO3U","created_at":"2026-07-05T06:02:54.345784+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJLHKJAZ","created_at":"2026-07-05T06:02:54.345784+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10261","citing_title":"Enhanced randomized Douglas-Rachford method: Improved probabilities and adaptive momentum","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2","json":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2.json","graph_json":"https://pith.science/api/pith-number/AJLHKJAZ6MWFIO3U35UZHBWAN2/graph.json","events_json":"https://pith.science/api/pith-number/AJLHKJAZ6MWFIO3U35UZHBWAN2/events.json","paper":"https://pith.science/paper/AJLHKJAZ"},"agent_actions":{"view_html":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2","download_json":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2.json","view_paper":"https://pith.science/paper/AJLHKJAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.10123&json=true","fetch_graph":"https://pith.science/api/pith-number/AJLHKJAZ6MWFIO3U35UZHBWAN2/graph.json","fetch_events":"https://pith.science/api/pith-number/AJLHKJAZ6MWFIO3U35UZHBWAN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2/action/storage_attestation","attest_author":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2/action/author_attestation","sign_citation":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2/action/citation_signature","submit_replication":"https://pith.science/pith/AJLHKJAZ6MWFIO3U35UZHBWAN2/action/replication_record"}},"created_at":"2026-07-05T06:02:54.345784+00:00","updated_at":"2026-07-05T06:02:54.345784+00:00"}