{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D4FFJUCQ4JBMZLMSEPZ5KXUQXH","short_pith_number":"pith:D4FFJUCQ","schema_version":"1.0","canonical_sha256":"1f0a54d050e242ccad9223f3d55e90b9d074f410091e2722ce08a50ea1e65208","source":{"kind":"arxiv","id":"1408.6218","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Multinomial Matrix Completion","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), Joseph Salmon (LTCI), Olga Klopp (MODAL'X","submitted_at":"2014-08-26T19:19:39Z","abstract_excerpt":"The task of estimating a matrix given a sample of observed entries is known as the \\emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from a random sample of its entries. Here, we investigate the case of highly quantized observations when the measurements can take only a small number of values. These quantized outputs are generated according to a probability distribution parametrized by the unknown matrix of interest. This model corresponds, for example, to ratings in recommender systems or labels in multi-class c"},"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":"1408.6218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-26T19:19:39Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"629bdad397d68070d86c0479251d41b5f2aa1a50d3f2d1d968f1bd85aa045928","abstract_canon_sha256":"da217d279f3f2c4e14ec55cd3580fc9e1935fa59993b46a2614830a96b0c6728"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:09.097788Z","signature_b64":"BYBF/t7tFf5fZGZZAEP+Wi/PISQ7F6108El6G0o7E13fMzkpVev4mkIunahsR3BeG1+UyviSKrdYFDdG8cFlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f0a54d050e242ccad9223f3d55e90b9d074f410091e2722ce08a50ea1e65208","last_reissued_at":"2026-05-18T02:44:09.097324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:09.097324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Multinomial Matrix Completion","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), Joseph Salmon (LTCI), Olga Klopp (MODAL'X","submitted_at":"2014-08-26T19:19:39Z","abstract_excerpt":"The task of estimating a matrix given a sample of observed entries is known as the \\emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from a random sample of its entries. Here, we investigate the case of highly quantized observations when the measurements can take only a small number of values. These quantized outputs are generated according to a probability distribution parametrized by the unknown matrix of interest. This model corresponds, for example, to ratings in recommender systems or labels in multi-class c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6218","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":"1408.6218","created_at":"2026-05-18T02:44:09.097400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6218v1","created_at":"2026-05-18T02:44:09.097400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6218","created_at":"2026-05-18T02:44:09.097400+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4FFJUCQ4JBM","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4FFJUCQ4JBMZLMS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4FFJUCQ","created_at":"2026-05-18T12:28:25.294606+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/D4FFJUCQ4JBMZLMSEPZ5KXUQXH","json":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH.json","graph_json":"https://pith.science/api/pith-number/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/graph.json","events_json":"https://pith.science/api/pith-number/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/events.json","paper":"https://pith.science/paper/D4FFJUCQ"},"agent_actions":{"view_html":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH","download_json":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH.json","view_paper":"https://pith.science/paper/D4FFJUCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6218&json=true","fetch_graph":"https://pith.science/api/pith-number/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/graph.json","fetch_events":"https://pith.science/api/pith-number/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/action/storage_attestation","attest_author":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/action/author_attestation","sign_citation":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/action/citation_signature","submit_replication":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/action/replication_record"}},"created_at":"2026-05-18T02:44:09.097400+00:00","updated_at":"2026-05-18T02:44:09.097400+00:00"}