{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2XXL37TTYRSNI5NR2MN4IQVA27","short_pith_number":"pith:2XXL37TT","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"},"canonical_sha256":"d5eebdfe73c464d475b1d31bc442a0d7e84a4f31b049b981dcb2712671f9503e","source":{"kind":"arxiv","id":"1105.2493","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2493","created_at":"2026-05-18T04:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2493v6","created_at":"2026-05-18T04:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2493","created_at":"2026-05-18T04:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"2XXL37TTYRSN","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2XXL37TTYRSNI5NR","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2XXL37TT","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2XXL37TTYRSNI5NR2MN4IQVA27","target":"record","payload":{"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"},"canonical_sha256":"d5eebdfe73c464d475b1d31bc442a0d7e84a4f31b049b981dcb2712671f9503e","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"},"source_kind":"arxiv","source_id":"1105.2493","source_version":6,"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:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fI4xEGZ8gmoRVZAq9+Vv0htwpUeeo9Zkwtz8RneUC5clYEDWnvS/SdCIHYzo/CWckA1hm/5Ez/chAJIvD1w3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:03:43.407564Z"},"content_sha256":"30f23690e3fc868a55e6b25cb85711dcfd8670a8bac80a0acddeb1a553b3b72e","schema_version":"1.0","event_id":"sha256:30f23690e3fc868a55e6b25cb85711dcfd8670a8bac80a0acddeb1a553b3b72e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2XXL37TTYRSNI5NR2MN4IQVA27","target":"graph","payload":{"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"},"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:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fNV/qPFgjBkXtKM8sM3S+iUR/90pusUhAFkTM46Vtt99TqpszL6Q5oMbCFpIIY2Iee7YOi//msfm86uvvOJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:03:43.408074Z"},"content_sha256":"fbc5ad64c60393217dcf92c81bd48a2479d9e5b8faf4b897c1c01d01537f1d74","schema_version":"1.0","event_id":"sha256:fbc5ad64c60393217dcf92c81bd48a2479d9e5b8faf4b897c1c01d01537f1d74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/bundle.json","state_url":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XXL37TTYRSNI5NR2MN4IQVA27/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-08-05T00:03:43Z","links":{"resolver":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27","bundle":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/bundle.json","state":"https://pith.science/pith/2XXL37TTYRSNI5NR2MN4IQVA27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XXL37TTYRSNI5NR2MN4IQVA27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2XXL37TTYRSNI5NR2MN4IQVA27","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":"9062485e52b18d7a952a3c1431310853ab81ebcce8d0602d4b73a39f86b2b4fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-12T14:50:09Z","title_canon_sha256":"8f3b68ff1562b3c4919e6a126d0c91d8bbb885c72c6cc8b984bf6aa00abc908c"},"schema_version":"1.0","source":{"id":"1105.2493","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2493","created_at":"2026-05-18T04:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2493v6","created_at":"2026-05-18T04:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2493","created_at":"2026-05-18T04:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"2XXL37TTYRSN","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2XXL37TTYRSNI5NR","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2XXL37TT","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:fbc5ad64c60393217dcf92c81bd48a2479d9e5b8faf4b897c1c01d01537f1d74","target":"graph","created_at":"2026-05-18T04:01:02Z","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":"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","authors_text":"Abdul-Saboor Sheikh, J\\\"org L\\\"ucke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-12T14:50:09Z","title":"Closed-form EM for Sparse Coding and its Application to Source Separation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2493","kind":"arxiv","version":6},"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:30f23690e3fc868a55e6b25cb85711dcfd8670a8bac80a0acddeb1a553b3b72e","target":"record","created_at":"2026-05-18T04:01:02Z","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":"9062485e52b18d7a952a3c1431310853ab81ebcce8d0602d4b73a39f86b2b4fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-12T14:50:09Z","title_canon_sha256":"8f3b68ff1562b3c4919e6a126d0c91d8bbb885c72c6cc8b984bf6aa00abc908c"},"schema_version":"1.0","source":{"id":"1105.2493","kind":"arxiv","version":6}},"canonical_sha256":"d5eebdfe73c464d475b1d31bc442a0d7e84a4f31b049b981dcb2712671f9503e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5eebdfe73c464d475b1d31bc442a0d7e84a4f31b049b981dcb2712671f9503e","first_computed_at":"2026-05-18T04:01:02.013286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:02.013286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JaskcY+8LDo2PIAltWR8F5n16N00gEH/iRwoEk2T54EpV0+qYwUwxe9gwFUnMDDMuVR96Amz8G7QryWIHxM1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:02.016780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2493","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30f23690e3fc868a55e6b25cb85711dcfd8670a8bac80a0acddeb1a553b3b72e","sha256:fbc5ad64c60393217dcf92c81bd48a2479d9e5b8faf4b897c1c01d01537f1d74"],"state_sha256":"d84735488093e6f84ce8dd83cd94d3ac243ab6d092128f93fcde0a8e756c0d52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4C2bfiKNNFJdKW7Na1+JThBDQ9mcqnRLW9s8fTNuK4ZvGgcSj9fV5AUc5JEgqNJYobYy5SZRh9NkJPU6JhtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T00:03:43.415822Z","bundle_sha256":"c1ca7788296db307542540ac74d3e34188527b416784845745c5651f9310eaaf"}}