{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HDNI32OSNWWIVA22S7WOUCSDIC","short_pith_number":"pith:HDNI32OS","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"},"canonical_sha256":"38da8de9d26dac8a835a97ecea0a434096ebdfc60d3d14f1e75f3ec48dd32b3f","source":{"kind":"arxiv","id":"1609.07664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07664","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07664v1","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07664","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"HDNI32OSNWWI","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HDNI32OSNWWIVA22","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HDNI32OS","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HDNI32OSNWWIVA22S7WOUCSDIC","target":"record","payload":{"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"},"canonical_sha256":"38da8de9d26dac8a835a97ecea0a434096ebdfc60d3d14f1e75f3ec48dd32b3f","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"},"source_kind":"arxiv","source_id":"1609.07664","source_version":1,"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-18T01:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kYX1FiqW3yvXzx1LB3ifg2RhGfj/TXOA/40k+tlzYHqheM9boPSaKZyZ6xWiQnSPDppb2mcSjWz0J/mPf0oCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T01:27:21.390782Z"},"content_sha256":"3704833fd5984e9a1337aa99c099196719d0f8cc68121e0d2c345b75aac2ee65","schema_version":"1.0","event_id":"sha256:3704833fd5984e9a1337aa99c099196719d0f8cc68121e0d2c345b75aac2ee65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HDNI32OSNWWIVA22S7WOUCSDIC","target":"graph","payload":{"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"},"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-18T01:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nR29Ylwc/9J2eGeRfJ0AmX04U7shgsphmleykyPU17NIqk6l0YX5agu6b3sjifwP9InNM3VOevcz2GXFCgvBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T01:27:21.391553Z"},"content_sha256":"23865a97dbf6981d23401993807eaae573fb929f5e496b7305e3751cc77860ab","schema_version":"1.0","event_id":"sha256:23865a97dbf6981d23401993807eaae573fb929f5e496b7305e3751cc77860ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/bundle.json","state_url":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDNI32OSNWWIVA22S7WOUCSDIC/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-06T01:27:21Z","links":{"resolver":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC","bundle":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/bundle.json","state":"https://pith.science/pith/HDNI32OSNWWIVA22S7WOUCSDIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDNI32OSNWWIVA22S7WOUCSDIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HDNI32OSNWWIVA22S7WOUCSDIC","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":"dfad4a53f0c9d65bf00e89d80e78a17a5b676738fc6367bcfc68df6f3645ca73","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-24T19:46:58Z","title_canon_sha256":"fb320665225ae70d1b0dc534841580424a964e90cad880b3dd03a3c4434277a9"},"schema_version":"1.0","source":{"id":"1609.07664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07664","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07664v1","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07664","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"HDNI32OSNWWI","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HDNI32OSNWWIVA22","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HDNI32OS","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:23865a97dbf6981d23401993807eaae573fb929f5e496b7305e3751cc77860ab","target":"graph","created_at":"2026-05-18T01:03:55Z","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 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","authors_text":"Ethan X. Fang, Han Liu, Kim-Chuan Toh, Wen-Xin Zhou","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-24T19:46:58Z","title":"Max-Norm Optimization for Robust Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07664","kind":"arxiv","version":1},"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:3704833fd5984e9a1337aa99c099196719d0f8cc68121e0d2c345b75aac2ee65","target":"record","created_at":"2026-05-18T01:03:55Z","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":"dfad4a53f0c9d65bf00e89d80e78a17a5b676738fc6367bcfc68df6f3645ca73","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-24T19:46:58Z","title_canon_sha256":"fb320665225ae70d1b0dc534841580424a964e90cad880b3dd03a3c4434277a9"},"schema_version":"1.0","source":{"id":"1609.07664","kind":"arxiv","version":1}},"canonical_sha256":"38da8de9d26dac8a835a97ecea0a434096ebdfc60d3d14f1e75f3ec48dd32b3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38da8de9d26dac8a835a97ecea0a434096ebdfc60d3d14f1e75f3ec48dd32b3f","first_computed_at":"2026-05-18T01:03:55.791813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:55.791813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mfAfyFyE8TBCZPaziAH9PkYphdxX38gOQHN0lIiavBYbo8xBBM1aPZRbhBuHDDdLu9DZ9efLjhJmOEs3mcgKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:55.792479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3704833fd5984e9a1337aa99c099196719d0f8cc68121e0d2c345b75aac2ee65","sha256:23865a97dbf6981d23401993807eaae573fb929f5e496b7305e3751cc77860ab"],"state_sha256":"30985bebd0a43279766baaab324c62b0371c4c0a60ad6a1999fa7af6b0f31ef8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuRMcn+C/MAp1Fz4ck7M4hXim4lwlEnajWs9U6ZJFnC+uqyHVGWt6Ps4Il7gqQRtb6DoXEj8+1s4MMZHgZo5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T01:27:21.398856Z","bundle_sha256":"d8cca297d5aec59c9528913162f1694bc114a045aea9fadc908ed527db77008e"}}