{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UELEQUNTRTSL5GHRTDBPLCSMXB","short_pith_number":"pith:UELEQUNT","schema_version":"1.0","canonical_sha256":"a1164851b38ce4be98f198c2f58a4cb87fb12048ffbe0ee68a2784a752f68eb9","source":{"kind":"arxiv","id":"1412.2632","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic low-rank matrix completion on finite alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"CREST-INSEE), Eric Moulines (LTCI), Jean Lafond (LTCI), Jospeh Salmon (LTCI), Olga Klopp (MODAL'X","submitted_at":"2014-12-08T15:57:40Z","abstract_excerpt":"The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image processing, quantum physics or multi-class classificationto name a few. Most works have focused on recovering an unknown real-valued low-rankmatrix from randomly sub-sampling its entries.Here, we investigate the case where the observations take a finite number of values, corresponding for examples to ratings in recommender systems or labels in multi-class clas"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.2632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-08T15:57:40Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"1b9484eb45b1c7784c7b86a4a801da53106dfeebaf8387b06c83cb98716fd4ee","abstract_canon_sha256":"4e093147a9f1a2d9d3d5f2846edaa307c5f44d863eaed1e969c85eb5efab0364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:55.360944Z","signature_b64":"/g312KlpqYJaW/nZKpy/Lucs0ybYE1CEm94jBV4tTlwxRJS4/XHbZ6wYEt4zg+egRsQHMRfhAbtAzQvzTTIBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1164851b38ce4be98f198c2f58a4cb87fb12048ffbe0ee68a2784a752f68eb9","last_reissued_at":"2026-05-18T02:30:55.360351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:55.360351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic low-rank matrix completion on finite alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"CREST-INSEE), Eric Moulines (LTCI), Jean Lafond (LTCI), Jospeh Salmon (LTCI), Olga Klopp (MODAL'X","submitted_at":"2014-12-08T15:57:40Z","abstract_excerpt":"The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image processing, quantum physics or multi-class classificationto name a few. Most works have focused on recovering an unknown real-valued low-rankmatrix from randomly sub-sampling its entries.Here, we investigate the case where the observations take a finite number of values, corresponding for examples to ratings in recommender systems or labels in multi-class clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2632","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.2632","created_at":"2026-05-18T02:30:55.360455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2632v1","created_at":"2026-05-18T02:30:55.360455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2632","created_at":"2026-05-18T02:30:55.360455+00:00"},{"alias_kind":"pith_short_12","alias_value":"UELEQUNTRTSL","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UELEQUNTRTSL5GHR","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UELEQUNT","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB","json":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB.json","graph_json":"https://pith.science/api/pith-number/UELEQUNTRTSL5GHRTDBPLCSMXB/graph.json","events_json":"https://pith.science/api/pith-number/UELEQUNTRTSL5GHRTDBPLCSMXB/events.json","paper":"https://pith.science/paper/UELEQUNT"},"agent_actions":{"view_html":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB","download_json":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB.json","view_paper":"https://pith.science/paper/UELEQUNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2632&json=true","fetch_graph":"https://pith.science/api/pith-number/UELEQUNTRTSL5GHRTDBPLCSMXB/graph.json","fetch_events":"https://pith.science/api/pith-number/UELEQUNTRTSL5GHRTDBPLCSMXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/action/storage_attestation","attest_author":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/action/author_attestation","sign_citation":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/action/citation_signature","submit_replication":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/action/replication_record"}},"created_at":"2026-05-18T02:30:55.360455+00:00","updated_at":"2026-05-18T02:30:55.360455+00:00"}