{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W2LAJHQUKOWBDVLGEZJYTSYP6N","short_pith_number":"pith:W2LAJHQU","schema_version":"1.0","canonical_sha256":"b696049e1453ac11d566265389cb0ff371028ec3cdc2213bc7a7084386065804","source":{"kind":"arxiv","id":"1812.02056","version":1},"attestation_state":"computed","paper":{"title":"Simple, Fast and Practicable Algorithms for Cholesky, LU and QR Decomposition Using Fast Rectangular Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NA","authors_text":"Crist\\'obal Camarero","submitted_at":"2018-12-05T15:46:21Z","abstract_excerpt":"This note presents fast Cholesky/LU/QR decomposition algorithms with $O(n^{2.529})$ time complexity when using the fastest known matrix multiplication. The algorithms have potential application, since a quickly made implementation using Strassen multiplication has lesser execution time than the employed by the GNU Scientific Library for the same task in at least a few examples.\n  The underlaying ideas are very simple. Despite this, I have been unable to find these methods in the literature."},"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":"1812.02056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-12-05T15:46:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"18f9e27825c96d71de457b72cd77d440a0d0000e91bfd1bbb4445bc205a5421a","abstract_canon_sha256":"9da182a39aa60721a6e998cd2d959a512c2166f8ce0c1abba09cd9dfaa9d38ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:59.835471Z","signature_b64":"fD7rZKmERYg0NgaDYPddXp21SIyRISOpchEPviL/fwMfSx+Z26MM1rbf1AD9e4QVNpNReu4RoB49/ddQtuNWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b696049e1453ac11d566265389cb0ff371028ec3cdc2213bc7a7084386065804","last_reissued_at":"2026-05-17T23:58:59.834837Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:59.834837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple, Fast and Practicable Algorithms for Cholesky, LU and QR Decomposition Using Fast Rectangular Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NA","authors_text":"Crist\\'obal Camarero","submitted_at":"2018-12-05T15:46:21Z","abstract_excerpt":"This note presents fast Cholesky/LU/QR decomposition algorithms with $O(n^{2.529})$ time complexity when using the fastest known matrix multiplication. The algorithms have potential application, since a quickly made implementation using Strassen multiplication has lesser execution time than the employed by the GNU Scientific Library for the same task in at least a few examples.\n  The underlaying ideas are very simple. Despite this, I have been unable to find these methods in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02056","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":"1812.02056","created_at":"2026-05-17T23:58:59.834933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02056v1","created_at":"2026-05-17T23:58:59.834933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02056","created_at":"2026-05-17T23:58:59.834933+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2LAJHQUKOWB","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2LAJHQUKOWBDVLG","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2LAJHQU","created_at":"2026-05-18T12:32:59.047623+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/W2LAJHQUKOWBDVLGEZJYTSYP6N","json":"https://pith.science/pith/W2LAJHQUKOWBDVLGEZJYTSYP6N.json","graph_json":"https://pith.science/api/pith-number/W2LAJHQUKOWBDVLGEZJYTSYP6N/graph.json","events_json":"https://pith.science/api/pith-number/W2LAJHQUKOWBDVLGEZJYTSYP6N/events.json","paper":"https://pith.science/paper/W2LAJHQU"},"agent_actions":{"view_html":"https://pith.science/pith/W2LAJHQUKOWBDVLGEZJYTSYP6N","download_json":"https://pith.science/pith/W2LAJHQUKOWBDVLGEZJYTSYP6N.json","view_paper":"https://pith.science/paper/W2LAJHQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02056&json=true","fetch_graph":"https://pith.science/api/pith-number/W2LAJHQUKOWBDVLGEZJYTSYP6N/graph.json","fetch_events":"https://pith.science/api/pith-number/W2LAJHQUKOWBDVLGEZJYTSYP6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2LAJHQUKOWBDVLGEZJYTSYP6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2LAJHQUKOWBDVLGEZJYTSYP6N/action/storage_attestation","attest_author":"https://pith.science/pith/W2LAJHQUKOWBDVLGEZJYTSYP6N/action/author_attestation","sign_citation":"https://pith.science/pith/W2LAJHQUKOWBDVLGEZJYTSYP6N/action/citation_signature","submit_replication":"https://pith.science/pith/W2LAJHQUKOWBDVLGEZJYTSYP6N/action/replication_record"}},"created_at":"2026-05-17T23:58:59.834933+00:00","updated_at":"2026-05-17T23:58:59.834933+00:00"}