{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7Z5NN2CYAMJ65NI435TVKHZ7KU","short_pith_number":"pith:7Z5NN2CY","canonical_record":{"source":{"id":"1503.06379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-22T03:27:15Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"e8437a5db7e28a89efb50885f3fda3f4f8c0baf6f0a6bbefcb98a84b95bb8755","abstract_canon_sha256":"9299cd98d4f7304a9014d1be0b558619015450569894205a2e3004e54b128817"},"schema_version":"1.0"},"canonical_sha256":"fe7ad6e8580313eeb51cdf67551f3f55158f93c048b720885e473a8be1bbae9f","source":{"kind":"arxiv","id":"1503.06379","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06379","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06379v3","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06379","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"7Z5NN2CYAMJ6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7Z5NN2CYAMJ65NI4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7Z5NN2CY","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7Z5NN2CYAMJ65NI435TVKHZ7KU","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-22T03:27:15Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"e8437a5db7e28a89efb50885f3fda3f4f8c0baf6f0a6bbefcb98a84b95bb8755","abstract_canon_sha256":"9299cd98d4f7304a9014d1be0b558619015450569894205a2e3004e54b128817"},"schema_version":"1.0"},"canonical_sha256":"fe7ad6e8580313eeb51cdf67551f3f55158f93c048b720885e473a8be1bbae9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:33.195720Z","signature_b64":"ZQ8S/cNWatBp/jvJ6+Va8GnKVVyoFZ5tLrcpDSDYWBnLoB1DoLqzn4V0irzD2KHs3920nIQbUxup7evpXry8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe7ad6e8580313eeb51cdf67551f3f55158f93c048b720885e473a8be1bbae9f","last_reissued_at":"2026-05-18T01:17:33.195008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:33.195008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06379","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-18T01:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAgbWfDywPvk/CiXjTbOHY0w90710DoZ+2hHZy4b1+SphJahbx/5JqxkJcHQK1gOMTFXA8vqEVm9T8KE4+0kBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:36:43.332354Z"},"content_sha256":"3dd095499fef554eb59150eb86bf89e3618519056f627a536ab58fba3ef76b53","schema_version":"1.0","event_id":"sha256:3dd095499fef554eb59150eb86bf89e3618519056f627a536ab58fba3ef76b53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7Z5NN2CYAMJ65NI435TVKHZ7KU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaxed Leverage Sampling for Low-rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Abhisek Kundu","submitted_at":"2015-03-22T03:27:15Z","abstract_excerpt":"We consider the problem of exact recovery of any $m\\times n$ matrix of rank $\\varrho$ from a small number of observed entries via the standard nuclear norm minimization framework. Such low-rank matrices have degrees of freedom $(m+n)\\varrho - \\varrho^2$. We show that any arbitrary low-rank matrices can be recovered exactly from a $\\Theta\\left(((m+n)\\varrho - \\varrho^2)\\log^2(m+n)\\right)$ randomly sampled entries, thus matching the lower bound on the required number of entries (in terms of degrees of freedom), with an additional factor of $O(\\log^2(m+n))$. To achieve this bound on sample size w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06379","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-18T01:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B0NQ5khlm7dP/LoRKSUqJJTGyn1Xi0ZuAx6tJETgo2IVEJMSeU6uc9A0lKTCl0CO8+/S2ry4CC/AlJLQGQlIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:36:43.333028Z"},"content_sha256":"05077debe57d2ee5b6f774a74288587454d55f59f9d8fe3211b93302f9132e64","schema_version":"1.0","event_id":"sha256:05077debe57d2ee5b6f774a74288587454d55f59f9d8fe3211b93302f9132e64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/bundle.json","state_url":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/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-09T10:36:43Z","links":{"resolver":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU","bundle":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/bundle.json","state":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7Z5NN2CYAMJ65NI435TVKHZ7KU","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":"9299cd98d4f7304a9014d1be0b558619015450569894205a2e3004e54b128817","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-22T03:27:15Z","title_canon_sha256":"e8437a5db7e28a89efb50885f3fda3f4f8c0baf6f0a6bbefcb98a84b95bb8755"},"schema_version":"1.0","source":{"id":"1503.06379","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06379","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06379v3","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06379","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"7Z5NN2CYAMJ6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7Z5NN2CYAMJ65NI4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7Z5NN2CY","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:05077debe57d2ee5b6f774a74288587454d55f59f9d8fe3211b93302f9132e64","target":"graph","created_at":"2026-05-18T01:17:33Z","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 exact recovery of any $m\\times n$ matrix of rank $\\varrho$ from a small number of observed entries via the standard nuclear norm minimization framework. Such low-rank matrices have degrees of freedom $(m+n)\\varrho - \\varrho^2$. We show that any arbitrary low-rank matrices can be recovered exactly from a $\\Theta\\left(((m+n)\\varrho - \\varrho^2)\\log^2(m+n)\\right)$ randomly sampled entries, thus matching the lower bound on the required number of entries (in terms of degrees of freedom), with an additional factor of $O(\\log^2(m+n))$. To achieve this bound on sample size w","authors_text":"Abhisek Kundu","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-22T03:27:15Z","title":"Relaxed Leverage Sampling for Low-rank Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06379","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:3dd095499fef554eb59150eb86bf89e3618519056f627a536ab58fba3ef76b53","target":"record","created_at":"2026-05-18T01:17:33Z","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":"9299cd98d4f7304a9014d1be0b558619015450569894205a2e3004e54b128817","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-22T03:27:15Z","title_canon_sha256":"e8437a5db7e28a89efb50885f3fda3f4f8c0baf6f0a6bbefcb98a84b95bb8755"},"schema_version":"1.0","source":{"id":"1503.06379","kind":"arxiv","version":3}},"canonical_sha256":"fe7ad6e8580313eeb51cdf67551f3f55158f93c048b720885e473a8be1bbae9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe7ad6e8580313eeb51cdf67551f3f55158f93c048b720885e473a8be1bbae9f","first_computed_at":"2026-05-18T01:17:33.195008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:33.195008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQ8S/cNWatBp/jvJ6+Va8GnKVVyoFZ5tLrcpDSDYWBnLoB1DoLqzn4V0irzD2KHs3920nIQbUxup7evpXry8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:33.195720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06379","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dd095499fef554eb59150eb86bf89e3618519056f627a536ab58fba3ef76b53","sha256:05077debe57d2ee5b6f774a74288587454d55f59f9d8fe3211b93302f9132e64"],"state_sha256":"4b117af15f03ede6de49124a4134189bb1b05358ab88b82336b1d45d3f664149"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfyvhXg/EC8lytFPiPIjmsflDwLAMLqEndBranKnhDH+92QXH4v/YnMLSp9bo3tu7uiMHODEUh6HaOPuR2WYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:36:43.337096Z","bundle_sha256":"345bdc3f5d99ff1a6e61cf8e7cd2a25a2548365e9cdf28e7a1136fcea4d47548"}}