{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2I6JQMRU4CHCC33R6LCRZ5JAX4","short_pith_number":"pith:2I6JQMRU","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"},"canonical_sha256":"d23c983234e08e216f71f2c51cf520bf0d4264e3b19051673df7f366d029eb8c","source":{"kind":"arxiv","id":"1102.5288","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5288","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5288v2","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5288","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"2I6JQMRU4CHC","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2I6JQMRU4CHCC33R","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2I6JQMRU","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2I6JQMRU4CHCC33R6LCRZ5JAX4","target":"record","payload":{"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"},"canonical_sha256":"d23c983234e08e216f71f2c51cf520bf0d4264e3b19051673df7f366d029eb8c","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"},"source_kind":"arxiv","source_id":"1102.5288","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-18T04:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hlNA7HjahGjd6lRLPxoQqqczCtKGW0JbcYxjXzQkHJAXz/jZHaeQ9Pxeh7Xfx+bxt0vwl4QMnhhi5syebG5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:57:14.662177Z"},"content_sha256":"30f6484bae46b7bbd561a5499672401c281479dc3a38e7300df94aa71e99692e","schema_version":"1.0","event_id":"sha256:30f6484bae46b7bbd561a5499672401c281479dc3a38e7300df94aa71e99692e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2I6JQMRU4CHCC33R6LCRZ5JAX4","target":"graph","payload":{"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"},"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-18T04:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ZymUcIhwIj5Zw73o0Tl7dFbjLGIsKhwCDk0r2f/OuNmIGczsrUZlnNezVKIRLlumjaPe/1ZKvjCYZSd+0o3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:57:14.662617Z"},"content_sha256":"8281e90a4d9b47b7413dd7758d809310668e02a7eaa1ce21b91620ee581a8f25","schema_version":"1.0","event_id":"sha256:8281e90a4d9b47b7413dd7758d809310668e02a7eaa1ce21b91620ee581a8f25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/bundle.json","state_url":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/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-31T12:57:14Z","links":{"resolver":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4","bundle":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/bundle.json","state":"https://pith.science/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2I6JQMRU4CHCC33R6LCRZ5JAX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2I6JQMRU4CHCC33R6LCRZ5JAX4","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":"c772d4f86eeeeed60f4e6e8acad14853a52ccb2f6a0e859ced8f6af0d944eb61","cross_cats_sorted":["cs.LG","cs.SY","math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-25T17:13:00Z","title_canon_sha256":"d852f18ffa0a2aba8f7add4c65ba1a1b1caa0fe580c06b4e5ef7bb2fde730c20"},"schema_version":"1.0","source":{"id":"1102.5288","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5288","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5288v2","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5288","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"2I6JQMRU4CHC","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2I6JQMRU4CHCC33R","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2I6JQMRU","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:8281e90a4d9b47b7413dd7758d809310668e02a7eaa1ce21b91620ee581a8f25","target":"graph","created_at":"2026-05-18T04:13:46Z","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":"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","authors_text":"Aggelos K. Katsaggelos, Martin Luessi, Rafael Molina, S. Derin Babacan","cross_cats":["cs.LG","cs.SY","math.OC","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-25T17:13:00Z","title":"Sparse Bayesian Methods for Low-Rank Matrix Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5288","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:30f6484bae46b7bbd561a5499672401c281479dc3a38e7300df94aa71e99692e","target":"record","created_at":"2026-05-18T04:13:46Z","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":"c772d4f86eeeeed60f4e6e8acad14853a52ccb2f6a0e859ced8f6af0d944eb61","cross_cats_sorted":["cs.LG","cs.SY","math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-25T17:13:00Z","title_canon_sha256":"d852f18ffa0a2aba8f7add4c65ba1a1b1caa0fe580c06b4e5ef7bb2fde730c20"},"schema_version":"1.0","source":{"id":"1102.5288","kind":"arxiv","version":2}},"canonical_sha256":"d23c983234e08e216f71f2c51cf520bf0d4264e3b19051673df7f366d029eb8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d23c983234e08e216f71f2c51cf520bf0d4264e3b19051673df7f366d029eb8c","first_computed_at":"2026-05-18T04:13:46.979183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:46.979183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hFETdOleQJ5UqT+4KqPhCDcX2CVLgXtxYaW8HWOLLpWef5N/APzLOMVzWlYqUdC/fqVodAwjfs2kjk3UuzgmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:46.979662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5288","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30f6484bae46b7bbd561a5499672401c281479dc3a38e7300df94aa71e99692e","sha256:8281e90a4d9b47b7413dd7758d809310668e02a7eaa1ce21b91620ee581a8f25"],"state_sha256":"46516914c01249281d4e2dd965d9538c6ce2b315398ad8f35bf5bdfbe85db5c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OEUde+yCt9Tqzm7EMB3LD/NwPBpidpMiMsJszb/uTo8SkVgEPwf4PnNzEvZHRcjRS1FD2Ar2pjC1mbbRQopwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:57:14.665576Z","bundle_sha256":"0d4a3e3784ef5edf3adc5c02fd9584f394d456508d17d9f6de5df2e68340961d"}}