{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UELEQUNTRTSL5GHRTDBPLCSMXB","short_pith_number":"pith:UELEQUNT","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"},"canonical_sha256":"a1164851b38ce4be98f198c2f58a4cb87fb12048ffbe0ee68a2784a752f68eb9","source":{"kind":"arxiv","id":"1412.2632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2632","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2632v1","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2632","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"UELEQUNTRTSL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UELEQUNTRTSL5GHR","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UELEQUNT","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UELEQUNTRTSL5GHRTDBPLCSMXB","target":"record","payload":{"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"},"canonical_sha256":"a1164851b38ce4be98f198c2f58a4cb87fb12048ffbe0ee68a2784a752f68eb9","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"},"source_kind":"arxiv","source_id":"1412.2632","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:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOU+77OC9y+3aWq3WTm8ysOqGJujDVAggRGLkG7eJolyw2s1nFIj/Q8K0XmpkTEGCgE9wNQTr1LP0SpvHFFVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:07:40.414703Z"},"content_sha256":"1346698668a3e4cbc340cc7135f0931c47b90fd0410b7bb813e3934cbf6fddc9","schema_version":"1.0","event_id":"sha256:1346698668a3e4cbc340cc7135f0931c47b90fd0410b7bb813e3934cbf6fddc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UELEQUNTRTSL5GHRTDBPLCSMXB","target":"graph","payload":{"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"},"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:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXXAezovnWBEfxYJUC34K2DNk6UA8GQSplveBeIjUb6wwtbkq9NX9mDhy9VxHLy8qoFFZzL0VUXiPg9yTd+3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:07:40.415402Z"},"content_sha256":"52cfbf2eba07eb4042ca3d781b99463867a13e71ea1d0106feaa06e142bb1729","schema_version":"1.0","event_id":"sha256:52cfbf2eba07eb4042ca3d781b99463867a13e71ea1d0106feaa06e142bb1729"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/bundle.json","state_url":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/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-26T09:07:40Z","links":{"resolver":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB","bundle":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/bundle.json","state":"https://pith.science/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UELEQUNTRTSL5GHRTDBPLCSMXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UELEQUNTRTSL5GHRTDBPLCSMXB","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":"4e093147a9f1a2d9d3d5f2846edaa307c5f44d863eaed1e969c85eb5efab0364","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-08T15:57:40Z","title_canon_sha256":"1b9484eb45b1c7784c7b86a4a801da53106dfeebaf8387b06c83cb98716fd4ee"},"schema_version":"1.0","source":{"id":"1412.2632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2632","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2632v1","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2632","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"UELEQUNTRTSL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UELEQUNTRTSL5GHR","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UELEQUNT","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:52cfbf2eba07eb4042ca3d781b99463867a13e71ea1d0106feaa06e142bb1729","target":"graph","created_at":"2026-05-18T02:30:55Z","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 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","authors_text":"CREST-INSEE), Eric Moulines (LTCI), Jean Lafond (LTCI), Jospeh 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-12-08T15:57:40Z","title":"Probabilistic low-rank matrix completion on finite alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2632","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:1346698668a3e4cbc340cc7135f0931c47b90fd0410b7bb813e3934cbf6fddc9","target":"record","created_at":"2026-05-18T02:30:55Z","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":"4e093147a9f1a2d9d3d5f2846edaa307c5f44d863eaed1e969c85eb5efab0364","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-08T15:57:40Z","title_canon_sha256":"1b9484eb45b1c7784c7b86a4a801da53106dfeebaf8387b06c83cb98716fd4ee"},"schema_version":"1.0","source":{"id":"1412.2632","kind":"arxiv","version":1}},"canonical_sha256":"a1164851b38ce4be98f198c2f58a4cb87fb12048ffbe0ee68a2784a752f68eb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1164851b38ce4be98f198c2f58a4cb87fb12048ffbe0ee68a2784a752f68eb9","first_computed_at":"2026-05-18T02:30:55.360351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:55.360351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/g312KlpqYJaW/nZKpy/Lucs0ybYE1CEm94jBV4tTlwxRJS4/XHbZ6wYEt4zg+egRsQHMRfhAbtAzQvzTTIBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:55.360944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1346698668a3e4cbc340cc7135f0931c47b90fd0410b7bb813e3934cbf6fddc9","sha256:52cfbf2eba07eb4042ca3d781b99463867a13e71ea1d0106feaa06e142bb1729"],"state_sha256":"6016d544ecdc7fc2c867c271de81b81610e30675640163ba4ffa26b728fe8ce8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OtOM2Y2s9qTFzGCsd8v1thdRluheridXoElKHRpteMijm9PDxhhQH/EZ2/0rmE3UbrO2Ha4bkTz7UHNeqpmmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:07:40.418930Z","bundle_sha256":"4ebe566e78dced45bf3313607cd5382cfd79a05cc96fa6c92134e8b9f74ed70c"}}