{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MX2MANQKSQCQ6QKKFX6R3EIZFF","short_pith_number":"pith:MX2MANQK","canonical_record":{"source":{"id":"1305.5870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-24T23:54:18Z","cross_cats_sorted":[],"title_canon_sha256":"33f7a4e3be212ff7956665e1ae6511a56c094b2dc20bba4d3a1b28d3df785bf2","abstract_canon_sha256":"4243519c3f95b9f02ee9e255eceb85fa7ed1adaadcc3704643e2dc9a5628c6d3"},"schema_version":"1.0"},"canonical_sha256":"65f4c0360a94050f414a2dfd1d91192971f5334e8a2be3d7cc5e15a0d5bde44f","source":{"kind":"arxiv","id":"1305.5870","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5870","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5870v3","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5870","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"MX2MANQKSQCQ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MX2MANQKSQCQ6QKK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MX2MANQK","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MX2MANQKSQCQ6QKKFX6R3EIZFF","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-24T23:54:18Z","cross_cats_sorted":[],"title_canon_sha256":"33f7a4e3be212ff7956665e1ae6511a56c094b2dc20bba4d3a1b28d3df785bf2","abstract_canon_sha256":"4243519c3f95b9f02ee9e255eceb85fa7ed1adaadcc3704643e2dc9a5628c6d3"},"schema_version":"1.0"},"canonical_sha256":"65f4c0360a94050f414a2dfd1d91192971f5334e8a2be3d7cc5e15a0d5bde44f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:32.493224Z","signature_b64":"EgoqWbdNTsVltwCQqNAEJPFk9HGVk0PWlp4FJp7TYWCR6FXLeoiR6jEeAuq3qiChk8SBGoituZemw0cdAEsTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f4c0360a94050f414a2dfd1d91192971f5334e8a2be3d7cc5e15a0d5bde44f","last_reissued_at":"2026-05-18T02:50:32.492711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:32.492711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5870","source_version":3,"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:50:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzOg+6t7r7rKTPaX5eEReAK+Wi6UNThDHx3IKPLjNmfWYZn0C0QPJlPZJ7fzUpx/I/lKHCn1ihixFkwy9yAECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:37:20.571714Z"},"content_sha256":"010ce97d2359f805c9c95c87b22ffa02392b6bd4d7323551b15737abd2a62719","schema_version":"1.0","event_id":"sha256:010ce97d2359f805c9c95c87b22ffa02392b6bd4d7323551b15737abd2a62719"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MX2MANQKSQCQ6QKKFX6R3EIZFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Optimal Hard Threshold for Singular Values is 4/sqrt(3)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"David L. Donoho, Matan Gavish","submitted_at":"2013-05-24T23:54:18Z","abstract_excerpt":"We consider recovery of low-rank matrices from noisy data by hard thresholding of singular values, where singular values below a prescribed threshold $\\lambda$ are set to 0. We study the asymptotic MSE in a framework where the matrix size is large compared to the rank of the matrix to be recovered, and the signal-to-noise ratio of the low-rank piece stays constant. The AMSE-optimal choice of hard threshold, in the case of n-by-n matrix in noise level \\sigma, is simply $(4/\\sqrt{3}) \\sqrt{n}\\sigma \\approx 2.309 \\sqrt{n}\\sigma$ when $\\sigma$ is known, or simply $2.858\\cdot y_{med}$ when $\\sigma$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5870","kind":"arxiv","version":3},"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:50:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2I4i9JXMSjTpfO6Tp6dOIFCFOaIf+hkKcyMp38oaqUmqiLDDhfEGNLjIS80O2rSrmdCx67vNaYGwkThuKYRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:37:20.572354Z"},"content_sha256":"d98cab2228df3b10909241f99c70b88e33142b577ae6bf7b9eb50edf11021747","schema_version":"1.0","event_id":"sha256:d98cab2228df3b10909241f99c70b88e33142b577ae6bf7b9eb50edf11021747"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MX2MANQKSQCQ6QKKFX6R3EIZFF/bundle.json","state_url":"https://pith.science/pith/MX2MANQKSQCQ6QKKFX6R3EIZFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MX2MANQKSQCQ6QKKFX6R3EIZFF/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-03T15:37:20Z","links":{"resolver":"https://pith.science/pith/MX2MANQKSQCQ6QKKFX6R3EIZFF","bundle":"https://pith.science/pith/MX2MANQKSQCQ6QKKFX6R3EIZFF/bundle.json","state":"https://pith.science/pith/MX2MANQKSQCQ6QKKFX6R3EIZFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MX2MANQKSQCQ6QKKFX6R3EIZFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MX2MANQKSQCQ6QKKFX6R3EIZFF","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":"4243519c3f95b9f02ee9e255eceb85fa7ed1adaadcc3704643e2dc9a5628c6d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-24T23:54:18Z","title_canon_sha256":"33f7a4e3be212ff7956665e1ae6511a56c094b2dc20bba4d3a1b28d3df785bf2"},"schema_version":"1.0","source":{"id":"1305.5870","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5870","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5870v3","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5870","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"MX2MANQKSQCQ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MX2MANQKSQCQ6QKK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MX2MANQK","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:d98cab2228df3b10909241f99c70b88e33142b577ae6bf7b9eb50edf11021747","target":"graph","created_at":"2026-05-18T02:50:32Z","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":"We consider recovery of low-rank matrices from noisy data by hard thresholding of singular values, where singular values below a prescribed threshold $\\lambda$ are set to 0. We study the asymptotic MSE in a framework where the matrix size is large compared to the rank of the matrix to be recovered, and the signal-to-noise ratio of the low-rank piece stays constant. The AMSE-optimal choice of hard threshold, in the case of n-by-n matrix in noise level \\sigma, is simply $(4/\\sqrt{3}) \\sqrt{n}\\sigma \\approx 2.309 \\sqrt{n}\\sigma$ when $\\sigma$ is known, or simply $2.858\\cdot y_{med}$ when $\\sigma$","authors_text":"David L. Donoho, Matan Gavish","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-24T23:54:18Z","title":"The Optimal Hard Threshold for Singular Values is 4/sqrt(3)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5870","kind":"arxiv","version":3},"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:010ce97d2359f805c9c95c87b22ffa02392b6bd4d7323551b15737abd2a62719","target":"record","created_at":"2026-05-18T02:50:32Z","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":"4243519c3f95b9f02ee9e255eceb85fa7ed1adaadcc3704643e2dc9a5628c6d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-24T23:54:18Z","title_canon_sha256":"33f7a4e3be212ff7956665e1ae6511a56c094b2dc20bba4d3a1b28d3df785bf2"},"schema_version":"1.0","source":{"id":"1305.5870","kind":"arxiv","version":3}},"canonical_sha256":"65f4c0360a94050f414a2dfd1d91192971f5334e8a2be3d7cc5e15a0d5bde44f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65f4c0360a94050f414a2dfd1d91192971f5334e8a2be3d7cc5e15a0d5bde44f","first_computed_at":"2026-05-18T02:50:32.492711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:32.492711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EgoqWbdNTsVltwCQqNAEJPFk9HGVk0PWlp4FJp7TYWCR6FXLeoiR6jEeAuq3qiChk8SBGoituZemw0cdAEsTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:32.493224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5870","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:010ce97d2359f805c9c95c87b22ffa02392b6bd4d7323551b15737abd2a62719","sha256:d98cab2228df3b10909241f99c70b88e33142b577ae6bf7b9eb50edf11021747"],"state_sha256":"87ea0629b16f99e3eb97c38022159d17445978dfa25ed6b3fd0d5366118fdc1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wo7NFL3qlGa2pJwrafsG46mwzgu2Xvd2yTW2Pr5ZxSIIGNFmNipuQ4yGPGlUsSLRA0nzdn26HVu4/i72qeo1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:37:20.574873Z","bundle_sha256":"fec1d8988bb43032e12cbc1196794a1ff7ecd40497a69f577911942e937865ea"}}