{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RUCZYADWXGFUY4SDZMCF7UDMA6","short_pith_number":"pith:RUCZYADW","schema_version":"1.0","canonical_sha256":"8d059c0076b98b4c7243cb045fd06c07bcc890477802eead5e24dc8f41da553e","source":{"kind":"arxiv","id":"1601.04280","version":1},"attestation_state":"computed","paper":{"title":"Randomized LU Decomposition Using Sparse Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Amir Averbuch, Gil Shabat, Yariv Aizenbud","submitted_at":"2016-01-17T12:07:51Z","abstract_excerpt":"A fast algorithm for the approximation of a low rank LU decomposition is presented. In order to achieve a low complexity, the algorithm uses sparse random projections combined with FFT-based random projections. The asymptotic approximation error of the algorithm is analyzed and a theoretical error bound is presented. Finally, numerical examples illustrate that for a similar approximation error, the sparse LU algorithm is faster than recent state-of-the-art methods. The algorithm is completely parallelizable that enables to run on a GPU. The performance is tested on a GPU card, showing a signif"},"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":"1601.04280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-17T12:07:51Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"cbfdfb18d8302c61d0ad0c79817d01399031482fd720948edbe392ffecf23723","abstract_canon_sha256":"21000d46cdd2aefc2c9eb1f0a2a79199b5d2d65ad2417df95c15def97ca85e9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:45.439999Z","signature_b64":"zNlwh7nnwmkd8+qQm8GjUTzX6aoaT39/uG5VwtAkpiHObniSW1b3odyhMl4Vpr0P8MBAPf4mYGovRTtGGB8tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d059c0076b98b4c7243cb045fd06c07bcc890477802eead5e24dc8f41da553e","last_reissued_at":"2026-05-18T01:22:45.439425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:45.439425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized LU Decomposition Using Sparse Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Amir Averbuch, Gil Shabat, Yariv Aizenbud","submitted_at":"2016-01-17T12:07:51Z","abstract_excerpt":"A fast algorithm for the approximation of a low rank LU decomposition is presented. In order to achieve a low complexity, the algorithm uses sparse random projections combined with FFT-based random projections. The asymptotic approximation error of the algorithm is analyzed and a theoretical error bound is presented. Finally, numerical examples illustrate that for a similar approximation error, the sparse LU algorithm is faster than recent state-of-the-art methods. The algorithm is completely parallelizable that enables to run on a GPU. The performance is tested on a GPU card, showing a signif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04280","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":"1601.04280","created_at":"2026-05-18T01:22:45.439511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04280v1","created_at":"2026-05-18T01:22:45.439511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04280","created_at":"2026-05-18T01:22:45.439511+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUCZYADWXGFU","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUCZYADWXGFUY4SD","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUCZYADW","created_at":"2026-05-18T12:30:41.710351+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/RUCZYADWXGFUY4SDZMCF7UDMA6","json":"https://pith.science/pith/RUCZYADWXGFUY4SDZMCF7UDMA6.json","graph_json":"https://pith.science/api/pith-number/RUCZYADWXGFUY4SDZMCF7UDMA6/graph.json","events_json":"https://pith.science/api/pith-number/RUCZYADWXGFUY4SDZMCF7UDMA6/events.json","paper":"https://pith.science/paper/RUCZYADW"},"agent_actions":{"view_html":"https://pith.science/pith/RUCZYADWXGFUY4SDZMCF7UDMA6","download_json":"https://pith.science/pith/RUCZYADWXGFUY4SDZMCF7UDMA6.json","view_paper":"https://pith.science/paper/RUCZYADW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04280&json=true","fetch_graph":"https://pith.science/api/pith-number/RUCZYADWXGFUY4SDZMCF7UDMA6/graph.json","fetch_events":"https://pith.science/api/pith-number/RUCZYADWXGFUY4SDZMCF7UDMA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUCZYADWXGFUY4SDZMCF7UDMA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUCZYADWXGFUY4SDZMCF7UDMA6/action/storage_attestation","attest_author":"https://pith.science/pith/RUCZYADWXGFUY4SDZMCF7UDMA6/action/author_attestation","sign_citation":"https://pith.science/pith/RUCZYADWXGFUY4SDZMCF7UDMA6/action/citation_signature","submit_replication":"https://pith.science/pith/RUCZYADWXGFUY4SDZMCF7UDMA6/action/replication_record"}},"created_at":"2026-05-18T01:22:45.439511+00:00","updated_at":"2026-05-18T01:22:45.439511+00:00"}