{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EZP7JP6T7BXAFMPDYE35GTFJKF","short_pith_number":"pith:EZP7JP6T","schema_version":"1.0","canonical_sha256":"265ff4bfd3f86e02b1e3c137d34ca9516b89f3c960b3335a397b30a03b154f2f","source":{"kind":"arxiv","id":"1811.00169","version":1},"attestation_state":"computed","paper":{"title":"The Dual Kaczmarz Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Anna Aboud, Emelie Curl, Eric S. Weber, M. Vaughan, Steven N. Harding","submitted_at":"2018-11-01T00:23:29Z","abstract_excerpt":"The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector $x$ in a (separable) Hilbert space from the inner-products $\\{\\langle x, \\phi_{n} \\rangle\\}$. The Kaczmarz algorithms defines a sequence of approximations from the sequence $\\{\\langle x, \\phi_{n} \\rangle\\}$; these approximations only converge to $x$ when $\\{\\phi_{n}\\}$ is ${effective}$. We dualize the Kaczmarz algorithm so that $x$ can be obtained from $\\{\\langle x, \\phi_{n} \\rangle\\}$ by using a second sequence $\\{\\psi_{n}\\}$ in the reconstruction. This allo"},"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":"1811.00169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2018-11-01T00:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"13dfe05426817b10d0e1d5a505c11dc1c2dee79560166ae5c1439c984e9b1b3d","abstract_canon_sha256":"a5a9be57bce8754f86066679b5ac1acfe56448da8488a617eae5fbdb596374c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:48.049948Z","signature_b64":"BGHCxnu8t6V1o7c653hphbKy5rhqZF0dAyqS/YGMHOdJB64xyan5AqRQoZFBDgWusEAJDMeum6b4vA//17oDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"265ff4bfd3f86e02b1e3c137d34ca9516b89f3c960b3335a397b30a03b154f2f","last_reissued_at":"2026-05-18T00:01:48.049448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:48.049448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Dual Kaczmarz Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Anna Aboud, Emelie Curl, Eric S. Weber, M. Vaughan, Steven N. Harding","submitted_at":"2018-11-01T00:23:29Z","abstract_excerpt":"The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector $x$ in a (separable) Hilbert space from the inner-products $\\{\\langle x, \\phi_{n} \\rangle\\}$. The Kaczmarz algorithms defines a sequence of approximations from the sequence $\\{\\langle x, \\phi_{n} \\rangle\\}$; these approximations only converge to $x$ when $\\{\\phi_{n}\\}$ is ${effective}$. We dualize the Kaczmarz algorithm so that $x$ can be obtained from $\\{\\langle x, \\phi_{n} \\rangle\\}$ by using a second sequence $\\{\\psi_{n}\\}$ in the reconstruction. This allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00169","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":"1811.00169","created_at":"2026-05-18T00:01:48.049522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00169v1","created_at":"2026-05-18T00:01:48.049522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00169","created_at":"2026-05-18T00:01:48.049522+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZP7JP6T7BXA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZP7JP6T7BXAFMPD","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZP7JP6T","created_at":"2026-05-18T12:32:22.470017+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/EZP7JP6T7BXAFMPDYE35GTFJKF","json":"https://pith.science/pith/EZP7JP6T7BXAFMPDYE35GTFJKF.json","graph_json":"https://pith.science/api/pith-number/EZP7JP6T7BXAFMPDYE35GTFJKF/graph.json","events_json":"https://pith.science/api/pith-number/EZP7JP6T7BXAFMPDYE35GTFJKF/events.json","paper":"https://pith.science/paper/EZP7JP6T"},"agent_actions":{"view_html":"https://pith.science/pith/EZP7JP6T7BXAFMPDYE35GTFJKF","download_json":"https://pith.science/pith/EZP7JP6T7BXAFMPDYE35GTFJKF.json","view_paper":"https://pith.science/paper/EZP7JP6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00169&json=true","fetch_graph":"https://pith.science/api/pith-number/EZP7JP6T7BXAFMPDYE35GTFJKF/graph.json","fetch_events":"https://pith.science/api/pith-number/EZP7JP6T7BXAFMPDYE35GTFJKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZP7JP6T7BXAFMPDYE35GTFJKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZP7JP6T7BXAFMPDYE35GTFJKF/action/storage_attestation","attest_author":"https://pith.science/pith/EZP7JP6T7BXAFMPDYE35GTFJKF/action/author_attestation","sign_citation":"https://pith.science/pith/EZP7JP6T7BXAFMPDYE35GTFJKF/action/citation_signature","submit_replication":"https://pith.science/pith/EZP7JP6T7BXAFMPDYE35GTFJKF/action/replication_record"}},"created_at":"2026-05-18T00:01:48.049522+00:00","updated_at":"2026-05-18T00:01:48.049522+00:00"}