{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IQHEQAXPEZRLL73OV7CQS42HF2","short_pith_number":"pith:IQHEQAXP","canonical_record":{"source":{"id":"1206.6407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1440820c24236df8d130e7edaaec254a0e1a89002a7da5e94332c2c256421eae","abstract_canon_sha256":"24c15a04180777a85c34da6b0f3cb8d1fd7c9fffdaa85a29c0e2a4c6c150210a"},"schema_version":"1.0"},"canonical_sha256":"440e4802ef2662b5ff6eafc50973472e8fa527e1ca3f8fb572f75a49a0a3eff4","source":{"kind":"arxiv","id":"1206.6407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6407","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6407v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6407","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"IQHEQAXPEZRL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IQHEQAXPEZRLL73O","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IQHEQAXP","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IQHEQAXPEZRLL73OV7CQS42HF2","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1440820c24236df8d130e7edaaec254a0e1a89002a7da5e94332c2c256421eae","abstract_canon_sha256":"24c15a04180777a85c34da6b0f3cb8d1fd7c9fffdaa85a29c0e2a4c6c150210a"},"schema_version":"1.0"},"canonical_sha256":"440e4802ef2662b5ff6eafc50973472e8fa527e1ca3f8fb572f75a49a0a3eff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:14.392404Z","signature_b64":"8F2AdmSRoNd+RKLRT8fkelhiI2V0iZOK+h+iJ0pH2iUjpUYL94AO05umD4ydcbZrOdQwCqC8V1mKK2Jkybp+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"440e4802ef2662b5ff6eafc50973472e8fa527e1ca3f8fb572f75a49a0a3eff4","last_reissued_at":"2026-05-18T03:52:14.391677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:14.391677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6407","source_version":1,"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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZAFI7s+93B9whXTANN7m0nYDh2ntvWCKS6JchVO5rSF/AlsKq0gVSNQRQxCIdsWDyne8A14rpAgNuZyKvufAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:36:27.039120Z"},"content_sha256":"f2761f082d829175be35bbb1cd8e871f9b41980394187bddd93897ee874ebcc2","schema_version":"1.0","event_id":"sha256:f2761f082d829175be35bbb1cd8e871f9b41980394187bddd93897ee874ebcc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IQHEQAXPEZRLL73OV7CQS42HF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Scale Feature Learning With Spike-and-Slab Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Courville (Universite de Montreal), Ian Goodfellow (Universite de Montreal), Yoshua Bengio (Universite de Montreal)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We consider the problem of object recognition with a large number of classes. In order to overcome the low amount of labeled examples available in this setting, we introduce a new feature learning and extraction procedure based on a factor model we call spike-and-slab sparse coding (S3C). Prior work on S3C has not prioritized the ability to exploit parallel architectures and scale S3C to the enormous problem sizes needed for object recognition. We present a novel inference procedure for appropriate for use with GPUs which allows us to dramatically increase both the training set size and the am"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6407","kind":"arxiv","version":1},"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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXgvMBcBwv+baeZouDR0bwNeKBX4wc7s7QaBCvndKER0kLhJu0lDlgq2HtSu9pZCZpITxGIdAEx0bhcYcJ0WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:36:27.039774Z"},"content_sha256":"833b1a84af65c3d27bf1b166321ca600acf84cd9939d7fbc015cc3401e9b1a08","schema_version":"1.0","event_id":"sha256:833b1a84af65c3d27bf1b166321ca600acf84cd9939d7fbc015cc3401e9b1a08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQHEQAXPEZRLL73OV7CQS42HF2/bundle.json","state_url":"https://pith.science/pith/IQHEQAXPEZRLL73OV7CQS42HF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQHEQAXPEZRLL73OV7CQS42HF2/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-06-09T08:36:27Z","links":{"resolver":"https://pith.science/pith/IQHEQAXPEZRLL73OV7CQS42HF2","bundle":"https://pith.science/pith/IQHEQAXPEZRLL73OV7CQS42HF2/bundle.json","state":"https://pith.science/pith/IQHEQAXPEZRLL73OV7CQS42HF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQHEQAXPEZRLL73OV7CQS42HF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IQHEQAXPEZRLL73OV7CQS42HF2","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":"24c15a04180777a85c34da6b0f3cb8d1fd7c9fffdaa85a29c0e2a4c6c150210a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"1440820c24236df8d130e7edaaec254a0e1a89002a7da5e94332c2c256421eae"},"schema_version":"1.0","source":{"id":"1206.6407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6407","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6407v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6407","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"IQHEQAXPEZRL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IQHEQAXPEZRLL73O","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IQHEQAXP","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:833b1a84af65c3d27bf1b166321ca600acf84cd9939d7fbc015cc3401e9b1a08","target":"graph","created_at":"2026-05-18T03:52:14Z","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 consider the problem of object recognition with a large number of classes. In order to overcome the low amount of labeled examples available in this setting, we introduce a new feature learning and extraction procedure based on a factor model we call spike-and-slab sparse coding (S3C). Prior work on S3C has not prioritized the ability to exploit parallel architectures and scale S3C to the enormous problem sizes needed for object recognition. We present a novel inference procedure for appropriate for use with GPUs which allows us to dramatically increase both the training set size and the am","authors_text":"Aaron Courville (Universite de Montreal), Ian Goodfellow (Universite de Montreal), Yoshua Bengio (Universite de Montreal)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title":"Large-Scale Feature Learning With Spike-and-Slab Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6407","kind":"arxiv","version":1},"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:f2761f082d829175be35bbb1cd8e871f9b41980394187bddd93897ee874ebcc2","target":"record","created_at":"2026-05-18T03:52:14Z","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":"24c15a04180777a85c34da6b0f3cb8d1fd7c9fffdaa85a29c0e2a4c6c150210a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"1440820c24236df8d130e7edaaec254a0e1a89002a7da5e94332c2c256421eae"},"schema_version":"1.0","source":{"id":"1206.6407","kind":"arxiv","version":1}},"canonical_sha256":"440e4802ef2662b5ff6eafc50973472e8fa527e1ca3f8fb572f75a49a0a3eff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"440e4802ef2662b5ff6eafc50973472e8fa527e1ca3f8fb572f75a49a0a3eff4","first_computed_at":"2026-05-18T03:52:14.391677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:14.391677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8F2AdmSRoNd+RKLRT8fkelhiI2V0iZOK+h+iJ0pH2iUjpUYL94AO05umD4ydcbZrOdQwCqC8V1mKK2Jkybp+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:14.392404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2761f082d829175be35bbb1cd8e871f9b41980394187bddd93897ee874ebcc2","sha256:833b1a84af65c3d27bf1b166321ca600acf84cd9939d7fbc015cc3401e9b1a08"],"state_sha256":"04d63d68bffa5af9d2ddd8bc8da649735625fd3c3218611698664530ab6ea519"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQnQSnXk8POHUTR31kY72L5xgli1KHLVPOZeeoa+nVP9x8fV3AxwXwD/X28YE+C+Rfq+dyao7yIbPYmPueW4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:36:27.043693Z","bundle_sha256":"636e0dc9c2f50648b1ad0d7cb07f7c7792b037e88211b8e36ed878f737c9834e"}}