{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IOKLJXPRZOZRSXYQIF5HWZF2B4","short_pith_number":"pith:IOKLJXPR","canonical_record":{"source":{"id":"1411.8003","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-28T20:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"eadbb3ebcb536ff7a1583ce3c6011ae451d71878e59c6943a30c54a1c1051bdf","abstract_canon_sha256":"7431cca5d0119717e1b51ae3ce739fbd6222a56ba37a411de894f920c6a5f3f4"},"schema_version":"1.0"},"canonical_sha256":"4394b4ddf1cbb3195f10417a7b64ba0f0c2702a1ebc5bfd2595c7cca11d722fb","source":{"kind":"arxiv","id":"1411.8003","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.8003","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.8003v3","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.8003","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"IOKLJXPRZOZR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IOKLJXPRZOZRSXYQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IOKLJXPR","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IOKLJXPRZOZRSXYQIF5HWZF2B4","target":"record","payload":{"canonical_record":{"source":{"id":"1411.8003","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-28T20:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"eadbb3ebcb536ff7a1583ce3c6011ae451d71878e59c6943a30c54a1c1051bdf","abstract_canon_sha256":"7431cca5d0119717e1b51ae3ce739fbd6222a56ba37a411de894f920c6a5f3f4"},"schema_version":"1.0"},"canonical_sha256":"4394b4ddf1cbb3195f10417a7b64ba0f0c2702a1ebc5bfd2595c7cca11d722fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.289500Z","signature_b64":"YRPfxCm4Et49FPGnyM+CjX3K0M/XYaQvbYjnUBuM9eDiKCue0fRUR/cSNYDibcyNaY7MFv2wVYsT5GgJNOKjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4394b4ddf1cbb3195f10417a7b64ba0f0c2702a1ebc5bfd2595c7cca11d722fb","last_reissued_at":"2026-05-18T00:57:51.289013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.289013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.8003","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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILU6aCIX/20kjBiimzbl64n9sTtLnapiKHSxow9xvlPcE9vowIGt6dzsJXNrmM6UJXMdyc7aCIIZMyChkkMLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:27:48.406748Z"},"content_sha256":"c0a7ae2b1506d7cc075f047e6aecb9e21565966720f6d6e7a75211c961cafbb2","schema_version":"1.0","event_id":"sha256:c0a7ae2b1506d7cc075f047e6aecb9e21565966720f6d6e7a75211c961cafbb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IOKLJXPRZOZRSXYQIF5HWZF2B4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guaranteed Matrix Completion via Non-convex Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ruoyu Sun, Zhi-Quan Luo","submitted_at":"2014-11-28T20:52:47Z","abstract_excerpt":"Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity caused by the factorization model, there is a limited theoretical understanding of this formulation. In this paper, we establish a theoretical guarantee for the factorization formulation to correctly recover the underlying low-rank matrix. In particular, we show that under similar conditions to those in previous works, many standard optimization algorithms con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.8003","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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFdcEKUHtxI9vdJ2OyIuS48y6UIOtXCdbW0ix/2p3HegWm2JjDr7CzKDYt7PEPfQ+ejhpILgY9xJdafSMjODAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:27:48.407095Z"},"content_sha256":"9bad99ed9bcf1c71b4d7f96c9a628c44b5cf514913b3ea426aeefbbaf9fe3f2e","schema_version":"1.0","event_id":"sha256:9bad99ed9bcf1c71b4d7f96c9a628c44b5cf514913b3ea426aeefbbaf9fe3f2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/bundle.json","state_url":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/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-30T06:27:48Z","links":{"resolver":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4","bundle":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/bundle.json","state":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IOKLJXPRZOZRSXYQIF5HWZF2B4","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":"7431cca5d0119717e1b51ae3ce739fbd6222a56ba37a411de894f920c6a5f3f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-28T20:52:47Z","title_canon_sha256":"eadbb3ebcb536ff7a1583ce3c6011ae451d71878e59c6943a30c54a1c1051bdf"},"schema_version":"1.0","source":{"id":"1411.8003","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.8003","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.8003v3","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.8003","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"IOKLJXPRZOZR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IOKLJXPRZOZRSXYQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IOKLJXPR","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:9bad99ed9bcf1c71b4d7f96c9a628c44b5cf514913b3ea426aeefbbaf9fe3f2e","target":"graph","created_at":"2026-05-18T00:57:51Z","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 factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity caused by the factorization model, there is a limited theoretical understanding of this formulation. In this paper, we establish a theoretical guarantee for the factorization formulation to correctly recover the underlying low-rank matrix. In particular, we show that under similar conditions to those in previous works, many standard optimization algorithms con","authors_text":"Ruoyu Sun, Zhi-Quan Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-28T20:52:47Z","title":"Guaranteed Matrix Completion via Non-convex Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.8003","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:c0a7ae2b1506d7cc075f047e6aecb9e21565966720f6d6e7a75211c961cafbb2","target":"record","created_at":"2026-05-18T00:57:51Z","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":"7431cca5d0119717e1b51ae3ce739fbd6222a56ba37a411de894f920c6a5f3f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-28T20:52:47Z","title_canon_sha256":"eadbb3ebcb536ff7a1583ce3c6011ae451d71878e59c6943a30c54a1c1051bdf"},"schema_version":"1.0","source":{"id":"1411.8003","kind":"arxiv","version":3}},"canonical_sha256":"4394b4ddf1cbb3195f10417a7b64ba0f0c2702a1ebc5bfd2595c7cca11d722fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4394b4ddf1cbb3195f10417a7b64ba0f0c2702a1ebc5bfd2595c7cca11d722fb","first_computed_at":"2026-05-18T00:57:51.289013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.289013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YRPfxCm4Et49FPGnyM+CjX3K0M/XYaQvbYjnUBuM9eDiKCue0fRUR/cSNYDibcyNaY7MFv2wVYsT5GgJNOKjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.289500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.8003","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0a7ae2b1506d7cc075f047e6aecb9e21565966720f6d6e7a75211c961cafbb2","sha256:9bad99ed9bcf1c71b4d7f96c9a628c44b5cf514913b3ea426aeefbbaf9fe3f2e"],"state_sha256":"782d2ad7862f1e93abf4a53ab5dfcf752926eef6393b8db8f617d3f11ffcabbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lxs21wSujbogxk2qlioyKwJe0o0BoRc+H/Pj5HsC1Wnw5eY8LMczGpOspmAgUcSfbczXsQK8LNm5w5qImiyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:27:48.409258Z","bundle_sha256":"50755fdd5d29cdc2544feb8f2ec9962a0fc40de83e37230e2a90f8d2f758b9ea"}}