{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:J5SXVAY24XSVXUJJMKXLUGOREQ","short_pith_number":"pith:J5SXVAY2","canonical_record":{"source":{"id":"1203.0108","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-01T07:52:01Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"d4df52d17e451e9f3d2da0fc399288860a0238e60e81fb254fe99e3182b0951e","abstract_canon_sha256":"da0d854e9d6538628f71b333824ba174b8f39a2d09bfdf15c6977c59fde70ffa"},"schema_version":"1.0"},"canonical_sha256":"4f657a831ae5e55bd12962aeba19d12417f424da4f414ce0f515d71a8c2a0759","source":{"kind":"arxiv","id":"1203.0108","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0108","created_at":"2026-05-18T03:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0108v3","created_at":"2026-05-18T03:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0108","created_at":"2026-05-18T03:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"J5SXVAY24XSV","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J5SXVAY24XSVXUJJ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J5SXVAY2","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:J5SXVAY24XSVXUJJMKXLUGOREQ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0108","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-01T07:52:01Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"d4df52d17e451e9f3d2da0fc399288860a0238e60e81fb254fe99e3182b0951e","abstract_canon_sha256":"da0d854e9d6538628f71b333824ba174b8f39a2d09bfdf15c6977c59fde70ffa"},"schema_version":"1.0"},"canonical_sha256":"4f657a831ae5e55bd12962aeba19d12417f424da4f414ce0f515d71a8c2a0759","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:11.597497Z","signature_b64":"FI+0a+GPlAUXBLvnc0J0YYF6hpa1exBiqQYzkdXGlZonx3ZR/PkEpd4mVpT9wAIyhFcl1LIdxlc3v105WCuABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f657a831ae5e55bd12962aeba19d12417f424da4f414ce0f515d71a8c2a0759","last_reissued_at":"2026-05-18T03:00:11.596653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:11.596653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0108","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-18T03:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fvs9lgxQkvsO13t9bTDfuBGqa00YyL/HaFTHzBw3thk9TaairFg9jrdhNLn1aydPAh7+5e5TMzxNBr0JIdcOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:46:05.966508Z"},"content_sha256":"370bc62c5805e1317724250d1054fec53be88372a4cfcd6cddd859eeccea8b99","schema_version":"1.0","event_id":"sha256:370bc62c5805e1317724250d1054fec53be88372a4cfcd6cddd859eeccea8b99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:J5SXVAY24XSVXUJJMKXLUGOREQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy low-rank matrix completion with general sampling distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Olga Klopp","submitted_at":"2012-03-01T07:52:01Z","abstract_excerpt":"In the present paper, we consider the problem of matrix completion with noise. Unlike previous works, we consider quite general sampling distribution and we do not need to know or to estimate the variance of the noise. Two new nuclear-norm penalized estimators are proposed, one of them of \"square-root\" type. We analyse their performance under high-dimensional scaling and provide non-asymptotic bounds on the Frobenius norm error. Up to a logarithmic factor, these performance guarantees are minimax optimal in a number of circumstances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0108","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-18T03:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfZc4N5JmZIk7dfQRPu5SoZU/SSywciNBpM2j1MODy32hPWUxUHKoG76T2zwNBXCaKp1v2hatE0enz/AMUcjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:46:05.967010Z"},"content_sha256":"3759c4eb488cc446bf4059abf5091bfca338367aff11166a2cfe3bfee8221c6a","schema_version":"1.0","event_id":"sha256:3759c4eb488cc446bf4059abf5091bfca338367aff11166a2cfe3bfee8221c6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5SXVAY24XSVXUJJMKXLUGOREQ/bundle.json","state_url":"https://pith.science/pith/J5SXVAY24XSVXUJJMKXLUGOREQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5SXVAY24XSVXUJJMKXLUGOREQ/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-05-31T12:46:05Z","links":{"resolver":"https://pith.science/pith/J5SXVAY24XSVXUJJMKXLUGOREQ","bundle":"https://pith.science/pith/J5SXVAY24XSVXUJJMKXLUGOREQ/bundle.json","state":"https://pith.science/pith/J5SXVAY24XSVXUJJMKXLUGOREQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5SXVAY24XSVXUJJMKXLUGOREQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J5SXVAY24XSVXUJJMKXLUGOREQ","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":"da0d854e9d6538628f71b333824ba174b8f39a2d09bfdf15c6977c59fde70ffa","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-01T07:52:01Z","title_canon_sha256":"d4df52d17e451e9f3d2da0fc399288860a0238e60e81fb254fe99e3182b0951e"},"schema_version":"1.0","source":{"id":"1203.0108","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0108","created_at":"2026-05-18T03:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0108v3","created_at":"2026-05-18T03:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0108","created_at":"2026-05-18T03:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"J5SXVAY24XSV","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J5SXVAY24XSVXUJJ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J5SXVAY2","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:3759c4eb488cc446bf4059abf5091bfca338367aff11166a2cfe3bfee8221c6a","target":"graph","created_at":"2026-05-18T03:00:11Z","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 the present paper, we consider the problem of matrix completion with noise. Unlike previous works, we consider quite general sampling distribution and we do not need to know or to estimate the variance of the noise. Two new nuclear-norm penalized estimators are proposed, one of them of \"square-root\" type. We analyse their performance under high-dimensional scaling and provide non-asymptotic bounds on the Frobenius norm error. Up to a logarithmic factor, these performance guarantees are minimax optimal in a number of circumstances.","authors_text":"Olga Klopp","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-01T07:52:01Z","title":"Noisy low-rank matrix completion with general sampling distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0108","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:370bc62c5805e1317724250d1054fec53be88372a4cfcd6cddd859eeccea8b99","target":"record","created_at":"2026-05-18T03:00:11Z","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":"da0d854e9d6538628f71b333824ba174b8f39a2d09bfdf15c6977c59fde70ffa","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-01T07:52:01Z","title_canon_sha256":"d4df52d17e451e9f3d2da0fc399288860a0238e60e81fb254fe99e3182b0951e"},"schema_version":"1.0","source":{"id":"1203.0108","kind":"arxiv","version":3}},"canonical_sha256":"4f657a831ae5e55bd12962aeba19d12417f424da4f414ce0f515d71a8c2a0759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f657a831ae5e55bd12962aeba19d12417f424da4f414ce0f515d71a8c2a0759","first_computed_at":"2026-05-18T03:00:11.596653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:11.596653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FI+0a+GPlAUXBLvnc0J0YYF6hpa1exBiqQYzkdXGlZonx3ZR/PkEpd4mVpT9wAIyhFcl1LIdxlc3v105WCuABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:11.597497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0108","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:370bc62c5805e1317724250d1054fec53be88372a4cfcd6cddd859eeccea8b99","sha256:3759c4eb488cc446bf4059abf5091bfca338367aff11166a2cfe3bfee8221c6a"],"state_sha256":"b0c3ff0589bf3809677f17f8572995f85195dd39a1339732d8311be1cb8015eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQLpxwPyXOHpItlw03qf/RpL+H0bSpSYcJ6RKX5nj8An03PX3hQ87sd1ce5gyo5JujEyWyd9uSB2Am5M5tsFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:46:05.970935Z","bundle_sha256":"f3b6aa38def29d2af6ab942f645ca3bb6eb26ede1317b762f9b55e46a1406dab"}}