{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:D4FFJUCQ4JBMZLMSEPZ5KXUQXH","short_pith_number":"pith:D4FFJUCQ","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"},"canonical_sha256":"1f0a54d050e242ccad9223f3d55e90b9d074f410091e2722ce08a50ea1e65208","source":{"kind":"arxiv","id":"1408.6218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6218","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6218v1","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6218","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"D4FFJUCQ4JBM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D4FFJUCQ4JBMZLMS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D4FFJUCQ","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:D4FFJUCQ4JBMZLMSEPZ5KXUQXH","target":"record","payload":{"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"},"canonical_sha256":"1f0a54d050e242ccad9223f3d55e90b9d074f410091e2722ce08a50ea1e65208","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"},"source_kind":"arxiv","source_id":"1408.6218","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:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9HUcy3rBFHY4yrA2Dc3tN5qdD4u7R7aLat7wVdNXlSR9kJDO28HLpwi68LGIW9IsHF0DIIe7gqmL36Aus7DAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:38:45.664167Z"},"content_sha256":"6aef9217745f11a87a84bab3e40923b2b85173faa7c3b70909649c523150dcb6","schema_version":"1.0","event_id":"sha256:6aef9217745f11a87a84bab3e40923b2b85173faa7c3b70909649c523150dcb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:D4FFJUCQ4JBMZLMSEPZ5KXUQXH","target":"graph","payload":{"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"},"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:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4kBtiZiWlJQ3UJC8v3nKZHcsQsfUBZx7cD1trtHhI5oDY2iYDonKwg0SboDYEWbBzYkArITR3NnA1RmNIGjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:38:45.664662Z"},"content_sha256":"6419ad0d75a2676b1ee1ffa8e67da48e06365929724a3ae0a11da15dfb130a8e","schema_version":"1.0","event_id":"sha256:6419ad0d75a2676b1ee1ffa8e67da48e06365929724a3ae0a11da15dfb130a8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/bundle.json","state_url":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/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-26T19:38:45Z","links":{"resolver":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH","bundle":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/bundle.json","state":"https://pith.science/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4FFJUCQ4JBMZLMSEPZ5KXUQXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D4FFJUCQ4JBMZLMSEPZ5KXUQXH","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":"da217d279f3f2c4e14ec55cd3580fc9e1935fa59993b46a2614830a96b0c6728","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-26T19:19:39Z","title_canon_sha256":"629bdad397d68070d86c0479251d41b5f2aa1a50d3f2d1d968f1bd85aa045928"},"schema_version":"1.0","source":{"id":"1408.6218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6218","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6218v1","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6218","created_at":"2026-05-18T02:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"D4FFJUCQ4JBM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D4FFJUCQ4JBMZLMS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D4FFJUCQ","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:6419ad0d75a2676b1ee1ffa8e67da48e06365929724a3ae0a11da15dfb130a8e","target":"graph","created_at":"2026-05-18T02:44:09Z","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 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","authors_text":"CREST-INSEE), Eric Moulines (LTCI), Jean Lafond (LTCI), Joseph Salmon (LTCI), Olga Klopp (MODAL'X","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-26T19:19:39Z","title":"Adaptive Multinomial Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6218","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:6aef9217745f11a87a84bab3e40923b2b85173faa7c3b70909649c523150dcb6","target":"record","created_at":"2026-05-18T02:44:09Z","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":"da217d279f3f2c4e14ec55cd3580fc9e1935fa59993b46a2614830a96b0c6728","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-26T19:19:39Z","title_canon_sha256":"629bdad397d68070d86c0479251d41b5f2aa1a50d3f2d1d968f1bd85aa045928"},"schema_version":"1.0","source":{"id":"1408.6218","kind":"arxiv","version":1}},"canonical_sha256":"1f0a54d050e242ccad9223f3d55e90b9d074f410091e2722ce08a50ea1e65208","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f0a54d050e242ccad9223f3d55e90b9d074f410091e2722ce08a50ea1e65208","first_computed_at":"2026-05-18T02:44:09.097324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:09.097324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BYBF/t7tFf5fZGZZAEP+Wi/PISQ7F6108El6G0o7E13fMzkpVev4mkIunahsR3BeG1+UyviSKrdYFDdG8cFlDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:09.097788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.6218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aef9217745f11a87a84bab3e40923b2b85173faa7c3b70909649c523150dcb6","sha256:6419ad0d75a2676b1ee1ffa8e67da48e06365929724a3ae0a11da15dfb130a8e"],"state_sha256":"5effbed5ee191c1e8117e8b26247f74932130f1671bf3bc4c7cae7516de34745"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wq2NtvmO4MWq/2oANxpQvQiKHUgdvHYdmbUN4vqgnEvvqkoxLM9Bw1PDqF0QviibivDbe6/hIsYbbdW+RYwwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:38:45.667625Z","bundle_sha256":"0b598186d1a49ae9212258bc0b345e956fe78b54c518504386ce32d08486fc0f"}}