{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HDNI32OSNWWIVA22S7WOUCSDIC","short_pith_number":"pith:HDNI32OS","schema_version":"1.0","canonical_sha256":"38da8de9d26dac8a835a97ecea0a434096ebdfc60d3d14f1e75f3ec48dd32b3f","source":{"kind":"arxiv","id":"1609.07664","version":1},"attestation_state":"computed","paper":{"title":"Max-Norm Optimization for Robust Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Ethan X. Fang, Han Liu, Kim-Chuan Toh, Wen-Xin Zhou","submitted_at":"2016-09-24T19:46:58Z","abstract_excerpt":"This paper studies the matrix completion problem under arbitrary sampling schemes. We propose a new estimator incorporating both max-norm and nuclear-norm regularization, based on which we can conduct efficient low-rank matrix recovery using a random subset of entries observed with additive noise under general non-uniform and unknown sampling distributions. This method significantly relaxes the uniform sampling assumption imposed for the widely used nuclear-norm penalized approach, and makes low-rank matrix recovery feasible in more practical settings. Theoretically, we prove that the proposed"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1609.07664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-24T19:46:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fb320665225ae70d1b0dc534841580424a964e90cad880b3dd03a3c4434277a9","abstract_canon_sha256":"dfad4a53f0c9d65bf00e89d80e78a17a5b676738fc6367bcfc68df6f3645ca73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:55.792479Z","signature_b64":"mfAfyFyE8TBCZPaziAH9PkYphdxX38gOQHN0lIiavBYbo8xBBM1aPZRbhBuHDDdLu9DZ9efLjhJmOEs3mcgKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38da8de9d26dac8a835a97ecea0a434096ebdfc60d3d14f1e75f3ec48dd32b3f","last_reissued_at":"2026-05-18T01:03:55.791813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:55.791813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max-Norm Optimization for Robust Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Ethan X. Fang, Han Liu, Kim-Chuan Toh, Wen-Xin Zhou","submitted_at":"2016-09-24T19:46:58Z","abstract_excerpt":"This paper studies the matrix completion problem under arbitrary sampling schemes. We propose a new estimator incorporating both max-norm and nuclear-norm regularization, based on which we can conduct efficient low-rank matrix recovery using a random subset of entries observed with additive noise under general non-uniform and unknown sampling distributions. This method significantly relaxes the uniform sampling assumption imposed for the widely used nuclear-norm penalized approach, and makes low-rank matrix recovery feasible in more practical settings. Theoretically, we prove that the proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07664","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.07664","created_at":"2026-05-18T01:03:55.791906+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07664v1","created_at":"2026-05-18T01:03:55.791906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07664","created_at":"2026-05-18T01:03:55.791906+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDNI32OSNWWI","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDNI32OSNWWIVA22","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDNI32OS","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC","json":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC.json","graph_json":"https://pith.science/api/pith-number/HDNI32OSNWWIVA22S7WOUCSDIC/graph.json","events_json":"https://pith.science/api/pith-number/HDNI32OSNWWIVA22S7WOUCSDIC/events.json","paper":"https://pith.science/paper/HDNI32OS"},"agent_actions":{"view_html":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC","download_json":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC.json","view_paper":"https://pith.science/paper/HDNI32OS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07664&json=true","fetch_graph":"https://pith.science/api/pith-number/HDNI32OSNWWIVA22S7WOUCSDIC/graph.json","fetch_events":"https://pith.science/api/pith-number/HDNI32OSNWWIVA22S7WOUCSDIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/action/storage_attestation","attest_author":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/action/author_attestation","sign_citation":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/action/citation_signature","submit_replication":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/action/replication_record"}},"created_at":"2026-05-18T01:03:55.791906+00:00","updated_at":"2026-05-18T01:03:55.791906+00:00"}