{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HRY3O6TJOKPOUMLZKIO5EKZJUJ","short_pith_number":"pith:HRY3O6TJ","canonical_record":{"source":{"id":"1410.2596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-09T19:48:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca614b7f498b78e63ed63570d686a2ef8996ea3604faa20fab08b0749d8a2f8e","abstract_canon_sha256":"6205c354c81aa9d2be5323eb6bb94157a910d1c92b22b40e50a88a7fa9374023"},"schema_version":"1.0"},"canonical_sha256":"3c71b77a69729eea3179521dd22b29a248f22f62867e876db22443c547724a9c","source":{"kind":"arxiv","id":"1410.2596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2596","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2596v1","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2596","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"HRY3O6TJOKPO","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HRY3O6TJOKPOUMLZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HRY3O6TJ","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HRY3O6TJOKPOUMLZKIO5EKZJUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-09T19:48:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca614b7f498b78e63ed63570d686a2ef8996ea3604faa20fab08b0749d8a2f8e","abstract_canon_sha256":"6205c354c81aa9d2be5323eb6bb94157a910d1c92b22b40e50a88a7fa9374023"},"schema_version":"1.0"},"canonical_sha256":"3c71b77a69729eea3179521dd22b29a248f22f62867e876db22443c547724a9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:46.062974Z","signature_b64":"U3XR1qgNfCzJu3CP23P5xu14jZtUxFPhxe1tROP7I1PCzosrTrfF9yxM8MjW3Prgr9bIBJlXaIPx6HwPNkUqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c71b77a69729eea3179521dd22b29a248f22f62867e876db22443c547724a9c","last_reissued_at":"2026-05-18T02:40:46.062546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:46.062546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2596","source_version":1,"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:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qu371WjujQ+8EmL3Dm218ZH2Ls9tUYdP00krHBMslNSBV24t1K2tSQjVkzzLn3Rbc/61AjO6gMY8ZnutfSKgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:03:10.523926Z"},"content_sha256":"cfd59a6f10099b7cad5972b6611cda2f830b0cbfb1157e025a9fa1c6fef06055","schema_version":"1.0","event_id":"sha256:cfd59a6f10099b7cad5972b6611cda2f830b0cbfb1157e025a9fa1c6fef06055"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HRY3O6TJOKPOUMLZKIO5EKZJUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Jason Lee, Rahul Mazumder, Reza Zadeh, Trevor Hastie","submitted_at":"2014-10-09T19:48:00Z","abstract_excerpt":"The matrix-completion problem has attracted a lot of attention, largely as a result of the celebrated Netflix competition. Two popular approaches for solving the problem are nuclear-norm-regularized matrix approximation (Candes and Tao, 2009, Mazumder, Hastie and Tibshirani, 2010), and maximum-margin matrix factorization (Srebro, Rennie and Jaakkola, 2005). These two procedures are in some cases solving equivalent problems, but with quite different algorithms. In this article we bring the two approaches together, leading to an efficient algorithm for large matrix factorization and completion t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2596","kind":"arxiv","version":1},"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:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jq8+7TWczPgofctQ38McAW3hCbUhQUupmgyYAb19T9ySgGlMKWLmJKbnIw102VA8qGoHeOvQNGAlW+q6MoNODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:03:10.524604Z"},"content_sha256":"71ff2704c3beacedde960f7e8787434c6512bcbfea638d8c0448967cbf149799","schema_version":"1.0","event_id":"sha256:71ff2704c3beacedde960f7e8787434c6512bcbfea638d8c0448967cbf149799"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRY3O6TJOKPOUMLZKIO5EKZJUJ/bundle.json","state_url":"https://pith.science/pith/HRY3O6TJOKPOUMLZKIO5EKZJUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRY3O6TJOKPOUMLZKIO5EKZJUJ/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-26T13:03:10Z","links":{"resolver":"https://pith.science/pith/HRY3O6TJOKPOUMLZKIO5EKZJUJ","bundle":"https://pith.science/pith/HRY3O6TJOKPOUMLZKIO5EKZJUJ/bundle.json","state":"https://pith.science/pith/HRY3O6TJOKPOUMLZKIO5EKZJUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRY3O6TJOKPOUMLZKIO5EKZJUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HRY3O6TJOKPOUMLZKIO5EKZJUJ","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":"6205c354c81aa9d2be5323eb6bb94157a910d1c92b22b40e50a88a7fa9374023","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-09T19:48:00Z","title_canon_sha256":"ca614b7f498b78e63ed63570d686a2ef8996ea3604faa20fab08b0749d8a2f8e"},"schema_version":"1.0","source":{"id":"1410.2596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2596","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2596v1","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2596","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"HRY3O6TJOKPO","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HRY3O6TJOKPOUMLZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HRY3O6TJ","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:71ff2704c3beacedde960f7e8787434c6512bcbfea638d8c0448967cbf149799","target":"graph","created_at":"2026-05-18T02:40:46Z","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":"The matrix-completion problem has attracted a lot of attention, largely as a result of the celebrated Netflix competition. Two popular approaches for solving the problem are nuclear-norm-regularized matrix approximation (Candes and Tao, 2009, Mazumder, Hastie and Tibshirani, 2010), and maximum-margin matrix factorization (Srebro, Rennie and Jaakkola, 2005). These two procedures are in some cases solving equivalent problems, but with quite different algorithms. In this article we bring the two approaches together, leading to an efficient algorithm for large matrix factorization and completion t","authors_text":"Jason Lee, Rahul Mazumder, Reza Zadeh, Trevor Hastie","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-09T19:48:00Z","title":"Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2596","kind":"arxiv","version":1},"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:cfd59a6f10099b7cad5972b6611cda2f830b0cbfb1157e025a9fa1c6fef06055","target":"record","created_at":"2026-05-18T02:40:46Z","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":"6205c354c81aa9d2be5323eb6bb94157a910d1c92b22b40e50a88a7fa9374023","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-09T19:48:00Z","title_canon_sha256":"ca614b7f498b78e63ed63570d686a2ef8996ea3604faa20fab08b0749d8a2f8e"},"schema_version":"1.0","source":{"id":"1410.2596","kind":"arxiv","version":1}},"canonical_sha256":"3c71b77a69729eea3179521dd22b29a248f22f62867e876db22443c547724a9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c71b77a69729eea3179521dd22b29a248f22f62867e876db22443c547724a9c","first_computed_at":"2026-05-18T02:40:46.062546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:46.062546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3XR1qgNfCzJu3CP23P5xu14jZtUxFPhxe1tROP7I1PCzosrTrfF9yxM8MjW3Prgr9bIBJlXaIPx6HwPNkUqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:46.062974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfd59a6f10099b7cad5972b6611cda2f830b0cbfb1157e025a9fa1c6fef06055","sha256:71ff2704c3beacedde960f7e8787434c6512bcbfea638d8c0448967cbf149799"],"state_sha256":"7329a47d34770b6937de5eaa44f8e11548effee51bbdb85e20fef6cc9a5cea9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"th0hF46XKHrTX9PSIk2TqGJKnWunk2yZyc/ULClkkhmfMUfv2Pau7WHiwdtiIK8YOehxV6Yp2RzzzccF9Y/ZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:03:10.531235Z","bundle_sha256":"252936cab1b86d50e72dacc16aa9a0adbc68a8c9dcd7c4a2a92033d2f4a0b779"}}