{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OUDDCEP3CDV63CK24XZPKBZLGC","short_pith_number":"pith:OUDDCEP3","schema_version":"1.0","canonical_sha256":"75063111fb10ebed895ae5f2f5072b30bc58ade82e553aac95c960bb36e6531e","source":{"kind":"arxiv","id":"1211.3589","version":3},"attestation_state":"computed","paper":{"title":"A Truncated EM Approach for Spike-and-Slab Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Abdul-Saboor Sheikh, Jacquelyn A. Shelton, J\\\"org L\\\"ucke","submitted_at":"2012-11-15T12:34:07Z","abstract_excerpt":"We study inference and learning based on a sparse coding model with `spike-and-slab' prior. As in standard sparse coding, the model used assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the application of a more flexible `spike-and-slab' distribution which models the absence or presence of a source's contribution independently of its strength if it contributes. We investigate two approaches to optimize the parameters of spike-and-slab sparse coding: a novel truncated EM 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":"1211.3589","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-11-15T12:34:07Z","cross_cats_sorted":[],"title_canon_sha256":"1291281b26e3cdd38ff7f5329c60d190755850a862303c363263d644ca6d264c","abstract_canon_sha256":"e025f36ac7452e31be26a50177259d9cf2b8f27b2e17dc68ca4bccee406c76f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:01.315760Z","signature_b64":"BepCaf33JLezugxxnUvBLvx3naHUrNbgMB3bKbg5tofPCbpdbtW9O5aL4FE4c3WazAU0RSRftRfSDk+CQLVBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75063111fb10ebed895ae5f2f5072b30bc58ade82e553aac95c960bb36e6531e","last_reissued_at":"2026-05-18T02:41:01.315248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:01.315248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Truncated EM Approach for Spike-and-Slab Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Abdul-Saboor Sheikh, Jacquelyn A. Shelton, J\\\"org L\\\"ucke","submitted_at":"2012-11-15T12:34:07Z","abstract_excerpt":"We study inference and learning based on a sparse coding model with `spike-and-slab' prior. As in standard sparse coding, the model used assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the application of a more flexible `spike-and-slab' distribution which models the absence or presence of a source's contribution independently of its strength if it contributes. We investigate two approaches to optimize the parameters of spike-and-slab sparse coding: a novel truncated EM a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3589","kind":"arxiv","version":3},"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":"1211.3589","created_at":"2026-05-18T02:41:01.315331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3589v3","created_at":"2026-05-18T02:41:01.315331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3589","created_at":"2026-05-18T02:41:01.315331+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUDDCEP3CDV6","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUDDCEP3CDV63CK2","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUDDCEP3","created_at":"2026-05-18T12:27:16.716162+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/OUDDCEP3CDV63CK24XZPKBZLGC","json":"https://pith.science/pith/OUDDCEP3CDV63CK24XZPKBZLGC.json","graph_json":"https://pith.science/api/pith-number/OUDDCEP3CDV63CK24XZPKBZLGC/graph.json","events_json":"https://pith.science/api/pith-number/OUDDCEP3CDV63CK24XZPKBZLGC/events.json","paper":"https://pith.science/paper/OUDDCEP3"},"agent_actions":{"view_html":"https://pith.science/pith/OUDDCEP3CDV63CK24XZPKBZLGC","download_json":"https://pith.science/pith/OUDDCEP3CDV63CK24XZPKBZLGC.json","view_paper":"https://pith.science/paper/OUDDCEP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3589&json=true","fetch_graph":"https://pith.science/api/pith-number/OUDDCEP3CDV63CK24XZPKBZLGC/graph.json","fetch_events":"https://pith.science/api/pith-number/OUDDCEP3CDV63CK24XZPKBZLGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUDDCEP3CDV63CK24XZPKBZLGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUDDCEP3CDV63CK24XZPKBZLGC/action/storage_attestation","attest_author":"https://pith.science/pith/OUDDCEP3CDV63CK24XZPKBZLGC/action/author_attestation","sign_citation":"https://pith.science/pith/OUDDCEP3CDV63CK24XZPKBZLGC/action/citation_signature","submit_replication":"https://pith.science/pith/OUDDCEP3CDV63CK24XZPKBZLGC/action/replication_record"}},"created_at":"2026-05-18T02:41:01.315331+00:00","updated_at":"2026-05-18T02:41:01.315331+00:00"}