{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6547XOZCEUIJVEZOYE53W34TGX","short_pith_number":"pith:6547XOZC","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"},"canonical_sha256":"f779fbbb2225109a932ec13bbb6f9335c15578ca866b9e69d140f80d34d83818","source":{"kind":"arxiv","id":"1404.1610","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1610","created_at":"2026-05-18T01:43:37Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1610v1","created_at":"2026-05-18T01:43:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1610","created_at":"2026-05-18T01:43:37Z"},{"alias_kind":"pith_short_12","alias_value":"6547XOZCEUIJ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6547XOZCEUIJVEZO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6547XOZC","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6547XOZCEUIJVEZOYE53W34TGX","target":"record","payload":{"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"},"canonical_sha256":"f779fbbb2225109a932ec13bbb6f9335c15578ca866b9e69d140f80d34d83818","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"},"source_kind":"arxiv","source_id":"1404.1610","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:43:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V66MA86PG+nAfPiv3PRIAuSIbBOn8nl7Xzgowt2WPqc1H5y5oRntsU37tHrhXrRPE9rXIRPuL8zxGs1G2GcvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:00:39.457152Z"},"content_sha256":"72b18ec699f280065c7bb90a6d39d6558946397534f706c7bb4935d1f756d696","schema_version":"1.0","event_id":"sha256:72b18ec699f280065c7bb90a6d39d6558946397534f706c7bb4935d1f756d696"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6547XOZCEUIJVEZOYE53W34TGX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:43:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmJlW7YrdVKPdb3xkcUOmZpHUyVWK/kx5pP8nvCsGLm1hMOupfT9dLfi+SAwlE+fB+j17kLNtpRrTx/NU0RhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:00:39.457508Z"},"content_sha256":"9148374219127ac1aff2f8a031330fa80396010adb86be088b49162f90ae8228","schema_version":"1.0","event_id":"sha256:9148374219127ac1aff2f8a031330fa80396010adb86be088b49162f90ae8228"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/bundle.json","state_url":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6547XOZCEUIJVEZOYE53W34TGX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T20:00:39Z","links":{"resolver":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX","bundle":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/bundle.json","state":"https://pith.science/pith/6547XOZCEUIJVEZOYE53W34TGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6547XOZCEUIJVEZOYE53W34TGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6547XOZCEUIJVEZOYE53W34TGX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"11ef88a367aa17d4c0ca34a8b0619b1d544540db19a19a4f0622dc311cacaead","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-06T19:06:37Z","title_canon_sha256":"b966a14bac5742ce2a61bfcd8ef51c7259ca0138322755f0ddcda7677e0eecc2"},"schema_version":"1.0","source":{"id":"1404.1610","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1610","created_at":"2026-05-18T01:43:37Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1610v1","created_at":"2026-05-18T01:43:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1610","created_at":"2026-05-18T01:43:37Z"},{"alias_kind":"pith_short_12","alias_value":"6547XOZCEUIJ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6547XOZCEUIJVEZO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6547XOZC","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:9148374219127ac1aff2f8a031330fa80396010adb86be088b49162f90ae8228","target":"graph","created_at":"2026-05-18T01:43:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Julianne Chung, Matthias Chung","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-06T19:06:37Z","title":"An Efficient Approach for Computing Optimal Low-Rank Regularized Inverse Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1610","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:72b18ec699f280065c7bb90a6d39d6558946397534f706c7bb4935d1f756d696","target":"record","created_at":"2026-05-18T01:43:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"11ef88a367aa17d4c0ca34a8b0619b1d544540db19a19a4f0622dc311cacaead","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-06T19:06:37Z","title_canon_sha256":"b966a14bac5742ce2a61bfcd8ef51c7259ca0138322755f0ddcda7677e0eecc2"},"schema_version":"1.0","source":{"id":"1404.1610","kind":"arxiv","version":1}},"canonical_sha256":"f779fbbb2225109a932ec13bbb6f9335c15578ca866b9e69d140f80d34d83818","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f779fbbb2225109a932ec13bbb6f9335c15578ca866b9e69d140f80d34d83818","first_computed_at":"2026-05-18T01:43:37.182094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:43:37.182094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hMe73jxfhkh0yQc4SRBXy9nJOoz0k+aeLYD62ca5/Dlmxbm5+arz/V1+fu7CA+Y0jBxDSCqcy53ffY3MI+yBDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:43:37.182781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1610","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72b18ec699f280065c7bb90a6d39d6558946397534f706c7bb4935d1f756d696","sha256:9148374219127ac1aff2f8a031330fa80396010adb86be088b49162f90ae8228"],"state_sha256":"2e72d55d57eb3e8d1d4105a34595f5e4eb24b7c3eda9bae4a1964aa4926c30f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PKMvVm4A6wsuDtpVlFSD5T2qPEEG2wkFeItI8+SbWqZ1CRjj+X9QjkT2tU7CF/AsC+kN3/PW9Po3Z0XFdyIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:00:39.459473Z","bundle_sha256":"ce767c3a11b46359365b8ed5d7caec71127b77779b9ef1c3a214cd832ab1b3ca"}}