{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3ZXQ2QKYXTM5NMCYQLKWOJXF4Y","short_pith_number":"pith:3ZXQ2QKY","canonical_record":{"source":{"id":"1306.6042","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-25T17:39:48Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"380001edac0d9ebfbfccccc88bf011cd21b97cdcedde45717b43aa41bc0fa87c","abstract_canon_sha256":"1587f65317bec23c6138f361f069e1a2ed1a5b8ddb986020d5e88a2d4fef1b4f"},"schema_version":"1.0"},"canonical_sha256":"de6f0d4158bcd9d6b05882d56726e5e61a7b638a3c5396778e7b5ee5a3daa6c6","source":{"kind":"arxiv","id":"1306.6042","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6042","created_at":"2026-05-18T02:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6042v4","created_at":"2026-05-18T02:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6042","created_at":"2026-05-18T02:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"3ZXQ2QKYXTM5","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ZXQ2QKYXTM5NMCY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ZXQ2QKY","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3ZXQ2QKYXTM5NMCYQLKWOJXF4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1306.6042","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-25T17:39:48Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"380001edac0d9ebfbfccccc88bf011cd21b97cdcedde45717b43aa41bc0fa87c","abstract_canon_sha256":"1587f65317bec23c6138f361f069e1a2ed1a5b8ddb986020d5e88a2d4fef1b4f"},"schema_version":"1.0"},"canonical_sha256":"de6f0d4158bcd9d6b05882d56726e5e61a7b638a3c5396778e7b5ee5a3daa6c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:56.344626Z","signature_b64":"84ej+hDBQUQ/S0HoaNiCA9HzlhiH7K99au/srNAHQrjKLdt5FMh1+v4zwAjZG23d54D/P0ofMAFAKNOcKTGeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de6f0d4158bcd9d6b05882d56726e5e61a7b638a3c5396778e7b5ee5a3daa6c6","last_reissued_at":"2026-05-18T02:53:56.343816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:56.343816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.6042","source_version":4,"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-18T02:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJzeBG4cktQYWRBtDyglWUL6fVtz6QW+SMPbrCyV5GNB/knx3y7mQQj0/TKtyYz8CU5bv85mwPH82egbg5X/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:43:47.591359Z"},"content_sha256":"ddbe20953ab8948634689f62ddf0fe3816561b5f67b73b6fd8a65ef5de22e266","schema_version":"1.0","event_id":"sha256:ddbe20953ab8948634689f62ddf0fe3816561b5f67b73b6fd8a65ef5de22e266"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3ZXQ2QKYXTM5NMCYQLKWOJXF4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"OptShrink: An algorithm for improved low-rank signal matrix denoising by optimal, data-driven singular value shrinkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Raj Rao Nadakuditi","submitted_at":"2013-06-25T17:39:48Z","abstract_excerpt":"The truncated singular value decomposition (SVD) of the measurement matrix is the optimal solution to the_representation_ problem of how to best approximate a noisy measurement matrix using a low-rank matrix. Here, we consider the (unobservable)_denoising_ problem of how to best approximate a low-rank signal matrix buried in noise by optimal (re)weighting of the singular vectors of the measurement matrix. We exploit recent results from random matrix theory to exactly characterize the large matrix limit of the optimal weighting coefficients and show that they can be computed directly from data "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6042","kind":"arxiv","version":4},"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-18T02:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wv4pHZnKQ8m4X3y4vMJW2MPUyq8jsSgQGQAg2uwx3Y1YPqsGHKtosJ6BZAJDjrSQXp48JXvkT2XqAanwf3oKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:43:47.591719Z"},"content_sha256":"a92d718e3307daf086d658dac22a6f748852c9e8eff4a18b40624c54866b08b4","schema_version":"1.0","event_id":"sha256:a92d718e3307daf086d658dac22a6f748852c9e8eff4a18b40624c54866b08b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZXQ2QKYXTM5NMCYQLKWOJXF4Y/bundle.json","state_url":"https://pith.science/pith/3ZXQ2QKYXTM5NMCYQLKWOJXF4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZXQ2QKYXTM5NMCYQLKWOJXF4Y/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-06-30T23:43:47Z","links":{"resolver":"https://pith.science/pith/3ZXQ2QKYXTM5NMCYQLKWOJXF4Y","bundle":"https://pith.science/pith/3ZXQ2QKYXTM5NMCYQLKWOJXF4Y/bundle.json","state":"https://pith.science/pith/3ZXQ2QKYXTM5NMCYQLKWOJXF4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZXQ2QKYXTM5NMCYQLKWOJXF4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3ZXQ2QKYXTM5NMCYQLKWOJXF4Y","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":"1587f65317bec23c6138f361f069e1a2ed1a5b8ddb986020d5e88a2d4fef1b4f","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-25T17:39:48Z","title_canon_sha256":"380001edac0d9ebfbfccccc88bf011cd21b97cdcedde45717b43aa41bc0fa87c"},"schema_version":"1.0","source":{"id":"1306.6042","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6042","created_at":"2026-05-18T02:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6042v4","created_at":"2026-05-18T02:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6042","created_at":"2026-05-18T02:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"3ZXQ2QKYXTM5","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ZXQ2QKYXTM5NMCY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ZXQ2QKY","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:a92d718e3307daf086d658dac22a6f748852c9e8eff4a18b40624c54866b08b4","target":"graph","created_at":"2026-05-18T02:53:56Z","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":"The truncated singular value decomposition (SVD) of the measurement matrix is the optimal solution to the_representation_ problem of how to best approximate a noisy measurement matrix using a low-rank matrix. Here, we consider the (unobservable)_denoising_ problem of how to best approximate a low-rank signal matrix buried in noise by optimal (re)weighting of the singular vectors of the measurement matrix. We exploit recent results from random matrix theory to exactly characterize the large matrix limit of the optimal weighting coefficients and show that they can be computed directly from data ","authors_text":"Raj Rao Nadakuditi","cross_cats":["cs.IT","math.IT","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-25T17:39:48Z","title":"OptShrink: An algorithm for improved low-rank signal matrix denoising by optimal, data-driven singular value shrinkage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6042","kind":"arxiv","version":4},"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:ddbe20953ab8948634689f62ddf0fe3816561b5f67b73b6fd8a65ef5de22e266","target":"record","created_at":"2026-05-18T02:53:56Z","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":"1587f65317bec23c6138f361f069e1a2ed1a5b8ddb986020d5e88a2d4fef1b4f","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-25T17:39:48Z","title_canon_sha256":"380001edac0d9ebfbfccccc88bf011cd21b97cdcedde45717b43aa41bc0fa87c"},"schema_version":"1.0","source":{"id":"1306.6042","kind":"arxiv","version":4}},"canonical_sha256":"de6f0d4158bcd9d6b05882d56726e5e61a7b638a3c5396778e7b5ee5a3daa6c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de6f0d4158bcd9d6b05882d56726e5e61a7b638a3c5396778e7b5ee5a3daa6c6","first_computed_at":"2026-05-18T02:53:56.343816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:56.343816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"84ej+hDBQUQ/S0HoaNiCA9HzlhiH7K99au/srNAHQrjKLdt5FMh1+v4zwAjZG23d54D/P0ofMAFAKNOcKTGeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:56.344626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.6042","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddbe20953ab8948634689f62ddf0fe3816561b5f67b73b6fd8a65ef5de22e266","sha256:a92d718e3307daf086d658dac22a6f748852c9e8eff4a18b40624c54866b08b4"],"state_sha256":"0d3d677805834d74e07079dd936f06097d0d294607ec8c165bd1bfbe2353b5a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQYRSzaCvlruwWAw7fYrABfWezp4YeAbDL90T5XuyHu7JzE6j3bPKPMcVpmrnv9n+Q9pWJhtMMjcwRDiWtiGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:43:47.593779Z","bundle_sha256":"5edc435c081460313ff2c0c50f0bac273297afeec4bdf1119e9bdcebfc23bd5e"}}