{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2XXL37TTYRSNI5NR2MN4IQVA27","short_pith_number":"pith:2XXL37TT","schema_version":"1.0","canonical_sha256":"d5eebdfe73c464d475b1d31bc442a0d7e84a4f31b049b981dcb2712671f9503e","source":{"kind":"arxiv","id":"1105.2493","version":6},"attestation_state":"computed","paper":{"title":"Closed-form EM for Sparse Coding and its Application to Source Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Abdul-Saboor Sheikh, J\\\"org L\\\"ucke","submitted_at":"2011-05-12T14:50:09Z","abstract_excerpt":"We define and discuss the first sparse coding algorithm based on closed-form EM updates and continuous latent variables. The underlying generative model consists of a standard `spike-and-slab' prior and a Gaussian noise model. Closed-form solutions for E- and M-step equations are derived by generalizing probabilistic PCA. The resulting EM algorithm can take all modes of a potentially multi-modal posterior into account. The computational cost of the algorithm scales exponentially with the number of hidden dimensions. However, with current computational resources, it is still possible to efficie"},"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":"1105.2493","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-12T14:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"8f3b68ff1562b3c4919e6a126d0c91d8bbb885c72c6cc8b984bf6aa00abc908c","abstract_canon_sha256":"9062485e52b18d7a952a3c1431310853ab81ebcce8d0602d4b73a39f86b2b4fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:02.016780Z","signature_b64":"JaskcY+8LDo2PIAltWR8F5n16N00gEH/iRwoEk2T54EpV0+qYwUwxe9gwFUnMDDMuVR96Amz8G7QryWIHxM1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5eebdfe73c464d475b1d31bc442a0d7e84a4f31b049b981dcb2712671f9503e","last_reissued_at":"2026-05-18T04:01:02.013286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:02.013286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closed-form EM for Sparse Coding and its Application to Source Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Abdul-Saboor Sheikh, J\\\"org L\\\"ucke","submitted_at":"2011-05-12T14:50:09Z","abstract_excerpt":"We define and discuss the first sparse coding algorithm based on closed-form EM updates and continuous latent variables. The underlying generative model consists of a standard `spike-and-slab' prior and a Gaussian noise model. Closed-form solutions for E- and M-step equations are derived by generalizing probabilistic PCA. The resulting EM algorithm can take all modes of a potentially multi-modal posterior into account. The computational cost of the algorithm scales exponentially with the number of hidden dimensions. However, with current computational resources, it is still possible to efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2493","kind":"arxiv","version":6},"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":"1105.2493","created_at":"2026-05-18T04:01:02.013381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2493v6","created_at":"2026-05-18T04:01:02.013381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2493","created_at":"2026-05-18T04:01:02.013381+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XXL37TTYRSN","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XXL37TTYRSNI5NR","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XXL37TT","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/2XXL37TTYRSNI5NR2MN4IQVA27","json":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27.json","graph_json":"https://pith.science/api/pith-number/2XXL37TTYRSNI5NR2MN4IQVA27/graph.json","events_json":"https://pith.science/api/pith-number/2XXL37TTYRSNI5NR2MN4IQVA27/events.json","paper":"https://pith.science/paper/2XXL37TT"},"agent_actions":{"view_html":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27","download_json":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27.json","view_paper":"https://pith.science/paper/2XXL37TT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2493&json=true","fetch_graph":"https://pith.science/api/pith-number/2XXL37TTYRSNI5NR2MN4IQVA27/graph.json","fetch_events":"https://pith.science/api/pith-number/2XXL37TTYRSNI5NR2MN4IQVA27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/action/storage_attestation","attest_author":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/action/author_attestation","sign_citation":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/action/citation_signature","submit_replication":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/action/replication_record"}},"created_at":"2026-05-18T04:01:02.013381+00:00","updated_at":"2026-05-18T04:01:02.013381+00:00"}