{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:5LUSOCZTMBZBMK5OQMES32XNZ6","short_pith_number":"pith:5LUSOCZT","canonical_record":{"source":{"id":"0810.3286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-10-18T02:08:21Z","cross_cats_sorted":[],"title_canon_sha256":"e208c1dd25953157f2b8de33c2e0c34022d43ef269bed5368dbbadd7dc9d19c2","abstract_canon_sha256":"5ec3a33be3de92a59a88fa94ed801ed98b049679c44d17b11615926defe7c4d9"},"schema_version":"1.0"},"canonical_sha256":"eae9270b336072162bae83092deaedcf85081e890425d86be0ab43bf1c1537d6","source":{"kind":"arxiv","id":"0810.3286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.3286","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"arxiv_version","alias_value":"0810.3286v1","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.3286","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"pith_short_12","alias_value":"5LUSOCZTMBZB","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"pith_short_16","alias_value":"5LUSOCZTMBZBMK5O","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"pith_short_8","alias_value":"5LUSOCZT","created_at":"2026-07-04T15:15:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:5LUSOCZTMBZBMK5OQMES32XNZ6","target":"record","payload":{"canonical_record":{"source":{"id":"0810.3286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-10-18T02:08:21Z","cross_cats_sorted":[],"title_canon_sha256":"e208c1dd25953157f2b8de33c2e0c34022d43ef269bed5368dbbadd7dc9d19c2","abstract_canon_sha256":"5ec3a33be3de92a59a88fa94ed801ed98b049679c44d17b11615926defe7c4d9"},"schema_version":"1.0"},"canonical_sha256":"eae9270b336072162bae83092deaedcf85081e890425d86be0ab43bf1c1537d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:15:15.963724Z","signature_b64":"IU/33pmTU5gWpS9wLFrGMVBp7xIDNUJheX1egJeUY4zyfWQtjsXBDRbP/SVVr3Jn9McZTksP8Vn3arIwo+sDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eae9270b336072162bae83092deaedcf85081e890425d86be0ab43bf1c1537d6","last_reissued_at":"2026-07-04T15:15:15.963276Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:15:15.963276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0810.3286","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-07-04T15:15:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53Ce5HbT5iZeTEAHjDwwEMSOoDGhn5z3J1VeObcW6pk+nWiWujDjscJ/s3gW4FoLXtkNk1XH/6nF/r0DX23XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:19:02.158652Z"},"content_sha256":"5dc7cf8bc499decfd1bf1193a2f0c5d91d9bf8b1bbc9bbcc25c64ea4beb5f3e8","schema_version":"1.0","event_id":"sha256:5dc7cf8bc499decfd1bf1193a2f0c5d91d9bf8b1bbc9bbcc25c64ea4beb5f3e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:5LUSOCZTMBZBMK5OQMES32XNZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Singular Value Thresholding Algorithm for Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Emmanuel J. Candes, Jian-Feng Cai, Zuowei Shen","submitted_at":"2008-10-18T02:08:21Z","abstract_excerpt":"This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Off-the-shelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries.\n  This paper develops a simple first-order and easy-to-implemen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.3286","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0810.3286/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:15:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xji29tKLpoxVivD3aJxJdOOB4AUHyz0PkAve8p9qvrZ27efdtWhwT89Jjdp86ATbgcTzY6C9mKL7keohchZQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:19:02.159970Z"},"content_sha256":"0dbb0781ca9d6efae29a9cc5aa1c0c465155ae1cdc961587012e8ab58d881ba0","schema_version":"1.0","event_id":"sha256:0dbb0781ca9d6efae29a9cc5aa1c0c465155ae1cdc961587012e8ab58d881ba0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LUSOCZTMBZBMK5OQMES32XNZ6/bundle.json","state_url":"https://pith.science/pith/5LUSOCZTMBZBMK5OQMES32XNZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LUSOCZTMBZBMK5OQMES32XNZ6/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-08-05T11:19:02Z","links":{"resolver":"https://pith.science/pith/5LUSOCZTMBZBMK5OQMES32XNZ6","bundle":"https://pith.science/pith/5LUSOCZTMBZBMK5OQMES32XNZ6/bundle.json","state":"https://pith.science/pith/5LUSOCZTMBZBMK5OQMES32XNZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LUSOCZTMBZBMK5OQMES32XNZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:5LUSOCZTMBZBMK5OQMES32XNZ6","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":"5ec3a33be3de92a59a88fa94ed801ed98b049679c44d17b11615926defe7c4d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-10-18T02:08:21Z","title_canon_sha256":"e208c1dd25953157f2b8de33c2e0c34022d43ef269bed5368dbbadd7dc9d19c2"},"schema_version":"1.0","source":{"id":"0810.3286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.3286","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"arxiv_version","alias_value":"0810.3286v1","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.3286","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"pith_short_12","alias_value":"5LUSOCZTMBZB","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"pith_short_16","alias_value":"5LUSOCZTMBZBMK5O","created_at":"2026-07-04T15:15:15Z"},{"alias_kind":"pith_short_8","alias_value":"5LUSOCZT","created_at":"2026-07-04T15:15:15Z"}],"graph_snapshots":[{"event_id":"sha256:0dbb0781ca9d6efae29a9cc5aa1c0c465155ae1cdc961587012e8ab58d881ba0","target":"graph","created_at":"2026-07-04T15:15:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0810.3286/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Off-the-shelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries.\n  This paper develops a simple first-order and easy-to-implemen","authors_text":"Emmanuel J. Candes, Jian-Feng Cai, Zuowei Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-10-18T02:08:21Z","title":"A Singular Value Thresholding Algorithm for Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.3286","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:5dc7cf8bc499decfd1bf1193a2f0c5d91d9bf8b1bbc9bbcc25c64ea4beb5f3e8","target":"record","created_at":"2026-07-04T15:15:15Z","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":"5ec3a33be3de92a59a88fa94ed801ed98b049679c44d17b11615926defe7c4d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-10-18T02:08:21Z","title_canon_sha256":"e208c1dd25953157f2b8de33c2e0c34022d43ef269bed5368dbbadd7dc9d19c2"},"schema_version":"1.0","source":{"id":"0810.3286","kind":"arxiv","version":1}},"canonical_sha256":"eae9270b336072162bae83092deaedcf85081e890425d86be0ab43bf1c1537d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eae9270b336072162bae83092deaedcf85081e890425d86be0ab43bf1c1537d6","first_computed_at":"2026-07-04T15:15:15.963276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:15:15.963276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IU/33pmTU5gWpS9wLFrGMVBp7xIDNUJheX1egJeUY4zyfWQtjsXBDRbP/SVVr3Jn9McZTksP8Vn3arIwo+sDBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:15:15.963724Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.3286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dc7cf8bc499decfd1bf1193a2f0c5d91d9bf8b1bbc9bbcc25c64ea4beb5f3e8","sha256:0dbb0781ca9d6efae29a9cc5aa1c0c465155ae1cdc961587012e8ab58d881ba0"],"state_sha256":"17d883d04c8e81e1c0a14e79b289b9911f5b6496193977788cfae6654ca1aec5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8O07M07t7sskTBGVF5+42GRniZBOJy+PQMrmQmwHbCpsUijgspFC3zA79luPfuEKvUMGwT34u/sow+WjdPkSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T11:19:02.169770Z","bundle_sha256":"38286108cba62893baeea8d3673f4bc0a93da0e8201dad1cf610cec06b2e33d5"}}