{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2I6JQMRU4CHCC33R6LCRZ5JAX4","short_pith_number":"pith:2I6JQMRU","schema_version":"1.0","canonical_sha256":"d23c983234e08e216f71f2c51cf520bf0d4264e3b19051673df7f366d029eb8c","source":{"kind":"arxiv","id":"1102.5288","version":2},"attestation_state":"computed","paper":{"title":"Sparse Bayesian Methods for Low-Rank Matrix Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC","stat.AP"],"primary_cat":"stat.ML","authors_text":"Aggelos K. Katsaggelos, Martin Luessi, Rafael Molina, S. Derin Babacan","submitted_at":"2011-02-25T17:13:00Z","abstract_excerpt":"Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by recent theoretical results for exact reconstruction guarantees and interesting practical applications. A number of methods have been developed for this recovery problem. However, a principled method for choosing the unknown target rank is generally not provided. In this paper, we present novel recovery algorithms for estimating low-rank matrices in matrix completion and robust principal component analysis based on sparse Bayesian learning (SBL) principles. Starting from a"},"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":"1102.5288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-25T17:13:00Z","cross_cats_sorted":["cs.LG","cs.SY","math.OC","stat.AP"],"title_canon_sha256":"d852f18ffa0a2aba8f7add4c65ba1a1b1caa0fe580c06b4e5ef7bb2fde730c20","abstract_canon_sha256":"c772d4f86eeeeed60f4e6e8acad14853a52ccb2f6a0e859ced8f6af0d944eb61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:46.979662Z","signature_b64":"hFETdOleQJ5UqT+4KqPhCDcX2CVLgXtxYaW8HWOLLpWef5N/APzLOMVzWlYqUdC/fqVodAwjfs2kjk3UuzgmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d23c983234e08e216f71f2c51cf520bf0d4264e3b19051673df7f366d029eb8c","last_reissued_at":"2026-05-18T04:13:46.979183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:46.979183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Bayesian Methods for Low-Rank Matrix Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC","stat.AP"],"primary_cat":"stat.ML","authors_text":"Aggelos K. Katsaggelos, Martin Luessi, Rafael Molina, S. Derin Babacan","submitted_at":"2011-02-25T17:13:00Z","abstract_excerpt":"Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by recent theoretical results for exact reconstruction guarantees and interesting practical applications. A number of methods have been developed for this recovery problem. However, a principled method for choosing the unknown target rank is generally not provided. In this paper, we present novel recovery algorithms for estimating low-rank matrices in matrix completion and robust principal component analysis based on sparse Bayesian learning (SBL) principles. Starting from a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5288","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.5288","created_at":"2026-05-18T04:13:46.979255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5288v2","created_at":"2026-05-18T04:13:46.979255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5288","created_at":"2026-05-18T04:13:46.979255+00:00"},{"alias_kind":"pith_short_12","alias_value":"2I6JQMRU4CHC","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2I6JQMRU4CHCC33R","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2I6JQMRU","created_at":"2026-05-18T12:26:18.847500+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/2I6JQMRU4CHCC33R6LCRZ5JAX4","json":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4.json","graph_json":"https://pith.science/api/pith-number/2I6JQMRU4CHCC33R6LCRZ5JAX4/graph.json","events_json":"https://pith.science/api/pith-number/2I6JQMRU4CHCC33R6LCRZ5JAX4/events.json","paper":"https://pith.science/paper/2I6JQMRU"},"agent_actions":{"view_html":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4","download_json":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4.json","view_paper":"https://pith.science/paper/2I6JQMRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5288&json=true","fetch_graph":"https://pith.science/api/pith-number/2I6JQMRU4CHCC33R6LCRZ5JAX4/graph.json","fetch_events":"https://pith.science/api/pith-number/2I6JQMRU4CHCC33R6LCRZ5JAX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/action/storage_attestation","attest_author":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/action/author_attestation","sign_citation":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/action/citation_signature","submit_replication":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/action/replication_record"}},"created_at":"2026-05-18T04:13:46.979255+00:00","updated_at":"2026-05-18T04:13:46.979255+00:00"}