{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CCI7D7YUIIOVNMZH6JZT552J7Y","short_pith_number":"pith:CCI7D7YU","canonical_record":{"source":{"id":"1212.0467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-03T17:57:50Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"9e8fb245e0c1bbc4d0f2d248fe1b9425846fd78bfe2eb55f13e02160bedf3ec8","abstract_canon_sha256":"0d07eab4ff0bf4b90bc0315b05525d3bca04cb1f9c6a9675a9bcde989c0801f6"},"schema_version":"1.0"},"canonical_sha256":"1091f1ff14421d56b327f2733ef749fe2b0e8dd0202b414760814f8373963c2a","source":{"kind":"arxiv","id":"1212.0467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0467","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0467v1","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0467","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"CCI7D7YUIIOV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CCI7D7YUIIOVNMZH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CCI7D7YU","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CCI7D7YUIIOVNMZH6JZT552J7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1212.0467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-03T17:57:50Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"9e8fb245e0c1bbc4d0f2d248fe1b9425846fd78bfe2eb55f13e02160bedf3ec8","abstract_canon_sha256":"0d07eab4ff0bf4b90bc0315b05525d3bca04cb1f9c6a9675a9bcde989c0801f6"},"schema_version":"1.0"},"canonical_sha256":"1091f1ff14421d56b327f2733ef749fe2b0e8dd0202b414760814f8373963c2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:17.413540Z","signature_b64":"6/pF5EaebOWvD6KudaamRs6SKnAM/CTRGNuXS+wBmRqCOkH+UI42Ynqnj3VT/AMU3bB2P3rMi+evYyqFH7ZqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1091f1ff14421d56b327f2733ef749fe2b0e8dd0202b414760814f8373963c2a","last_reissued_at":"2026-05-18T03:39:17.412813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:17.412813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.0467","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-18T03:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLu3elk63YisptXFWYbF2DypsKE6LaYgmDqnUybfQZvRYcKsf2RkEychwjHzL+uh2yBCo6y7ytPd0qA685XeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:37:59.398822Z"},"content_sha256":"db11fcdfe6dfae17d3aef8a69c9c7324ad440da2618b69d790b7e3bfab364270","schema_version":"1.0","event_id":"sha256:db11fcdfe6dfae17d3aef8a69c9c7324ad440da2618b69d790b7e3bfab364270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CCI7D7YUIIOVNMZH6JZT552J7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank Matrix Completion using Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi","submitted_at":"2012-12-03T17:57:50Z","abstract_excerpt":"Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to be one of the most accurate and efficient, and formed a major component of the winning entry in the Netflix Challenge.\n  In the alternating minimization approach, the low-rank target matrix is written in a bi-linear form, i.e. $X = UV^\\dag$; the algorithm then alternates between finding the best $U$ and the best $V$. Typically, each alternating step in isolat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0467","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-18T03:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OfrbbuBBa1nMflzK2174nZzkpFOTTTN48KFICku+l5u9cXkdVq/PJJUySgtYgSPQaYRRHElcasjKxeT/gHfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:37:59.399482Z"},"content_sha256":"366c5e6d764be6000eeb9b461a9fb90258e8d599597ec43f598d749b8f122d49","schema_version":"1.0","event_id":"sha256:366c5e6d764be6000eeb9b461a9fb90258e8d599597ec43f598d749b8f122d49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/bundle.json","state_url":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/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-27T07:37:59Z","links":{"resolver":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y","bundle":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/bundle.json","state":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CCI7D7YUIIOVNMZH6JZT552J7Y","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":"0d07eab4ff0bf4b90bc0315b05525d3bca04cb1f9c6a9675a9bcde989c0801f6","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-03T17:57:50Z","title_canon_sha256":"9e8fb245e0c1bbc4d0f2d248fe1b9425846fd78bfe2eb55f13e02160bedf3ec8"},"schema_version":"1.0","source":{"id":"1212.0467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0467","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0467v1","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0467","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"CCI7D7YUIIOV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CCI7D7YUIIOVNMZH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CCI7D7YU","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:366c5e6d764be6000eeb9b461a9fb90258e8d599597ec43f598d749b8f122d49","target":"graph","created_at":"2026-05-18T03:39:17Z","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":"Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to be one of the most accurate and efficient, and formed a major component of the winning entry in the Netflix Challenge.\n  In the alternating minimization approach, the low-rank target matrix is written in a bi-linear form, i.e. $X = UV^\\dag$; the algorithm then alternates between finding the best $U$ and the best $V$. Typically, each alternating step in isolat","authors_text":"Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-03T17:57:50Z","title":"Low-rank Matrix Completion using Alternating Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0467","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:db11fcdfe6dfae17d3aef8a69c9c7324ad440da2618b69d790b7e3bfab364270","target":"record","created_at":"2026-05-18T03:39:17Z","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":"0d07eab4ff0bf4b90bc0315b05525d3bca04cb1f9c6a9675a9bcde989c0801f6","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-03T17:57:50Z","title_canon_sha256":"9e8fb245e0c1bbc4d0f2d248fe1b9425846fd78bfe2eb55f13e02160bedf3ec8"},"schema_version":"1.0","source":{"id":"1212.0467","kind":"arxiv","version":1}},"canonical_sha256":"1091f1ff14421d56b327f2733ef749fe2b0e8dd0202b414760814f8373963c2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1091f1ff14421d56b327f2733ef749fe2b0e8dd0202b414760814f8373963c2a","first_computed_at":"2026-05-18T03:39:17.412813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:17.412813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6/pF5EaebOWvD6KudaamRs6SKnAM/CTRGNuXS+wBmRqCOkH+UI42Ynqnj3VT/AMU3bB2P3rMi+evYyqFH7ZqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:17.413540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db11fcdfe6dfae17d3aef8a69c9c7324ad440da2618b69d790b7e3bfab364270","sha256:366c5e6d764be6000eeb9b461a9fb90258e8d599597ec43f598d749b8f122d49"],"state_sha256":"0a0368a809e04b57d43507b028b0bf017695e29c075c621490bf3b6e02c4b234"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3NP4BMLvNHC7xc4S1XWi1pU1DE6AgztnttBvQ9Yvf0DVryo7zpekta2wk/ULxrfRvsY5dEDGBBoXaIEBz4mDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:37:59.403558Z","bundle_sha256":"226446b3783067431a5e2d56ecf9dc437a7a08126f3846b5c3b646dfefb65d73"}}