{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XY4NIXOXD4MKKUSACHYPY5ROKZ","short_pith_number":"pith:XY4NIXOX","schema_version":"1.0","canonical_sha256":"be38d45dd71f18a5524011f0fc762e566033ddad431d0b262d573104544de5ef","source":{"kind":"arxiv","id":"1402.2863","version":1},"attestation_state":"computed","paper":{"title":"On the Randomized Kaczmarz Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Kristiaan Pelckmans, Liang Dai, Mojtaba Soltanalian","submitted_at":"2014-02-12T16:01:50Z","abstract_excerpt":"The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question raised by \\cite{c2}. Illustrative experiments are conducted to support the findings."},"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":"1402.2863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-02-12T16:01:50Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"199618e6f325f80561970486a2d3095a586b308b8e7f1ad3864a07502ee4fda7","abstract_canon_sha256":"c80c4799055cba265cfb2e8af6f05523369e1afac4f54667989e0fc456815464"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.665866Z","signature_b64":"1XzlsQ0O0ovVQledbVZM700w9ZpVoXnPytFUA8o/xATUzGTkjYxK53sbYAo0v1Jm8Bf5Q5KLGAjdNdqEgnSfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be38d45dd71f18a5524011f0fc762e566033ddad431d0b262d573104544de5ef","last_reissued_at":"2026-05-18T00:58:41.665080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.665080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Randomized Kaczmarz Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Kristiaan Pelckmans, Liang Dai, Mojtaba Soltanalian","submitted_at":"2014-02-12T16:01:50Z","abstract_excerpt":"The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question raised by \\cite{c2}. Illustrative experiments are conducted to support the findings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2863","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":"1402.2863","created_at":"2026-05-18T00:58:41.665219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2863v1","created_at":"2026-05-18T00:58:41.665219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2863","created_at":"2026-05-18T00:58:41.665219+00:00"},{"alias_kind":"pith_short_12","alias_value":"XY4NIXOXD4MK","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XY4NIXOXD4MKKUSA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XY4NIXOX","created_at":"2026-05-18T12:28:57.508820+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/XY4NIXOXD4MKKUSACHYPY5ROKZ","json":"https://pith.science/pith/XY4NIXOXD4MKKUSACHYPY5ROKZ.json","graph_json":"https://pith.science/api/pith-number/XY4NIXOXD4MKKUSACHYPY5ROKZ/graph.json","events_json":"https://pith.science/api/pith-number/XY4NIXOXD4MKKUSACHYPY5ROKZ/events.json","paper":"https://pith.science/paper/XY4NIXOX"},"agent_actions":{"view_html":"https://pith.science/pith/XY4NIXOXD4MKKUSACHYPY5ROKZ","download_json":"https://pith.science/pith/XY4NIXOXD4MKKUSACHYPY5ROKZ.json","view_paper":"https://pith.science/paper/XY4NIXOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2863&json=true","fetch_graph":"https://pith.science/api/pith-number/XY4NIXOXD4MKKUSACHYPY5ROKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XY4NIXOXD4MKKUSACHYPY5ROKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XY4NIXOXD4MKKUSACHYPY5ROKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XY4NIXOXD4MKKUSACHYPY5ROKZ/action/storage_attestation","attest_author":"https://pith.science/pith/XY4NIXOXD4MKKUSACHYPY5ROKZ/action/author_attestation","sign_citation":"https://pith.science/pith/XY4NIXOXD4MKKUSACHYPY5ROKZ/action/citation_signature","submit_replication":"https://pith.science/pith/XY4NIXOXD4MKKUSACHYPY5ROKZ/action/replication_record"}},"created_at":"2026-05-18T00:58:41.665219+00:00","updated_at":"2026-05-18T00:58:41.665219+00:00"}