{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GHOMKQDBO6YTMGKMP35CM7BMWU","short_pith_number":"pith:GHOMKQDB","schema_version":"1.0","canonical_sha256":"31dcc5406177b136194c7efa267c2cb50925231773e991227dab0dab73eefaa4","source":{"kind":"arxiv","id":"2107.02579","version":7},"attestation_state":"computed","paper":{"title":"Numerical Matrix Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.HO","authors_text":"Jun Lu","submitted_at":"2021-07-06T12:56:26Z","abstract_excerpt":"In 1954, Alston S. Householder published \\textit{Principles of Numerical Analysis}, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower and upper triangular matrices. And now, matrix decomposition has become a core technology in machine learning, largely due to the development of the back propagation algorithm in fitting a neural network. The sole aim of this survey is to give a self-contained introduction to concepts and mathematical tools in numerical linear algebra and matrix analysis in o"},"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":"2107.02579","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.HO","submitted_at":"2021-07-06T12:56:26Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"b05e86c280eca0fc625b73cf8cfc99e4cff3963b9f14808f209ff5501412163c","abstract_canon_sha256":"302b47ff2a4b1f1fcca6f3c70ce6f82bcd98ba4fba82248fad6cca1c2e940dbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:28.024475Z","signature_b64":"OifT8O2Y8NdjANG7kAWXhz5K74lQKrIkLUN21/6py/LYdchyXKjwueW5hvQGd/MbiF5qPsbJZG6riU+C9wPbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31dcc5406177b136194c7efa267c2cb50925231773e991227dab0dab73eefaa4","last_reissued_at":"2026-07-05T09:48:28.024000Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:28.024000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical Matrix Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.HO","authors_text":"Jun Lu","submitted_at":"2021-07-06T12:56:26Z","abstract_excerpt":"In 1954, Alston S. Householder published \\textit{Principles of Numerical Analysis}, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower and upper triangular matrices. And now, matrix decomposition has become a core technology in machine learning, largely due to the development of the back propagation algorithm in fitting a neural network. The sole aim of this survey is to give a self-contained introduction to concepts and mathematical tools in numerical linear algebra and matrix analysis in o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.02579","kind":"arxiv","version":7},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.02579/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2107.02579","created_at":"2026-07-05T09:48:28.024057+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.02579v7","created_at":"2026-07-05T09:48:28.024057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02579","created_at":"2026-07-05T09:48:28.024057+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHOMKQDBO6YT","created_at":"2026-07-05T09:48:28.024057+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHOMKQDBO6YTMGKM","created_at":"2026-07-05T09:48:28.024057+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHOMKQDB","created_at":"2026-07-05T09:48:28.024057+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08101","citing_title":"Generative Models: Principles, Architectures, and Applications","ref_index":2025,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU","json":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU.json","graph_json":"https://pith.science/api/pith-number/GHOMKQDBO6YTMGKMP35CM7BMWU/graph.json","events_json":"https://pith.science/api/pith-number/GHOMKQDBO6YTMGKMP35CM7BMWU/events.json","paper":"https://pith.science/paper/GHOMKQDB"},"agent_actions":{"view_html":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU","download_json":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU.json","view_paper":"https://pith.science/paper/GHOMKQDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.02579&json=true","fetch_graph":"https://pith.science/api/pith-number/GHOMKQDBO6YTMGKMP35CM7BMWU/graph.json","fetch_events":"https://pith.science/api/pith-number/GHOMKQDBO6YTMGKMP35CM7BMWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU/action/storage_attestation","attest_author":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU/action/author_attestation","sign_citation":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU/action/citation_signature","submit_replication":"https://pith.science/pith/GHOMKQDBO6YTMGKMP35CM7BMWU/action/replication_record"}},"created_at":"2026-07-05T09:48:28.024057+00:00","updated_at":"2026-07-05T09:48:28.024057+00:00"}