{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EZ7MJQ3RRLCQUD2DBCYT2L6WRC","short_pith_number":"pith:EZ7MJQ3R","schema_version":"1.0","canonical_sha256":"267ec4c3718ac50a0f4308b13d2fd688b521930cd8c7b1479590c2daa7d9c7a6","source":{"kind":"arxiv","id":"1511.05362","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Random Kaczmarz Algorithm Based on Clustering Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Haishan Ye, Kaichun Mo, Yujun Li","submitted_at":"2015-11-17T11:58:24Z","abstract_excerpt":"Kaczmarz algorithm is an efficient iterative algorithm to solve overdetermined consistent system of linear equations. During each updating step, Kaczmarz chooses a hyperplane based on an individual equation and projects the current estimate for the exact solution onto that space to get a new estimate. Many vairants of Kaczmarz algorithms are proposed on how to choose better hyperplanes. Using the property of randomly sampled data in high-dimensional space, we propose an accelerated algorithm based on clustering information to improve block Kaczmarz and Kaczmarz via Johnson-Lindenstrauss lemma."},"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":"1511.05362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-11-17T11:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"63e49a908af774cc99d36135a3c6818183eda8906ae53024494f002b1101fac0","abstract_canon_sha256":"21d81342646408d44a23986f1e5e932470c50b1caa3cb4fcc4b578e3c18e4f51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:30.957398Z","signature_b64":"zhvFmBq6/0un8qIh9cD2aQK0aD+t3syPehqPoJ1qkpI/mnhYnHQ+zUDgyT18Gj6uW05A/HGzMA8P/phd63EIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"267ec4c3718ac50a0f4308b13d2fd688b521930cd8c7b1479590c2daa7d9c7a6","last_reissued_at":"2026-05-18T01:26:30.956723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:30.956723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Random Kaczmarz Algorithm Based on Clustering Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Haishan Ye, Kaichun Mo, Yujun Li","submitted_at":"2015-11-17T11:58:24Z","abstract_excerpt":"Kaczmarz algorithm is an efficient iterative algorithm to solve overdetermined consistent system of linear equations. During each updating step, Kaczmarz chooses a hyperplane based on an individual equation and projects the current estimate for the exact solution onto that space to get a new estimate. Many vairants of Kaczmarz algorithms are proposed on how to choose better hyperplanes. Using the property of randomly sampled data in high-dimensional space, we propose an accelerated algorithm based on clustering information to improve block Kaczmarz and Kaczmarz via Johnson-Lindenstrauss lemma."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05362","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":"1511.05362","created_at":"2026-05-18T01:26:30.956834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05362v2","created_at":"2026-05-18T01:26:30.956834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05362","created_at":"2026-05-18T01:26:30.956834+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZ7MJQ3RRLCQ","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZ7MJQ3RRLCQUD2D","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZ7MJQ3R","created_at":"2026-05-18T12:29:19.899920+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/EZ7MJQ3RRLCQUD2DBCYT2L6WRC","json":"https://pith.science/pith/EZ7MJQ3RRLCQUD2DBCYT2L6WRC.json","graph_json":"https://pith.science/api/pith-number/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/graph.json","events_json":"https://pith.science/api/pith-number/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/events.json","paper":"https://pith.science/paper/EZ7MJQ3R"},"agent_actions":{"view_html":"https://pith.science/pith/EZ7MJQ3RRLCQUD2DBCYT2L6WRC","download_json":"https://pith.science/pith/EZ7MJQ3RRLCQUD2DBCYT2L6WRC.json","view_paper":"https://pith.science/paper/EZ7MJQ3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05362&json=true","fetch_graph":"https://pith.science/api/pith-number/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/graph.json","fetch_events":"https://pith.science/api/pith-number/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/action/storage_attestation","attest_author":"https://pith.science/pith/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/action/author_attestation","sign_citation":"https://pith.science/pith/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/action/citation_signature","submit_replication":"https://pith.science/pith/EZ7MJQ3RRLCQUD2DBCYT2L6WRC/action/replication_record"}},"created_at":"2026-05-18T01:26:30.956834+00:00","updated_at":"2026-05-18T01:26:30.956834+00:00"}