{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6547XOZCEUIJVEZOYE53W34TGX","short_pith_number":"pith:6547XOZC","schema_version":"1.0","canonical_sha256":"f779fbbb2225109a932ec13bbb6f9335c15578ca866b9e69d140f80d34d83818","source":{"kind":"arxiv","id":"1404.1610","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Approach for Computing Optimal Low-Rank Regularized Inverse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Julianne Chung, Matthias Chung","submitted_at":"2014-04-06T19:06:37Z","abstract_excerpt":"Standard regularization methods that are used to compute solutions to ill-posed inverse problems require knowledge of the forward model. In many real-life applications, the forward model is not known, but training data is readily available. In this paper, we develop a new framework that uses training data, as a substitute for knowledge of the forward model, to compute an optimal low-rank regularized inverse matrix directly, allowing for very fast computation of a regularized solution. We consider a statistical framework based on Bayes and empirical Bayes risk minimization to analyze theoretica"},"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":"1404.1610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-06T19:06:37Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b966a14bac5742ce2a61bfcd8ef51c7259ca0138322755f0ddcda7677e0eecc2","abstract_canon_sha256":"11ef88a367aa17d4c0ca34a8b0619b1d544540db19a19a4f0622dc311cacaead"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:43:37.182781Z","signature_b64":"hMe73jxfhkh0yQc4SRBXy9nJOoz0k+aeLYD62ca5/Dlmxbm5+arz/V1+fu7CA+Y0jBxDSCqcy53ffY3MI+yBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f779fbbb2225109a932ec13bbb6f9335c15578ca866b9e69d140f80d34d83818","last_reissued_at":"2026-05-18T01:43:37.182094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:43:37.182094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Approach for Computing Optimal Low-Rank Regularized Inverse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Julianne Chung, Matthias Chung","submitted_at":"2014-04-06T19:06:37Z","abstract_excerpt":"Standard regularization methods that are used to compute solutions to ill-posed inverse problems require knowledge of the forward model. In many real-life applications, the forward model is not known, but training data is readily available. In this paper, we develop a new framework that uses training data, as a substitute for knowledge of the forward model, to compute an optimal low-rank regularized inverse matrix directly, allowing for very fast computation of a regularized solution. We consider a statistical framework based on Bayes and empirical Bayes risk minimization to analyze theoretica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1610","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":"1404.1610","created_at":"2026-05-18T01:43:37.182216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1610v1","created_at":"2026-05-18T01:43:37.182216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1610","created_at":"2026-05-18T01:43:37.182216+00:00"},{"alias_kind":"pith_short_12","alias_value":"6547XOZCEUIJ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6547XOZCEUIJVEZO","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6547XOZC","created_at":"2026-05-18T12:28:16.859392+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/6547XOZCEUIJVEZOYE53W34TGX","json":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX.json","graph_json":"https://pith.science/api/pith-number/6547XOZCEUIJVEZOYE53W34TGX/graph.json","events_json":"https://pith.science/api/pith-number/6547XOZCEUIJVEZOYE53W34TGX/events.json","paper":"https://pith.science/paper/6547XOZC"},"agent_actions":{"view_html":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX","download_json":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX.json","view_paper":"https://pith.science/paper/6547XOZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1610&json=true","fetch_graph":"https://pith.science/api/pith-number/6547XOZCEUIJVEZOYE53W34TGX/graph.json","fetch_events":"https://pith.science/api/pith-number/6547XOZCEUIJVEZOYE53W34TGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/action/storage_attestation","attest_author":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/action/author_attestation","sign_citation":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/action/citation_signature","submit_replication":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/action/replication_record"}},"created_at":"2026-05-18T01:43:37.182216+00:00","updated_at":"2026-05-18T01:43:37.182216+00:00"}