{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UGNQOH5SSNDTBS73IY6Z5S7VOY","short_pith_number":"pith:UGNQOH5S","canonical_record":{"source":{"id":"1503.00214","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-01T04:24:42Z","cross_cats_sorted":[],"title_canon_sha256":"ca7ef9e146d554ea97a325fe1249c24f2ba7d3ec29e3726afcfa43d68121dbfc","abstract_canon_sha256":"8cae39b0dd45df38a808df8abf0e1e3398162bb2ce299b4757f7c479f9e9d52e"},"schema_version":"1.0"},"canonical_sha256":"a19b071fb2934730cbfb463d9ecbf57632788560e88fb24c3ab6930479b94380","source":{"kind":"arxiv","id":"1503.00214","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00214","created_at":"2026-05-18T00:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00214v3","created_at":"2026-05-18T00:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00214","created_at":"2026-05-18T00:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"UGNQOH5SSNDT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UGNQOH5SSNDTBS73","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UGNQOH5S","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UGNQOH5SSNDTBS73IY6Z5S7VOY","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00214","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-01T04:24:42Z","cross_cats_sorted":[],"title_canon_sha256":"ca7ef9e146d554ea97a325fe1249c24f2ba7d3ec29e3726afcfa43d68121dbfc","abstract_canon_sha256":"8cae39b0dd45df38a808df8abf0e1e3398162bb2ce299b4757f7c479f9e9d52e"},"schema_version":"1.0"},"canonical_sha256":"a19b071fb2934730cbfb463d9ecbf57632788560e88fb24c3ab6930479b94380","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:10.268905Z","signature_b64":"ZJwoC1TbZ4IDksD9mPvVmzctj7A+sXYupSHviGel9FELS5TYO1DoswZxJEIVpbZTrtvw5t6Z17rCbtdUhcXmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a19b071fb2934730cbfb463d9ecbf57632788560e88fb24c3ab6930479b94380","last_reissued_at":"2026-05-18T00:27:10.268347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:10.268347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00214","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-18T00:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfNAiNOaf4u676EUhJ14HKgzI4FiX+OZO4lx5smskm9v+vHrPjAfNiaPg4WlOUgyn1mk3f5DRK2jGe+X6/5sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:08:37.446784Z"},"content_sha256":"b7e6310528da2abcfe3875d8c6cc9c47d64ad6f33dea80737a26a55823aacb71","schema_version":"1.0","event_id":"sha256:b7e6310528da2abcfe3875d8c6cc9c47d64ad6f33dea80737a26a55823aacb71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UGNQOH5SSNDTBS73IY6Z5S7VOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Completion with Noisy Entries and Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Raymond K. W. Wong, Thomas C. M. Lee","submitted_at":"2015-03-01T04:24:42Z","abstract_excerpt":"This paper considers the problem of matrix completion when the observed entries are noisy and contain outliers. It begins with introducing a new optimization criterion for which the recovered matrix is defined as its solution. This criterion uses the celebrated Huber function from the robust statistics literature to downweigh the effects of outliers. A practical algorithm is developed to solve the optimization involved. This algorithm is fast, straightforward to implement, and monotonic convergent. Furthermore, the proposed methodology is theoretically shown to be stable in a well defined sens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00214","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-18T00:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGfdK2QXtX2/sYILSCdvko66DL+P5zc9qpefZTnsIJ9kxLKjTssk8CqDjz3+bNabQhuOdSeegboikxDnMzYrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:08:37.447517Z"},"content_sha256":"782b46517dde6ebb53aae551808527ea4df8e0c5cd6b1cc5ed065a92ac377e6a","schema_version":"1.0","event_id":"sha256:782b46517dde6ebb53aae551808527ea4df8e0c5cd6b1cc5ed065a92ac377e6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGNQOH5SSNDTBS73IY6Z5S7VOY/bundle.json","state_url":"https://pith.science/pith/UGNQOH5SSNDTBS73IY6Z5S7VOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGNQOH5SSNDTBS73IY6Z5S7VOY/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-08T18:08:37Z","links":{"resolver":"https://pith.science/pith/UGNQOH5SSNDTBS73IY6Z5S7VOY","bundle":"https://pith.science/pith/UGNQOH5SSNDTBS73IY6Z5S7VOY/bundle.json","state":"https://pith.science/pith/UGNQOH5SSNDTBS73IY6Z5S7VOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGNQOH5SSNDTBS73IY6Z5S7VOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UGNQOH5SSNDTBS73IY6Z5S7VOY","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":"8cae39b0dd45df38a808df8abf0e1e3398162bb2ce299b4757f7c479f9e9d52e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-01T04:24:42Z","title_canon_sha256":"ca7ef9e146d554ea97a325fe1249c24f2ba7d3ec29e3726afcfa43d68121dbfc"},"schema_version":"1.0","source":{"id":"1503.00214","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00214","created_at":"2026-05-18T00:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00214v3","created_at":"2026-05-18T00:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00214","created_at":"2026-05-18T00:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"UGNQOH5SSNDT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UGNQOH5SSNDTBS73","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UGNQOH5S","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:782b46517dde6ebb53aae551808527ea4df8e0c5cd6b1cc5ed065a92ac377e6a","target":"graph","created_at":"2026-05-18T00:27:10Z","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":"This paper considers the problem of matrix completion when the observed entries are noisy and contain outliers. It begins with introducing a new optimization criterion for which the recovered matrix is defined as its solution. This criterion uses the celebrated Huber function from the robust statistics literature to downweigh the effects of outliers. A practical algorithm is developed to solve the optimization involved. This algorithm is fast, straightforward to implement, and monotonic convergent. Furthermore, the proposed methodology is theoretically shown to be stable in a well defined sens","authors_text":"Raymond K. W. Wong, Thomas C. M. Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-01T04:24:42Z","title":"Matrix Completion with Noisy Entries and Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00214","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:b7e6310528da2abcfe3875d8c6cc9c47d64ad6f33dea80737a26a55823aacb71","target":"record","created_at":"2026-05-18T00:27:10Z","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":"8cae39b0dd45df38a808df8abf0e1e3398162bb2ce299b4757f7c479f9e9d52e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-01T04:24:42Z","title_canon_sha256":"ca7ef9e146d554ea97a325fe1249c24f2ba7d3ec29e3726afcfa43d68121dbfc"},"schema_version":"1.0","source":{"id":"1503.00214","kind":"arxiv","version":3}},"canonical_sha256":"a19b071fb2934730cbfb463d9ecbf57632788560e88fb24c3ab6930479b94380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a19b071fb2934730cbfb463d9ecbf57632788560e88fb24c3ab6930479b94380","first_computed_at":"2026-05-18T00:27:10.268347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:10.268347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZJwoC1TbZ4IDksD9mPvVmzctj7A+sXYupSHviGel9FELS5TYO1DoswZxJEIVpbZTrtvw5t6Z17rCbtdUhcXmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:10.268905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00214","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7e6310528da2abcfe3875d8c6cc9c47d64ad6f33dea80737a26a55823aacb71","sha256:782b46517dde6ebb53aae551808527ea4df8e0c5cd6b1cc5ed065a92ac377e6a"],"state_sha256":"f7b1a6ac07f5261e8d51934e446973d38b17d297b6061aa65327817a98a63e1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ku+3slglen6EvHvhM8n4yLz2CbBpijgYFhBISVMZk78zJmBFttFq74Zun/4jfukbUCWeWVmSk/htdTj8xnyGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:08:37.451825Z","bundle_sha256":"28913c627fb7b284fc6c79ea75f85cb5dd72fb94d5540e72068b5b1e89ab1599"}}