{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WDHMCJZ6KGBGRKKPPCYML54PO6","short_pith_number":"pith:WDHMCJZ6","canonical_record":{"source":{"id":"1603.05867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-18T13:16:36Z","cross_cats_sorted":[],"title_canon_sha256":"ab4b956b09b6bbab2c838d456150637215dd90fff05eacbdb21cb8e9f8573301","abstract_canon_sha256":"6a68d6eeb47ed462a650307ecc08dc5b71f58781c70eb8498a63128b580ffb56"},"schema_version":"1.0"},"canonical_sha256":"b0cec1273e518268a94f78b0c5f78f778e0b9d298ba70364f1df7b6b321d9a30","source":{"kind":"arxiv","id":"1603.05867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05867","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05867v1","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05867","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"WDHMCJZ6KGBG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WDHMCJZ6KGBGRKKP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WDHMCJZ6","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WDHMCJZ6KGBGRKKPPCYML54PO6","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-18T13:16:36Z","cross_cats_sorted":[],"title_canon_sha256":"ab4b956b09b6bbab2c838d456150637215dd90fff05eacbdb21cb8e9f8573301","abstract_canon_sha256":"6a68d6eeb47ed462a650307ecc08dc5b71f58781c70eb8498a63128b580ffb56"},"schema_version":"1.0"},"canonical_sha256":"b0cec1273e518268a94f78b0c5f78f778e0b9d298ba70364f1df7b6b321d9a30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:53.409338Z","signature_b64":"LvNCtY9hmHwruMeBOoqfkfJ1LbAal/jHwjzmEAR7Ozx8XXb2IERiWaQz5UoRs3d+9+La33rpn4k+GEQ9aWN+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0cec1273e518268a94f78b0c5f78f778e0b9d298ba70364f1df7b6b321d9a30","last_reissued_at":"2026-05-18T01:18:53.408885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:53.408885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05867","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:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJw1UzTQRgmr+++PuMghDHSxz73VynFgvkCHPwrjrfGKcXIP0XBZ0amBVtCSNDksy9/7XBmjpvlVo2rRaku2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:53:50.481994Z"},"content_sha256":"4c061e92cde1fa075861bbedc8671c18bf2775862720136ab0d76b004a03cadd","schema_version":"1.0","event_id":"sha256:4c061e92cde1fa075861bbedc8671c18bf2775862720136ab0d76b004a03cadd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WDHMCJZ6KGBGRKKPPCYML54PO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal regularized inverse matrices for inverse problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Julianne Chung, Matthias Chung","submitted_at":"2016-03-18T13:16:36Z","abstract_excerpt":"In this paper, we consider optimal low-rank regularized inverse matrix approximations and their applications to inverse problems. We give an explicit solution to a generalized rank-constrained regularized inverse approximation problem, where the key novelties are that we allow for updates to existing approximations and we can incorporate additional probability distribution information. Since computing optimal regularized inverse matrices under rank constraints can be challenging, especially for problems where matrices are large and sparse or are only accessable via function call, we propose an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05867","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:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+Q/NLahI+yzn6Mbug3GGbkt7hVF6wdJNPkslmltvSUG92RZoDNYKYpJvDzxkj+yDlhD+FgvJ8kuFfEdCHwvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:53:50.482343Z"},"content_sha256":"ab1de0728861f630b2bbd6e62f395186be72cbc6f0044973fb2ff986101805b6","schema_version":"1.0","event_id":"sha256:ab1de0728861f630b2bbd6e62f395186be72cbc6f0044973fb2ff986101805b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDHMCJZ6KGBGRKKPPCYML54PO6/bundle.json","state_url":"https://pith.science/pith/WDHMCJZ6KGBGRKKPPCYML54PO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDHMCJZ6KGBGRKKPPCYML54PO6/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:53:50Z","links":{"resolver":"https://pith.science/pith/WDHMCJZ6KGBGRKKPPCYML54PO6","bundle":"https://pith.science/pith/WDHMCJZ6KGBGRKKPPCYML54PO6/bundle.json","state":"https://pith.science/pith/WDHMCJZ6KGBGRKKPPCYML54PO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDHMCJZ6KGBGRKKPPCYML54PO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WDHMCJZ6KGBGRKKPPCYML54PO6","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":"6a68d6eeb47ed462a650307ecc08dc5b71f58781c70eb8498a63128b580ffb56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-18T13:16:36Z","title_canon_sha256":"ab4b956b09b6bbab2c838d456150637215dd90fff05eacbdb21cb8e9f8573301"},"schema_version":"1.0","source":{"id":"1603.05867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05867","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05867v1","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05867","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"WDHMCJZ6KGBG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WDHMCJZ6KGBGRKKP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WDHMCJZ6","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:ab1de0728861f630b2bbd6e62f395186be72cbc6f0044973fb2ff986101805b6","target":"graph","created_at":"2026-05-18T01:18:53Z","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":"In this paper, we consider optimal low-rank regularized inverse matrix approximations and their applications to inverse problems. We give an explicit solution to a generalized rank-constrained regularized inverse approximation problem, where the key novelties are that we allow for updates to existing approximations and we can incorporate additional probability distribution information. Since computing optimal regularized inverse matrices under rank constraints can be challenging, especially for problems where matrices are large and sparse or are only accessable via function call, we propose an","authors_text":"Julianne Chung, Matthias Chung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-18T13:16:36Z","title":"Optimal regularized inverse matrices for inverse problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05867","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:4c061e92cde1fa075861bbedc8671c18bf2775862720136ab0d76b004a03cadd","target":"record","created_at":"2026-05-18T01:18:53Z","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":"6a68d6eeb47ed462a650307ecc08dc5b71f58781c70eb8498a63128b580ffb56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-18T13:16:36Z","title_canon_sha256":"ab4b956b09b6bbab2c838d456150637215dd90fff05eacbdb21cb8e9f8573301"},"schema_version":"1.0","source":{"id":"1603.05867","kind":"arxiv","version":1}},"canonical_sha256":"b0cec1273e518268a94f78b0c5f78f778e0b9d298ba70364f1df7b6b321d9a30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0cec1273e518268a94f78b0c5f78f778e0b9d298ba70364f1df7b6b321d9a30","first_computed_at":"2026-05-18T01:18:53.408885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:53.408885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LvNCtY9hmHwruMeBOoqfkfJ1LbAal/jHwjzmEAR7Ozx8XXb2IERiWaQz5UoRs3d+9+La33rpn4k+GEQ9aWN+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:53.409338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c061e92cde1fa075861bbedc8671c18bf2775862720136ab0d76b004a03cadd","sha256:ab1de0728861f630b2bbd6e62f395186be72cbc6f0044973fb2ff986101805b6"],"state_sha256":"52b75e428e543c9f9d2353eec6c48fc2db26608f9ffaf6e078c70c192ce4aaba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8vqRgrt1ngWyv3nbqe+lKNNS75Gcn5jNVaGDF8TB7z3/S5cdXjFvoBj9O442zWHMa+53DTVttVPFkeYxLWKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:53:50.484273Z","bundle_sha256":"61bcf9c093e04dd135b3234c87b421de81e6291e1a611daca738cd42adadbad8"}}