{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LU2UTINGBP7G5JWMXDV7UK53R6","short_pith_number":"pith:LU2UTING","canonical_record":{"source":{"id":"1312.5783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-20T00:21:36Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"2e8102cccdcdc8e3e5552538e949073fb98005907f3177eef097c621357825ec","abstract_canon_sha256":"13feeada6422507e01b46f3673e00c1f57ddd98f762b170430f870034c8bfae0"},"schema_version":"1.0"},"canonical_sha256":"5d3549a1a60bfe6ea6ccb8ebfa2bbb8f86cfddd1d645290f498463734f1134c1","source":{"kind":"arxiv","id":"1312.5783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5783","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5783v1","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5783","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"LU2UTINGBP7G","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LU2UTINGBP7G5JWM","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LU2UTING","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LU2UTINGBP7G5JWMXDV7UK53R6","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-20T00:21:36Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"2e8102cccdcdc8e3e5552538e949073fb98005907f3177eef097c621357825ec","abstract_canon_sha256":"13feeada6422507e01b46f3673e00c1f57ddd98f762b170430f870034c8bfae0"},"schema_version":"1.0"},"canonical_sha256":"5d3549a1a60bfe6ea6ccb8ebfa2bbb8f86cfddd1d645290f498463734f1134c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:07.870936Z","signature_b64":"KvuCRUGTdv9aWgx7M+k1rJhqGQDi9XcgKsNQK/wpGezydyydj4r9w54QDfSmTSgc8FiULtcpSzxBg8In0l7sCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d3549a1a60bfe6ea6ccb8ebfa2bbb8f86cfddd1d645290f498463734f1134c1","last_reissued_at":"2026-05-18T03:04:07.870201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:07.870201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5783","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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thrDS+m5eQ1bNPgheEAa3g0AlggFoC4CnoaNKrdkRM+8jksSVrhL5hfPfbVn6zErM+pRTUmk1RYXINVMlrMbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:24:47.859346Z"},"content_sha256":"5790265654e4f430d9b758d7ab265c5a6f742b35733c3f2cbd90ceab152c6361","schema_version":"1.0","event_id":"sha256:5790265654e4f430d9b758d7ab265c5a6f742b35733c3f2cbd90ceab152c6361"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LU2UTINGBP7G5JWMXDV7UK53R6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Feature Learning by Deep Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Arthur Szlam, Koray Kavukcuoglu, Yanjun Qi, Yunlong He, Yun Wang","submitted_at":"2013-12-20T00:21:36Z","abstract_excerpt":"In this paper, we propose a new unsupervised feature learning framework, namely Deep Sparse Coding (DeepSC), that extends sparse coding to a multi-layer architecture for visual object recognition tasks. The main innovation of the framework is that it connects the sparse-encoders from different layers by a sparse-to-dense module. The sparse-to-dense module is a composition of a local spatial pooling step and a low-dimensional embedding process, which takes advantage of the spatial smoothness information in the image. As a result, the new method is able to learn several levels of sparse represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5783","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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6v8ULNe1lXZp5MyAdtGuJl1MpJwPVQgCtVouqLocEw0ZnuSSKKZtmUIqRdLCKIRBOrnkn6aj8MaIQsgFO+nQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:24:47.859988Z"},"content_sha256":"87a85b4e9e00b061232ec8dc5fd15bfcb9251a0a398a140c590be5fc0b0eb651","schema_version":"1.0","event_id":"sha256:87a85b4e9e00b061232ec8dc5fd15bfcb9251a0a398a140c590be5fc0b0eb651"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LU2UTINGBP7G5JWMXDV7UK53R6/bundle.json","state_url":"https://pith.science/pith/LU2UTINGBP7G5JWMXDV7UK53R6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LU2UTINGBP7G5JWMXDV7UK53R6/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-28T18:24:47Z","links":{"resolver":"https://pith.science/pith/LU2UTINGBP7G5JWMXDV7UK53R6","bundle":"https://pith.science/pith/LU2UTINGBP7G5JWMXDV7UK53R6/bundle.json","state":"https://pith.science/pith/LU2UTINGBP7G5JWMXDV7UK53R6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LU2UTINGBP7G5JWMXDV7UK53R6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LU2UTINGBP7G5JWMXDV7UK53R6","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":"13feeada6422507e01b46f3673e00c1f57ddd98f762b170430f870034c8bfae0","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-20T00:21:36Z","title_canon_sha256":"2e8102cccdcdc8e3e5552538e949073fb98005907f3177eef097c621357825ec"},"schema_version":"1.0","source":{"id":"1312.5783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5783","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5783v1","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5783","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"LU2UTINGBP7G","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LU2UTINGBP7G5JWM","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LU2UTING","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:87a85b4e9e00b061232ec8dc5fd15bfcb9251a0a398a140c590be5fc0b0eb651","target":"graph","created_at":"2026-05-18T03:04:07Z","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":"In this paper, we propose a new unsupervised feature learning framework, namely Deep Sparse Coding (DeepSC), that extends sparse coding to a multi-layer architecture for visual object recognition tasks. The main innovation of the framework is that it connects the sparse-encoders from different layers by a sparse-to-dense module. The sparse-to-dense module is a composition of a local spatial pooling step and a low-dimensional embedding process, which takes advantage of the spatial smoothness information in the image. As a result, the new method is able to learn several levels of sparse represen","authors_text":"Arthur Szlam, Koray Kavukcuoglu, Yanjun Qi, Yunlong He, Yun Wang","cross_cats":["cs.CV","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-20T00:21:36Z","title":"Unsupervised Feature Learning by Deep Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5783","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:5790265654e4f430d9b758d7ab265c5a6f742b35733c3f2cbd90ceab152c6361","target":"record","created_at":"2026-05-18T03:04:07Z","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":"13feeada6422507e01b46f3673e00c1f57ddd98f762b170430f870034c8bfae0","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-20T00:21:36Z","title_canon_sha256":"2e8102cccdcdc8e3e5552538e949073fb98005907f3177eef097c621357825ec"},"schema_version":"1.0","source":{"id":"1312.5783","kind":"arxiv","version":1}},"canonical_sha256":"5d3549a1a60bfe6ea6ccb8ebfa2bbb8f86cfddd1d645290f498463734f1134c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d3549a1a60bfe6ea6ccb8ebfa2bbb8f86cfddd1d645290f498463734f1134c1","first_computed_at":"2026-05-18T03:04:07.870201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:07.870201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KvuCRUGTdv9aWgx7M+k1rJhqGQDi9XcgKsNQK/wpGezydyydj4r9w54QDfSmTSgc8FiULtcpSzxBg8In0l7sCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:07.870936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5790265654e4f430d9b758d7ab265c5a6f742b35733c3f2cbd90ceab152c6361","sha256:87a85b4e9e00b061232ec8dc5fd15bfcb9251a0a398a140c590be5fc0b0eb651"],"state_sha256":"eefa54bcfa62341800a1c979ee00476389af7af255d34ee2624ee120a06e1eec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Ej4FulYZPWTMLBznv7bON7i+o4GLAc/Y/gjxSVqDPslo7AiwCHrn8El3J2ZWcIVjtpfiNPz9nBPCwb6ONYFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:24:47.863870Z","bundle_sha256":"77823262438118bd4794ffd7068f780065797388e6468676129b7228b6ad3840"}}