{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A7BCCCKXUCPSLVFKTINCPXKJIN","short_pith_number":"pith:A7BCCCKX","canonical_record":{"source":{"id":"1807.04734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T17:18:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"468fd117a4b30aa3a4c50d6c8194923da67d3a1882edca1731d49e6c06705979","abstract_canon_sha256":"ad08673f64f01db6fc802de49a0194c065585a6c5b06208c991cd00229950fe0"},"schema_version":"1.0"},"canonical_sha256":"07c2210957a09f25d4aa9a1a27dd49437b49e7c490a8e684cf6756e7f3bd4ac5","source":{"kind":"arxiv","id":"1807.04734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04734","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04734v1","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04734","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"A7BCCCKXUCPS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A7BCCCKXUCPSLVFK","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A7BCCCKX","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A7BCCCKXUCPSLVFKTINCPXKJIN","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T17:18:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"468fd117a4b30aa3a4c50d6c8194923da67d3a1882edca1731d49e6c06705979","abstract_canon_sha256":"ad08673f64f01db6fc802de49a0194c065585a6c5b06208c991cd00229950fe0"},"schema_version":"1.0"},"canonical_sha256":"07c2210957a09f25d4aa9a1a27dd49437b49e7c490a8e684cf6756e7f3bd4ac5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:52.662277Z","signature_b64":"ZejnTebjd4dBWGX6zOE0wt92fjluuSpGokU6SPWpIfrFvsItZPsDTYxzowRh7QJJ3CMcgcR9RLxFCkjXRbEoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07c2210957a09f25d4aa9a1a27dd49437b49e7c490a8e684cf6756e7f3bd4ac5","last_reissued_at":"2026-05-18T00:10:52.661567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:52.661567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04734","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-18T00:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dtHhJcqSMNSP2NneDHdt25DGe58KGu7y45+WSYDGnk378fHaZg2PPTLWgwN41l041wzIWvLIq8at++b+4WYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:42:40.486884Z"},"content_sha256":"4cc2fc141a2ac285285a1d5cc789a4229faa87485db2c3c94666742b986ac7f0","schema_version":"1.0","event_id":"sha256:4cc2fc141a2ac285285a1d5cc789a4229faa87485db2c3c94666742b986ac7f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A7BCCCKXUCPSLVFKTINCPXKJIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Convolutional Dictionary Learning with Constrained Recurrent Sparse Auto-encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bahareh Tolooshams, Demba Ba, Sourav Dey","submitted_at":"2018-07-12T17:18:37Z","abstract_excerpt":"Given a convolutional dictionary underlying a set of observed signals, can a carefully designed auto-encoder recover the dictionary in the presence of noise? We introduce an auto-encoder architecture, termed constrained recurrent sparse auto-encoder (CRsAE), that answers this question in the affirmative. Given an input signal and an approximate dictionary, the encoder finds a sparse approximation using FISTA. The decoder reconstructs the signal by applying the dictionary to the output of the encoder. The encoder and decoder in CRsAE parallel the sparse-coding and dictionary update steps in opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04734","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-18T00:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mgs3SXBVHpU2EMAZKbULbKSqj95nY3fqfbPTtmFSlCkKX4XPgs4j0XzaGLg8GNbmzi8rB+P4D93PknkXFosECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:42:40.487583Z"},"content_sha256":"7f75057195848464d5726ee441c42b59d44ed7ca595539f18dc050575fe67030","schema_version":"1.0","event_id":"sha256:7f75057195848464d5726ee441c42b59d44ed7ca595539f18dc050575fe67030"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7BCCCKXUCPSLVFKTINCPXKJIN/bundle.json","state_url":"https://pith.science/pith/A7BCCCKXUCPSLVFKTINCPXKJIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7BCCCKXUCPSLVFKTINCPXKJIN/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-27T23:42:40Z","links":{"resolver":"https://pith.science/pith/A7BCCCKXUCPSLVFKTINCPXKJIN","bundle":"https://pith.science/pith/A7BCCCKXUCPSLVFKTINCPXKJIN/bundle.json","state":"https://pith.science/pith/A7BCCCKXUCPSLVFKTINCPXKJIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7BCCCKXUCPSLVFKTINCPXKJIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A7BCCCKXUCPSLVFKTINCPXKJIN","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":"ad08673f64f01db6fc802de49a0194c065585a6c5b06208c991cd00229950fe0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T17:18:37Z","title_canon_sha256":"468fd117a4b30aa3a4c50d6c8194923da67d3a1882edca1731d49e6c06705979"},"schema_version":"1.0","source":{"id":"1807.04734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04734","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04734v1","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04734","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"A7BCCCKXUCPS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A7BCCCKXUCPSLVFK","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A7BCCCKX","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:7f75057195848464d5726ee441c42b59d44ed7ca595539f18dc050575fe67030","target":"graph","created_at":"2026-05-18T00:10:52Z","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":"Given a convolutional dictionary underlying a set of observed signals, can a carefully designed auto-encoder recover the dictionary in the presence of noise? We introduce an auto-encoder architecture, termed constrained recurrent sparse auto-encoder (CRsAE), that answers this question in the affirmative. Given an input signal and an approximate dictionary, the encoder finds a sparse approximation using FISTA. The decoder reconstructs the signal by applying the dictionary to the output of the encoder. The encoder and decoder in CRsAE parallel the sparse-coding and dictionary update steps in opt","authors_text":"Bahareh Tolooshams, Demba Ba, Sourav Dey","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T17:18:37Z","title":"Scalable Convolutional Dictionary Learning with Constrained Recurrent Sparse Auto-encoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04734","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:4cc2fc141a2ac285285a1d5cc789a4229faa87485db2c3c94666742b986ac7f0","target":"record","created_at":"2026-05-18T00:10:52Z","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":"ad08673f64f01db6fc802de49a0194c065585a6c5b06208c991cd00229950fe0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T17:18:37Z","title_canon_sha256":"468fd117a4b30aa3a4c50d6c8194923da67d3a1882edca1731d49e6c06705979"},"schema_version":"1.0","source":{"id":"1807.04734","kind":"arxiv","version":1}},"canonical_sha256":"07c2210957a09f25d4aa9a1a27dd49437b49e7c490a8e684cf6756e7f3bd4ac5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07c2210957a09f25d4aa9a1a27dd49437b49e7c490a8e684cf6756e7f3bd4ac5","first_computed_at":"2026-05-18T00:10:52.661567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:52.661567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZejnTebjd4dBWGX6zOE0wt92fjluuSpGokU6SPWpIfrFvsItZPsDTYxzowRh7QJJ3CMcgcR9RLxFCkjXRbEoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:52.662277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cc2fc141a2ac285285a1d5cc789a4229faa87485db2c3c94666742b986ac7f0","sha256:7f75057195848464d5726ee441c42b59d44ed7ca595539f18dc050575fe67030"],"state_sha256":"d62f23f7521f87d80b188db305cc734a4388a5d0b9004b557f59fa70254adea5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uf3soTp5CL3TTOUgFVvlWDN1lizCuu0cuTPHbH6tMpSiJbZYBfYQgwJJo8aFpv4nl7h0WwLkS0y3pV2nwcPIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:42:40.491125Z","bundle_sha256":"4f6e0fc14b47226f274b1abeef45787b6d839bd61af283cc0cbab6e70b16efcc"}}