{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NXIFM4RKMLT2LL5ORNYYR3SCZQ","short_pith_number":"pith:NXIFM4RK","canonical_record":{"source":{"id":"1809.09237","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T22:07:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2660dbc3e1478c486340ede703a94fa5e6e822ab24c544e839c8c2bd249fa1e6","abstract_canon_sha256":"b229d583168319666a2f2bc2cd6c1371bc1d3a88ff22f48248abe6d0a96032e9"},"schema_version":"1.0"},"canonical_sha256":"6dd056722a62e7a5afae8b7188ee42cc115a7fde4931d72d51736458892e5deb","source":{"kind":"arxiv","id":"1809.09237","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09237","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09237v4","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09237","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"NXIFM4RKMLT2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NXIFM4RKMLT2LL5O","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NXIFM4RK","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NXIFM4RKMLT2LL5ORNYYR3SCZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09237","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T22:07:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2660dbc3e1478c486340ede703a94fa5e6e822ab24c544e839c8c2bd249fa1e6","abstract_canon_sha256":"b229d583168319666a2f2bc2cd6c1371bc1d3a88ff22f48248abe6d0a96032e9"},"schema_version":"1.0"},"canonical_sha256":"6dd056722a62e7a5afae8b7188ee42cc115a7fde4931d72d51736458892e5deb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:41.531821Z","signature_b64":"XCXd5qMfA7Poq5B5Rl5NXhBEfjw6BSFgQh0tJxp1RR/TVupWjMMLdxyzFgnOZxCbZaE+yD0CNyD94qkAYDn2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dd056722a62e7a5afae8b7188ee42cc115a7fde4931d72d51736458892e5deb","last_reissued_at":"2026-05-17T23:40:41.531306Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:41.531306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09237","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-17T23:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+amYGXGdEbuBnNK2GJzZ04N4jqtINroSvPSHO//OSr+U3I36NQ9sWESIwif2s1/Y7H4vcI/kKAyX6/nfS3+gDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:33:33.203915Z"},"content_sha256":"c3d523b31fded986ff0ec3397bae25f723e0898203865fea6f62ee9a6dff474f","schema_version":"1.0","event_id":"sha256:c3d523b31fded986ff0ec3397bae25f723e0898203865fea6f62ee9a6dff474f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NXIFM4RKMLT2LL5ORNYYR3SCZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonconvex Robust Low-rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anthony Man-Cho So, Rene Vidal, Xiao Li, Zhihui Zhu","submitted_at":"2018-09-24T22:07:50Z","abstract_excerpt":"In this paper we study the problem of recovering a low-rank matrix from a number of random linear measurements that are corrupted by outliers taking arbitrary values. We consider a nonsmooth nonconvex formulation of the problem, in which we explicitly enforce the low-rank property of the solution by using a factored representation of the matrix variable and employ an $\\ell_1$-loss function to robustify the solution against outliers. We show that even when a constant fraction (which can be up to almost half) of the measurements are arbitrarily corrupted, as long as certain measurement operators"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09237","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-17T23:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3RgVucekNdeck0TIQVmiImW8BV2hVZJiDOuCXgerqLqPa5MzUgBzNdjbfMNMymYOC7lBUf1ACKjpNGErNf0rCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:33:33.204282Z"},"content_sha256":"2e8b33a843f388ff3dfcb0af94ff108f0be2fd599b39e1726420dc15b8f6a14b","schema_version":"1.0","event_id":"sha256:2e8b33a843f388ff3dfcb0af94ff108f0be2fd599b39e1726420dc15b8f6a14b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXIFM4RKMLT2LL5ORNYYR3SCZQ/bundle.json","state_url":"https://pith.science/pith/NXIFM4RKMLT2LL5ORNYYR3SCZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXIFM4RKMLT2LL5ORNYYR3SCZQ/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-28T08:33:33Z","links":{"resolver":"https://pith.science/pith/NXIFM4RKMLT2LL5ORNYYR3SCZQ","bundle":"https://pith.science/pith/NXIFM4RKMLT2LL5ORNYYR3SCZQ/bundle.json","state":"https://pith.science/pith/NXIFM4RKMLT2LL5ORNYYR3SCZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXIFM4RKMLT2LL5ORNYYR3SCZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NXIFM4RKMLT2LL5ORNYYR3SCZQ","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":"b229d583168319666a2f2bc2cd6c1371bc1d3a88ff22f48248abe6d0a96032e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T22:07:50Z","title_canon_sha256":"2660dbc3e1478c486340ede703a94fa5e6e822ab24c544e839c8c2bd249fa1e6"},"schema_version":"1.0","source":{"id":"1809.09237","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09237","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09237v4","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09237","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"NXIFM4RKMLT2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NXIFM4RKMLT2LL5O","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NXIFM4RK","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2e8b33a843f388ff3dfcb0af94ff108f0be2fd599b39e1726420dc15b8f6a14b","target":"graph","created_at":"2026-05-17T23:40:41Z","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 study the problem of recovering a low-rank matrix from a number of random linear measurements that are corrupted by outliers taking arbitrary values. We consider a nonsmooth nonconvex formulation of the problem, in which we explicitly enforce the low-rank property of the solution by using a factored representation of the matrix variable and employ an $\\ell_1$-loss function to robustify the solution against outliers. We show that even when a constant fraction (which can be up to almost half) of the measurements are arbitrarily corrupted, as long as certain measurement operators","authors_text":"Anthony Man-Cho So, Rene Vidal, Xiao Li, Zhihui Zhu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T22:07:50Z","title":"Nonconvex Robust Low-rank Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09237","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:c3d523b31fded986ff0ec3397bae25f723e0898203865fea6f62ee9a6dff474f","target":"record","created_at":"2026-05-17T23:40:41Z","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":"b229d583168319666a2f2bc2cd6c1371bc1d3a88ff22f48248abe6d0a96032e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T22:07:50Z","title_canon_sha256":"2660dbc3e1478c486340ede703a94fa5e6e822ab24c544e839c8c2bd249fa1e6"},"schema_version":"1.0","source":{"id":"1809.09237","kind":"arxiv","version":4}},"canonical_sha256":"6dd056722a62e7a5afae8b7188ee42cc115a7fde4931d72d51736458892e5deb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dd056722a62e7a5afae8b7188ee42cc115a7fde4931d72d51736458892e5deb","first_computed_at":"2026-05-17T23:40:41.531306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:41.531306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XCXd5qMfA7Poq5B5Rl5NXhBEfjw6BSFgQh0tJxp1RR/TVupWjMMLdxyzFgnOZxCbZaE+yD0CNyD94qkAYDn2AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:41.531821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09237","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3d523b31fded986ff0ec3397bae25f723e0898203865fea6f62ee9a6dff474f","sha256:2e8b33a843f388ff3dfcb0af94ff108f0be2fd599b39e1726420dc15b8f6a14b"],"state_sha256":"6b477f4f0ca7c3477810b8c7f8f1bd8b2e6629107cad5548bec6589b00b7c83c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aoo3Vhb7gPPwveflgQVy1kho33+ayYIpOuYJnHU0W5w8DxJQSdV305zU7HuXsLQTGswFDp2dTbQ+w8v6Fu+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:33:33.206269Z","bundle_sha256":"c4d5561a4973613a3919a2c55b7635b4352688fea57ce0cefbaf33e02a44277f"}}