{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3KHF6HMCGZMEPR3A2YWSZSLRNK","short_pith_number":"pith:3KHF6HMC","canonical_record":{"source":{"id":"1306.2979","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-12T21:26:00Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"0baaacc19275b862cd72cc18cdb68de2869543dec15b7817af9efc9d52e85490","abstract_canon_sha256":"798af1b4b1b51dcdbb1f43c1b70c9102d1abd512ec900992c87f1584d8c18a49"},"schema_version":"1.0"},"canonical_sha256":"da8e5f1d82365847c760d62d2cc9716a8fa026fe13d09dd72d03d12662c7b15d","source":{"kind":"arxiv","id":"1306.2979","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2979","created_at":"2026-05-18T02:47:16Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2979v4","created_at":"2026-05-18T02:47:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2979","created_at":"2026-05-18T02:47:16Z"},{"alias_kind":"pith_short_12","alias_value":"3KHF6HMCGZME","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3KHF6HMCGZMEPR3A","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3KHF6HMC","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3KHF6HMCGZMEPR3A2YWSZSLRNK","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2979","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-12T21:26:00Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"0baaacc19275b862cd72cc18cdb68de2869543dec15b7817af9efc9d52e85490","abstract_canon_sha256":"798af1b4b1b51dcdbb1f43c1b70c9102d1abd512ec900992c87f1584d8c18a49"},"schema_version":"1.0"},"canonical_sha256":"da8e5f1d82365847c760d62d2cc9716a8fa026fe13d09dd72d03d12662c7b15d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:16.110288Z","signature_b64":"WtpLxl7Fq163BWXvBYIY9h/V9J8Ms4Q/xl7BcRotp64ir8kRm9kR08B+5IKO8BF4LwXZ75o+z+3C74huAlbHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da8e5f1d82365847c760d62d2cc9716a8fa026fe13d09dd72d03d12662c7b15d","last_reissued_at":"2026-05-18T02:47:16.109738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:16.109738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2979","source_version":4,"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-18T02:47:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDy8b/rAsLX2S9wRG/SVKe4auvtTRgVJ1y4RueLlBW6f19Z8Mu1nblmqi/jxdN9JgMFwAVbwpm5JjLFLGqTcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:21:49.380949Z"},"content_sha256":"a8797f6a17e4e3cd55015e19617a31852ae1bb68cafe7648194a7a7cc286c205","schema_version":"1.0","event_id":"sha256:a8797f6a17e4e3cd55015e19617a31852ae1bb68cafe7648194a7a7cc286c205"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3KHF6HMCGZMEPR3A2YWSZSLRNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completing Any Low-rank Matrix, Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Rachel Ward, Srinadh Bhojanapalli, Sujay Sanghavi, Yudong Chen","submitted_at":"2013-06-12T21:26:00Z","abstract_excerpt":"Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\\em incoherence}---on its row and column spaces. In these cases, the subset of elements is sampled uniformly at random.\n  In this paper, we show that {\\em any} rank-$ r $ $ n$-by-$ n $ matrix can be exactly recovered from as few as $O(nr \\log^2 n)$ randomly chosen elements, provided this random choice is made according to a {\\em specific biased distribution}: the probabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2979","kind":"arxiv","version":4},"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-18T02:47:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOd28b5qIwMFQ2HNbIV9O8SwvOMG7wbma1+vi7ZbkbZVx7uLfjJx011tQP44KO7V1RPKw/GDVYurvTOru4ggDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:21:49.381610Z"},"content_sha256":"a60e037dda3e7d90cbbb443a302e3baaaa840808d7d3daae1554abbfa641fd62","schema_version":"1.0","event_id":"sha256:a60e037dda3e7d90cbbb443a302e3baaaa840808d7d3daae1554abbfa641fd62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/bundle.json","state_url":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/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-25T10:21:49Z","links":{"resolver":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK","bundle":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/bundle.json","state":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3KHF6HMCGZMEPR3A2YWSZSLRNK","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":"798af1b4b1b51dcdbb1f43c1b70c9102d1abd512ec900992c87f1584d8c18a49","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-12T21:26:00Z","title_canon_sha256":"0baaacc19275b862cd72cc18cdb68de2869543dec15b7817af9efc9d52e85490"},"schema_version":"1.0","source":{"id":"1306.2979","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2979","created_at":"2026-05-18T02:47:16Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2979v4","created_at":"2026-05-18T02:47:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2979","created_at":"2026-05-18T02:47:16Z"},{"alias_kind":"pith_short_12","alias_value":"3KHF6HMCGZME","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3KHF6HMCGZMEPR3A","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3KHF6HMC","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:a60e037dda3e7d90cbbb443a302e3baaaa840808d7d3daae1554abbfa641fd62","target":"graph","created_at":"2026-05-18T02:47:16Z","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, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\\em incoherence}---on its row and column spaces. In these cases, the subset of elements is sampled uniformly at random.\n  In this paper, we show that {\\em any} rank-$ r $ $ n$-by-$ n $ matrix can be exactly recovered from as few as $O(nr \\log^2 n)$ randomly chosen elements, provided this random choice is made according to a {\\em specific biased distribution}: the probabil","authors_text":"Rachel Ward, Srinadh Bhojanapalli, Sujay Sanghavi, Yudong Chen","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-12T21:26:00Z","title":"Completing Any Low-rank Matrix, Provably"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2979","kind":"arxiv","version":4},"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:a8797f6a17e4e3cd55015e19617a31852ae1bb68cafe7648194a7a7cc286c205","target":"record","created_at":"2026-05-18T02:47:16Z","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":"798af1b4b1b51dcdbb1f43c1b70c9102d1abd512ec900992c87f1584d8c18a49","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-12T21:26:00Z","title_canon_sha256":"0baaacc19275b862cd72cc18cdb68de2869543dec15b7817af9efc9d52e85490"},"schema_version":"1.0","source":{"id":"1306.2979","kind":"arxiv","version":4}},"canonical_sha256":"da8e5f1d82365847c760d62d2cc9716a8fa026fe13d09dd72d03d12662c7b15d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da8e5f1d82365847c760d62d2cc9716a8fa026fe13d09dd72d03d12662c7b15d","first_computed_at":"2026-05-18T02:47:16.109738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:16.109738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WtpLxl7Fq163BWXvBYIY9h/V9J8Ms4Q/xl7BcRotp64ir8kRm9kR08B+5IKO8BF4LwXZ75o+z+3C74huAlbHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:16.110288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2979","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8797f6a17e4e3cd55015e19617a31852ae1bb68cafe7648194a7a7cc286c205","sha256:a60e037dda3e7d90cbbb443a302e3baaaa840808d7d3daae1554abbfa641fd62"],"state_sha256":"9fdaa0ec3b0e73d2f48d7cb802a2a99797b28dc6e63faa4e5520a990f014c47d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gN8wicZN4SqQitKMRfLv2j2KRjaAJTMGxqBnbQQXYCEyCURgeydD5+Z8aBT/54d205Ji9BcUgiv5Djq/0lAHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:21:49.384938Z","bundle_sha256":"741ee3fd3c7c99d7d78ff015ccac683685ab543add174ed24908daaea1b30505"}}