{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3LGDRX7CYA4L5HYAPRBYSVCUIH","short_pith_number":"pith:3LGDRX7C","canonical_record":{"source":{"id":"1303.0341","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:22:37Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ef0d18d5b479024381f6d1da3b4e1b0b6e9c7efeb88cbb9cecda43e9831981c8","abstract_canon_sha256":"829df465111d9d925c7bfaa53f82a278494cd9cf5336e816e14025dfc74d444d"},"schema_version":"1.0"},"canonical_sha256":"dacc38dfe2c038be9f007c4389545441c4df0b6dfd59ae7c1eec694e821fc0b4","source":{"kind":"arxiv","id":"1303.0341","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0341","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0341v3","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0341","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"3LGDRX7CYA4L","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3LGDRX7CYA4L5HYA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3LGDRX7C","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3LGDRX7CYA4L5HYAPRBYSVCUIH","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0341","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:22:37Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ef0d18d5b479024381f6d1da3b4e1b0b6e9c7efeb88cbb9cecda43e9831981c8","abstract_canon_sha256":"829df465111d9d925c7bfaa53f82a278494cd9cf5336e816e14025dfc74d444d"},"schema_version":"1.0"},"canonical_sha256":"dacc38dfe2c038be9f007c4389545441c4df0b6dfd59ae7c1eec694e821fc0b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.148875Z","signature_b64":"1PcuabSAARUN+fOFP7Wmyf+ah5JJ8TYsqEWkVTseFyT9B3PsYpVWfIr29GExqR1CYBYDUi/BHbwz840CCJzRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dacc38dfe2c038be9f007c4389545441c4df0b6dfd59ae7c1eec694e821fc0b4","last_reissued_at":"2026-05-18T00:45:27.148485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.148485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0341","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:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PCOgHxcABNhP21AKhlBLn2IYLH0yX5kFSr3c3hwNU2aMBuOGi81ef4Omee5cYzA4XKdvlOwUuiEor92PnLEOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:21:46.613039Z"},"content_sha256":"4079ef9a2ffbb8148728b3a614cdbc0e1339e207ea2c976172fdbc32a33d4eb4","schema_version":"1.0","event_id":"sha256:4079ef9a2ffbb8148728b3a614cdbc0e1339e207ea2c976172fdbc32a33d4eb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3LGDRX7CYA4L5HYAPRBYSVCUIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Completion via Max-Norm Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"T. Tony Cai, Wen-Xin Zhou","submitted_at":"2013-03-02T03:22:37Z","abstract_excerpt":"Matrix completion has been well studied under the uniform sampling model and the trace-norm regularized methods perform well both theoretically and numerically in such a setting. However, the uniform sampling model is unrealistic for a range of applications and the standard trace-norm relaxation can behave very poorly when the underlying sampling scheme is non-uniform.\n  In this paper we propose and analyze a max-norm constrained empirical risk minimization method for noisy matrix completion under a general sampling model. The optimal rate of convergence is established under the Frobenius norm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0341","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:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1KYI89Eke9ZVUFhBPMldD8g09sYf2nKe1ht6x60aP9FNn9ATV2ZVJ+eOCOp4QpKnO4bd+csV9KxUooYHnP7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:21:46.613406Z"},"content_sha256":"1894fefd7d3d22d901f6897bc55f80f87f667a7b58c538c21dd79a7369c7fab1","schema_version":"1.0","event_id":"sha256:1894fefd7d3d22d901f6897bc55f80f87f667a7b58c538c21dd79a7369c7fab1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LGDRX7CYA4L5HYAPRBYSVCUIH/bundle.json","state_url":"https://pith.science/pith/3LGDRX7CYA4L5HYAPRBYSVCUIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LGDRX7CYA4L5HYAPRBYSVCUIH/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-02T20:21:46Z","links":{"resolver":"https://pith.science/pith/3LGDRX7CYA4L5HYAPRBYSVCUIH","bundle":"https://pith.science/pith/3LGDRX7CYA4L5HYAPRBYSVCUIH/bundle.json","state":"https://pith.science/pith/3LGDRX7CYA4L5HYAPRBYSVCUIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LGDRX7CYA4L5HYAPRBYSVCUIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3LGDRX7CYA4L5HYAPRBYSVCUIH","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":"829df465111d9d925c7bfaa53f82a278494cd9cf5336e816e14025dfc74d444d","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:22:37Z","title_canon_sha256":"ef0d18d5b479024381f6d1da3b4e1b0b6e9c7efeb88cbb9cecda43e9831981c8"},"schema_version":"1.0","source":{"id":"1303.0341","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0341","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0341v3","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0341","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"3LGDRX7CYA4L","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3LGDRX7CYA4L5HYA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3LGDRX7C","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:1894fefd7d3d22d901f6897bc55f80f87f667a7b58c538c21dd79a7369c7fab1","target":"graph","created_at":"2026-05-18T00:45:27Z","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":"Matrix completion has been well studied under the uniform sampling model and the trace-norm regularized methods perform well both theoretically and numerically in such a setting. However, the uniform sampling model is unrealistic for a range of applications and the standard trace-norm relaxation can behave very poorly when the underlying sampling scheme is non-uniform.\n  In this paper we propose and analyze a max-norm constrained empirical risk minimization method for noisy matrix completion under a general sampling model. The optimal rate of convergence is established under the Frobenius norm","authors_text":"T. Tony Cai, Wen-Xin Zhou","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:22:37Z","title":"Matrix Completion via Max-Norm Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0341","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:4079ef9a2ffbb8148728b3a614cdbc0e1339e207ea2c976172fdbc32a33d4eb4","target":"record","created_at":"2026-05-18T00:45:27Z","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":"829df465111d9d925c7bfaa53f82a278494cd9cf5336e816e14025dfc74d444d","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:22:37Z","title_canon_sha256":"ef0d18d5b479024381f6d1da3b4e1b0b6e9c7efeb88cbb9cecda43e9831981c8"},"schema_version":"1.0","source":{"id":"1303.0341","kind":"arxiv","version":3}},"canonical_sha256":"dacc38dfe2c038be9f007c4389545441c4df0b6dfd59ae7c1eec694e821fc0b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dacc38dfe2c038be9f007c4389545441c4df0b6dfd59ae7c1eec694e821fc0b4","first_computed_at":"2026-05-18T00:45:27.148485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.148485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1PcuabSAARUN+fOFP7Wmyf+ah5JJ8TYsqEWkVTseFyT9B3PsYpVWfIr29GExqR1CYBYDUi/BHbwz840CCJzRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.148875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0341","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4079ef9a2ffbb8148728b3a614cdbc0e1339e207ea2c976172fdbc32a33d4eb4","sha256:1894fefd7d3d22d901f6897bc55f80f87f667a7b58c538c21dd79a7369c7fab1"],"state_sha256":"8272bf7bc87b3b1caa261849cb3e2342a25937248c36505116ccc05120e64a49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Nk89pZr19rNdCh/K98Ks8WKVyTJhJbKgi0Se+9a+cjRo27JKaZfG9OezMEkReTxW7rmMXkjWO6VAOcf8IATCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:21:46.616129Z","bundle_sha256":"8bd3cf78915c7b0a311655ff51ea2c93916b0461f8e65f1061fc6ae6d2815e0e"}}