{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2HSXB5YYMEASRUYY4NXC47XRYE","short_pith_number":"pith:2HSXB5YY","canonical_record":{"source":{"id":"1408.5820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-25T16:08:11Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"cac1ebcda17ca86185b55ea8ab0271f8e25d36e2785e315b4a77fdf7563cadaa","abstract_canon_sha256":"27ac49ec5091b8a17c09eff4e00d8c9622001de3f16c0e45692da77d502e3136"},"schema_version":"1.0"},"canonical_sha256":"d1e570f718610128d318e36e2e7ef1c117d55dff676bd7a160a01c404f788394","source":{"kind":"arxiv","id":"1408.5820","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5820","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5820v2","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5820","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"pith_short_12","alias_value":"2HSXB5YYMEAS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2HSXB5YYMEASRUYY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2HSXB5YY","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2HSXB5YYMEASRUYY4NXC47XRYE","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-25T16:08:11Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"cac1ebcda17ca86185b55ea8ab0271f8e25d36e2785e315b4a77fdf7563cadaa","abstract_canon_sha256":"27ac49ec5091b8a17c09eff4e00d8c9622001de3f16c0e45692da77d502e3136"},"schema_version":"1.0"},"canonical_sha256":"d1e570f718610128d318e36e2e7ef1c117d55dff676bd7a160a01c404f788394","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:28.384181Z","signature_b64":"ySW9ouVsT1WiYaAS3t76Mf82ohc67qSF6yPg7IuRmadFi/XIv8SV9bL5Eu4Unq2YrJHDPhIH5Nngx48XxBAjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1e570f718610128d318e36e2e7ef1c117d55dff676bd7a160a01c404f788394","last_reissued_at":"2026-05-18T02:19:28.383463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:28.383463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5820","source_version":2,"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:19:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndtmFcZo23NZ8Qqj9RFU/Kja2N+KHa+0fDxP0DCJFKws2lJ9Q7+8YFHwnuNOsaeUjmlGu3nyJiqyPH0G9+q2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:19:18.705851Z"},"content_sha256":"fa93edc57220b9536d25fdb45ffe59e62e368aae7f5a60303fdd95f9d1d986b9","schema_version":"1.0","event_id":"sha256:fa93edc57220b9536d25fdb45ffe59e62e368aae7f5a60303fdd95f9d1d986b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2HSXB5YYMEASRUYY4NXC47XRYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bayesian Approach for Noisy Matrix Completion: Optimal Rate under General Sampling Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Pierre Alquier, The Tien Mai","submitted_at":"2014-08-25T16:08:11Z","abstract_excerpt":"Bayesian methods for low-rank matrix completion with noise have been shown to be very efficient computationally. While the behaviour of penalized minimization methods is well understood both from the theoretical and computational points of view in this problem, the theoretical optimality of Bayesian estimators have not been explored yet. In this paper, we propose a Bayesian estimator for matrix completion under general sampling distribution. We also provide an oracle inequality for this estimator. This inequality proves that, whatever the rank of the matrix to be estimated, our estimator reach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5820","kind":"arxiv","version":2},"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:19:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jnBdz3STdlCZ7PWVJi2Wvn9zs95cAZizptRMZ4vUuZDFU/9vOicTv9CGDccovuvW5VfhPT9FFM2qAw5FOEcPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:19:18.706214Z"},"content_sha256":"78566a014ba6e44d594207c522a187c205032532598e75a42b4b2436630f4b4f","schema_version":"1.0","event_id":"sha256:78566a014ba6e44d594207c522a187c205032532598e75a42b4b2436630f4b4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HSXB5YYMEASRUYY4NXC47XRYE/bundle.json","state_url":"https://pith.science/pith/2HSXB5YYMEASRUYY4NXC47XRYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HSXB5YYMEASRUYY4NXC47XRYE/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-06-04T07:19:18Z","links":{"resolver":"https://pith.science/pith/2HSXB5YYMEASRUYY4NXC47XRYE","bundle":"https://pith.science/pith/2HSXB5YYMEASRUYY4NXC47XRYE/bundle.json","state":"https://pith.science/pith/2HSXB5YYMEASRUYY4NXC47XRYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HSXB5YYMEASRUYY4NXC47XRYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2HSXB5YYMEASRUYY4NXC47XRYE","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":"27ac49ec5091b8a17c09eff4e00d8c9622001de3f16c0e45692da77d502e3136","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-25T16:08:11Z","title_canon_sha256":"cac1ebcda17ca86185b55ea8ab0271f8e25d36e2785e315b4a77fdf7563cadaa"},"schema_version":"1.0","source":{"id":"1408.5820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5820","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5820v2","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5820","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"pith_short_12","alias_value":"2HSXB5YYMEAS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2HSXB5YYMEASRUYY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2HSXB5YY","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:78566a014ba6e44d594207c522a187c205032532598e75a42b4b2436630f4b4f","target":"graph","created_at":"2026-05-18T02:19:28Z","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":"Bayesian methods for low-rank matrix completion with noise have been shown to be very efficient computationally. While the behaviour of penalized minimization methods is well understood both from the theoretical and computational points of view in this problem, the theoretical optimality of Bayesian estimators have not been explored yet. In this paper, we propose a Bayesian estimator for matrix completion under general sampling distribution. We also provide an oracle inequality for this estimator. This inequality proves that, whatever the rank of the matrix to be estimated, our estimator reach","authors_text":"Pierre Alquier, The Tien Mai","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-25T16:08:11Z","title":"A Bayesian Approach for Noisy Matrix Completion: Optimal Rate under General Sampling Distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5820","kind":"arxiv","version":2},"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:fa93edc57220b9536d25fdb45ffe59e62e368aae7f5a60303fdd95f9d1d986b9","target":"record","created_at":"2026-05-18T02:19:28Z","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":"27ac49ec5091b8a17c09eff4e00d8c9622001de3f16c0e45692da77d502e3136","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-25T16:08:11Z","title_canon_sha256":"cac1ebcda17ca86185b55ea8ab0271f8e25d36e2785e315b4a77fdf7563cadaa"},"schema_version":"1.0","source":{"id":"1408.5820","kind":"arxiv","version":2}},"canonical_sha256":"d1e570f718610128d318e36e2e7ef1c117d55dff676bd7a160a01c404f788394","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1e570f718610128d318e36e2e7ef1c117d55dff676bd7a160a01c404f788394","first_computed_at":"2026-05-18T02:19:28.383463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:28.383463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ySW9ouVsT1WiYaAS3t76Mf82ohc67qSF6yPg7IuRmadFi/XIv8SV9bL5Eu4Unq2YrJHDPhIH5Nngx48XxBAjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:28.384181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa93edc57220b9536d25fdb45ffe59e62e368aae7f5a60303fdd95f9d1d986b9","sha256:78566a014ba6e44d594207c522a187c205032532598e75a42b4b2436630f4b4f"],"state_sha256":"5711e91d27823df207a8071f3cd4c5b6df5e22764feb2eb0e6ae90747a307e26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y59aBq+7yJf28U62Iv+J4RoOS/mUewpz+QYlmRN8IuwdouESLl1vqGC1qyfMErvOsNIqbrm3B/OpsrP4p7zHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T07:19:18.708350Z","bundle_sha256":"9d53edaa5c2267092b9f7cc316cc6c3fb08f502ba700160d61fc76dd24091e4d"}}