{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AWCXKNFDXBAFRTYIU747A36OQO","short_pith_number":"pith:AWCXKNFD","canonical_record":{"source":{"id":"1305.3803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-16T13:44:42Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"d8820957736568f5f1208e5edfa4eaf0379301f3bfbf8338373eb9188df7fac6","abstract_canon_sha256":"8959f57e44e9eb100b8b4c763be24ce8b543ea8ec905830513415ff391890068"},"schema_version":"1.0"},"canonical_sha256":"05857534a3b84058cf08a7f9f06fce83878a2ea88f290ae09dabc93a64eda4c5","source":{"kind":"arxiv","id":"1305.3803","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3803","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3803v1","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3803","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"AWCXKNFDXBAF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AWCXKNFDXBAFRTYI","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AWCXKNFD","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AWCXKNFDXBAFRTYIU747A36OQO","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-16T13:44:42Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"d8820957736568f5f1208e5edfa4eaf0379301f3bfbf8338373eb9188df7fac6","abstract_canon_sha256":"8959f57e44e9eb100b8b4c763be24ce8b543ea8ec905830513415ff391890068"},"schema_version":"1.0"},"canonical_sha256":"05857534a3b84058cf08a7f9f06fce83878a2ea88f290ae09dabc93a64eda4c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:33.873328Z","signature_b64":"ELVG5bG8C5ZfX/mYuq0xy0ePvDJdxBz7NsA10BPziCHLPbQf2r2FJE/1lyhthPsz8S0huM5Q18G+0+u1oZtqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05857534a3b84058cf08a7f9f06fce83878a2ea88f290ae09dabc93a64eda4c5","last_reissued_at":"2026-05-18T03:25:33.872769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:33.872769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3803","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOvjjdJG6MPEfSW26PtE2rA0gE39al4PKQLQm8oHTQAU13PypqDG5J4k1QbZKGKrFPhNCjwSeC2cqLXm3j42Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:58:01.948526Z"},"content_sha256":"d9686ad4fe06b937234a990e90b9148cad6c75e15d6cc8f12e7dec0c8b920405","schema_version":"1.0","event_id":"sha256:d9686ad4fe06b937234a990e90b9148cad6c75e15d6cc8f12e7dec0c8b920405"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AWCXKNFDXBAFRTYIU747A36OQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fast randomized Kaczmarz algorithm for sparse solutions of consistent linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"cs.NA","authors_text":"Hassan Mansour, Ozgur Yilmaz","submitted_at":"2013-05-16T13:44:42Z","abstract_excerpt":"The Kaczmarz algorithm is a popular solver for overdetermined linear systems due to its simplicity and speed. In this paper, we propose a modification that speeds up the convergence of the randomized Kaczmarz algorithm for systems of linear equations with sparse solutions. The speedup is achieved by projecting every iterate onto a weighted row of the linear system while maintaining the random row selection criteria of Strohmer and Vershynin. The weights are chosen to attenuate the contribution of row elements that lie outside of the estimated support of the sparse solution. While the Kaczmarz "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3803","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLH3VZccL8/+Th+JhrXtHdaKEoh8uPQTxw/OQXNx3GUZDd8H2kXD1FDuGouUT44RFXa96TFJ5oA1RGf9wL4sDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:58:01.948869Z"},"content_sha256":"1f210dd666f4bc641b5a08fc4435040ff2fe5582c582c65b9bd4e6530582c012","schema_version":"1.0","event_id":"sha256:1f210dd666f4bc641b5a08fc4435040ff2fe5582c582c65b9bd4e6530582c012"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWCXKNFDXBAFRTYIU747A36OQO/bundle.json","state_url":"https://pith.science/pith/AWCXKNFDXBAFRTYIU747A36OQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWCXKNFDXBAFRTYIU747A36OQO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T03:58:01Z","links":{"resolver":"https://pith.science/pith/AWCXKNFDXBAFRTYIU747A36OQO","bundle":"https://pith.science/pith/AWCXKNFDXBAFRTYIU747A36OQO/bundle.json","state":"https://pith.science/pith/AWCXKNFDXBAFRTYIU747A36OQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWCXKNFDXBAFRTYIU747A36OQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AWCXKNFDXBAFRTYIU747A36OQO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8959f57e44e9eb100b8b4c763be24ce8b543ea8ec905830513415ff391890068","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-16T13:44:42Z","title_canon_sha256":"d8820957736568f5f1208e5edfa4eaf0379301f3bfbf8338373eb9188df7fac6"},"schema_version":"1.0","source":{"id":"1305.3803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3803","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3803v1","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3803","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"AWCXKNFDXBAF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AWCXKNFDXBAFRTYI","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AWCXKNFD","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:1f210dd666f4bc641b5a08fc4435040ff2fe5582c582c65b9bd4e6530582c012","target":"graph","created_at":"2026-05-18T03:25:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The Kaczmarz algorithm is a popular solver for overdetermined linear systems due to its simplicity and speed. In this paper, we propose a modification that speeds up the convergence of the randomized Kaczmarz algorithm for systems of linear equations with sparse solutions. The speedup is achieved by projecting every iterate onto a weighted row of the linear system while maintaining the random row selection criteria of Strohmer and Vershynin. The weights are chosen to attenuate the contribution of row elements that lie outside of the estimated support of the sparse solution. While the Kaczmarz ","authors_text":"Hassan Mansour, Ozgur Yilmaz","cross_cats":["cs.IT","math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-16T13:44:42Z","title":"A fast randomized Kaczmarz algorithm for sparse solutions of consistent linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3803","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d9686ad4fe06b937234a990e90b9148cad6c75e15d6cc8f12e7dec0c8b920405","target":"record","created_at":"2026-05-18T03:25:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8959f57e44e9eb100b8b4c763be24ce8b543ea8ec905830513415ff391890068","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-16T13:44:42Z","title_canon_sha256":"d8820957736568f5f1208e5edfa4eaf0379301f3bfbf8338373eb9188df7fac6"},"schema_version":"1.0","source":{"id":"1305.3803","kind":"arxiv","version":1}},"canonical_sha256":"05857534a3b84058cf08a7f9f06fce83878a2ea88f290ae09dabc93a64eda4c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05857534a3b84058cf08a7f9f06fce83878a2ea88f290ae09dabc93a64eda4c5","first_computed_at":"2026-05-18T03:25:33.872769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:33.872769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ELVG5bG8C5ZfX/mYuq0xy0ePvDJdxBz7NsA10BPziCHLPbQf2r2FJE/1lyhthPsz8S0huM5Q18G+0+u1oZtqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:33.873328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9686ad4fe06b937234a990e90b9148cad6c75e15d6cc8f12e7dec0c8b920405","sha256:1f210dd666f4bc641b5a08fc4435040ff2fe5582c582c65b9bd4e6530582c012"],"state_sha256":"c3fd6c11934dd974b1bb6d345917fab36eac82b6ab685a381c1ef3e4f24b49dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JjGH07H3XxmRPcBzt6oNYC/2py0cbEtQRhg+961vaiv1zCG+eTPmj+TKb5BZ7ObhOgMis5Ry5Z5tYUVKWR2iCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:58:01.950938Z","bundle_sha256":"b65914e01cdadaa6372a3e7f51aae0fef76bc277eac0c015128e2635c0132f6d"}}