{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ANLAK3GSYG5OW4YWJJLPUJVHZ2","short_pith_number":"pith:ANLAK3GS","canonical_record":{"source":{"id":"1102.3923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-02-18T21:26:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"38cc1d43d8042ad2b3b009b7884f1519f6a3801606aff753e087957999a1207d","abstract_canon_sha256":"0a7efc675c4c6d65da034edb5b4079cb903a536d140092a1b4ee6372662c129d"},"schema_version":"1.0"},"canonical_sha256":"0356056cd2c1baeb73164a56fa26a7ce93f7e10a3213acd1a87d48253cfc5525","source":{"kind":"arxiv","id":"1102.3923","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3923","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3923v2","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3923","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"ANLAK3GSYG5O","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ANLAK3GSYG5OW4YW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ANLAK3GS","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ANLAK3GSYG5OW4YWJJLPUJVHZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-02-18T21:26:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"38cc1d43d8042ad2b3b009b7884f1519f6a3801606aff753e087957999a1207d","abstract_canon_sha256":"0a7efc675c4c6d65da034edb5b4079cb903a536d140092a1b4ee6372662c129d"},"schema_version":"1.0"},"canonical_sha256":"0356056cd2c1baeb73164a56fa26a7ce93f7e10a3213acd1a87d48253cfc5525","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:13.335218Z","signature_b64":"+RfS5Nk9RHbkqXFZjqgNDr3A5/JaIEQlLOtB5htVCYi3sWmdGUk7E5OTPlZ6/FUxyaftZ1OO83Qd9SZGiFS1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0356056cd2c1baeb73164a56fa26a7ce93f7e10a3213acd1a87d48253cfc5525","last_reissued_at":"2026-05-18T04:21:13.334467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:13.334467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3923","source_version":2,"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-18T04:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PH8lILh+5Yg4PFBxJJFc+zh7royxHiPBpBg+O6PJzDLFMHZbTeNmQqHKkcG9QbS72AChOdy47BCtNMuLoCcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:07:55.691722Z"},"content_sha256":"bcbdaa6e9afaf7fd9cc2245ef9bdad56970c34ea0d4b0ac8e5ee98d5037faebc","schema_version":"1.0","event_id":"sha256:bcbdaa6e9afaf7fd9cc2245ef9bdad56970c34ea0d4b0ac8e5ee98d5037faebc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ANLAK3GSYG5OW4YWJJLPUJVHZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Concentration-Based Guarantees for Low-Rank Matrix Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nathan Srebro, Rina Foygel","submitted_at":"2011-02-18T21:26:16Z","abstract_excerpt":"We consider the problem of approximately reconstructing a partially-observed, approximately low-rank matrix. This problem has received much attention lately, mostly using the trace-norm as a surrogate to the rank. Here we study low-rank matrix reconstruction using both the trace-norm, as well as the less-studied max-norm, and present reconstruction guarantees based on existing analysis on the Rademacher complexity of the unit balls of these norms. We show how these are superior in several ways to recently published guarantees based on specialized analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3923","kind":"arxiv","version":2},"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-18T04:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XpxcmhfYHbMKh/KfD7gOx1yU20gy/sbLOfCaVq1GZriBybE5G6bDUiIbq8138/SqCEyr3+OzoLMFGlVt5DX4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:07:55.692062Z"},"content_sha256":"8d781bfbcf675341228473e8b58b6154802f202aaf5e1673b9477c5beae93de0","schema_version":"1.0","event_id":"sha256:8d781bfbcf675341228473e8b58b6154802f202aaf5e1673b9477c5beae93de0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANLAK3GSYG5OW4YWJJLPUJVHZ2/bundle.json","state_url":"https://pith.science/pith/ANLAK3GSYG5OW4YWJJLPUJVHZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANLAK3GSYG5OW4YWJJLPUJVHZ2/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-28T10:07:55Z","links":{"resolver":"https://pith.science/pith/ANLAK3GSYG5OW4YWJJLPUJVHZ2","bundle":"https://pith.science/pith/ANLAK3GSYG5OW4YWJJLPUJVHZ2/bundle.json","state":"https://pith.science/pith/ANLAK3GSYG5OW4YWJJLPUJVHZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANLAK3GSYG5OW4YWJJLPUJVHZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ANLAK3GSYG5OW4YWJJLPUJVHZ2","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":"0a7efc675c4c6d65da034edb5b4079cb903a536d140092a1b4ee6372662c129d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-02-18T21:26:16Z","title_canon_sha256":"38cc1d43d8042ad2b3b009b7884f1519f6a3801606aff753e087957999a1207d"},"schema_version":"1.0","source":{"id":"1102.3923","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3923","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3923v2","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3923","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"ANLAK3GSYG5O","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ANLAK3GSYG5OW4YW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ANLAK3GS","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:8d781bfbcf675341228473e8b58b6154802f202aaf5e1673b9477c5beae93de0","target":"graph","created_at":"2026-05-18T04:21:13Z","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":"We consider the problem of approximately reconstructing a partially-observed, approximately low-rank matrix. This problem has received much attention lately, mostly using the trace-norm as a surrogate to the rank. Here we study low-rank matrix reconstruction using both the trace-norm, as well as the less-studied max-norm, and present reconstruction guarantees based on existing analysis on the Rademacher complexity of the unit balls of these norms. We show how these are superior in several ways to recently published guarantees based on specialized analysis.","authors_text":"Nathan Srebro, Rina Foygel","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-02-18T21:26:16Z","title":"Concentration-Based Guarantees for Low-Rank Matrix Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3923","kind":"arxiv","version":2},"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:bcbdaa6e9afaf7fd9cc2245ef9bdad56970c34ea0d4b0ac8e5ee98d5037faebc","target":"record","created_at":"2026-05-18T04:21:13Z","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":"0a7efc675c4c6d65da034edb5b4079cb903a536d140092a1b4ee6372662c129d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-02-18T21:26:16Z","title_canon_sha256":"38cc1d43d8042ad2b3b009b7884f1519f6a3801606aff753e087957999a1207d"},"schema_version":"1.0","source":{"id":"1102.3923","kind":"arxiv","version":2}},"canonical_sha256":"0356056cd2c1baeb73164a56fa26a7ce93f7e10a3213acd1a87d48253cfc5525","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0356056cd2c1baeb73164a56fa26a7ce93f7e10a3213acd1a87d48253cfc5525","first_computed_at":"2026-05-18T04:21:13.334467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:13.334467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+RfS5Nk9RHbkqXFZjqgNDr3A5/JaIEQlLOtB5htVCYi3sWmdGUk7E5OTPlZ6/FUxyaftZ1OO83Qd9SZGiFS1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:13.335218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3923","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcbdaa6e9afaf7fd9cc2245ef9bdad56970c34ea0d4b0ac8e5ee98d5037faebc","sha256:8d781bfbcf675341228473e8b58b6154802f202aaf5e1673b9477c5beae93de0"],"state_sha256":"902e0bcf77f2ea0236dd344f760bb9c6882f7b32309228aa1c05a296c0aec57e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNed6mUgo8BHNps8ySunTIesBibh5Bc+lOXPcgtCzJxSzDK+NsZWps8tplfiIe5UgxqMQL5DNwXyRK8gpJSJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:07:55.693968Z","bundle_sha256":"d2031612d9ffcf674a7afde16ccda9020a8a52e6cbb00b69b5f4c7e2a93c4091"}}