{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AX25D2NH42K5RSUEHBHA4FOPXU","short_pith_number":"pith:AX25D2NH","canonical_record":{"source":{"id":"1806.00701","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-02T20:31:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0a35df917a9a19ae21e12c7d306203891c77a84c75259111f835bfe6d6668e36","abstract_canon_sha256":"2093f911fc5c051ef7e8dc497b36f4176dd10576e153acd343b8a1e6a7b0c3eb"},"schema_version":"1.0"},"canonical_sha256":"05f5d1e9a7e695d8ca84384e0e15cfbd2e559f04f54632269fca8ef6cc2eda33","source":{"kind":"arxiv","id":"1806.00701","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00701","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00701v5","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00701","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"AX25D2NH42K5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AX25D2NH42K5RSUE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AX25D2NH","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AX25D2NH42K5RSUEHBHA4FOPXU","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00701","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-02T20:31:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0a35df917a9a19ae21e12c7d306203891c77a84c75259111f835bfe6d6668e36","abstract_canon_sha256":"2093f911fc5c051ef7e8dc497b36f4176dd10576e153acd343b8a1e6a7b0c3eb"},"schema_version":"1.0"},"canonical_sha256":"05f5d1e9a7e695d8ca84384e0e15cfbd2e559f04f54632269fca8ef6cc2eda33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:13.110727Z","signature_b64":"dNz5q6egz0+9NggSpDjCd5kcgCoklWjZLEdV664yEejpbahfliu68Tgt+n4B2t6JHt8dWGIZTuCHTq1ZT0P/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05f5d1e9a7e695d8ca84384e0e15cfbd2e559f04f54632269fca8ef6cc2eda33","last_reissued_at":"2026-05-18T00:00:13.110099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:13.110099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00701","source_version":5,"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:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xwSVvWhr8OFQNTmMtdcLUrVNN45Oxdhxqc80fc258LpCT5s290bZJ1E8dJqu0M0gCJ+zwx876lIbFeMT8wsyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:35:32.663384Z"},"content_sha256":"ff84089e13b8a84e7b3fee622deb1216b7e63ed5e36597fcf3f2739d70f1a0ce","schema_version":"1.0","event_id":"sha256:ff84089e13b8a84e7b3fee622deb1216b7e63ed5e36597fcf3f2739d70f1a0ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AX25D2NH42K5RSUEHBHA4FOPXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Multi-Layer Basis Pursuit, Efficient Algorithms and Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir Beck, Aviad Aberdam, Jeremias Sulam, Michael Elad","submitted_at":"2018-06-02T20:31:30Z","abstract_excerpt":"Parsimonious representations are ubiquitous in modeling and processing information. Motivated by the recent Multi-Layer Convolutional Sparse Coding (ML-CSC) model, we herein generalize the traditional Basis Pursuit problem to a multi-layer setting, introducing similar sparse enforcing penalties at different representation layers in a symbiotic relation between synthesis and analysis sparse priors. We explore different iterative methods to solve this new problem in practice, and we propose a new Multi-Layer Iterative Soft Thresholding Algorithm (ML-ISTA), as well as a fast version (ML-FISTA). W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00701","kind":"arxiv","version":5},"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:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kJ5e8iEENJD8fIpkjAH3/P2VMk0Qa6EHodWFKNd3WRWoNQzXtchtjZglfTWS6Di9KSxAsJFp0Km52JB8nRQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:35:32.664047Z"},"content_sha256":"9747d91b66ebf3d37e97c3693135d596960b67e52d56cbb760c0310daeeaa613","schema_version":"1.0","event_id":"sha256:9747d91b66ebf3d37e97c3693135d596960b67e52d56cbb760c0310daeeaa613"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/bundle.json","state_url":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AX25D2NH42K5RSUEHBHA4FOPXU/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-27T07:35:32Z","links":{"resolver":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU","bundle":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/bundle.json","state":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AX25D2NH42K5RSUEHBHA4FOPXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AX25D2NH42K5RSUEHBHA4FOPXU","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":"2093f911fc5c051ef7e8dc497b36f4176dd10576e153acd343b8a1e6a7b0c3eb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-02T20:31:30Z","title_canon_sha256":"0a35df917a9a19ae21e12c7d306203891c77a84c75259111f835bfe6d6668e36"},"schema_version":"1.0","source":{"id":"1806.00701","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00701","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00701v5","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00701","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"AX25D2NH42K5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AX25D2NH42K5RSUE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AX25D2NH","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:9747d91b66ebf3d37e97c3693135d596960b67e52d56cbb760c0310daeeaa613","target":"graph","created_at":"2026-05-18T00:00:13Z","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":"Parsimonious representations are ubiquitous in modeling and processing information. Motivated by the recent Multi-Layer Convolutional Sparse Coding (ML-CSC) model, we herein generalize the traditional Basis Pursuit problem to a multi-layer setting, introducing similar sparse enforcing penalties at different representation layers in a symbiotic relation between synthesis and analysis sparse priors. We explore different iterative methods to solve this new problem in practice, and we propose a new Multi-Layer Iterative Soft Thresholding Algorithm (ML-ISTA), as well as a fast version (ML-FISTA). W","authors_text":"Amir Beck, Aviad Aberdam, Jeremias Sulam, Michael Elad","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-02T20:31:30Z","title":"On Multi-Layer Basis Pursuit, Efficient Algorithms and Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00701","kind":"arxiv","version":5},"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:ff84089e13b8a84e7b3fee622deb1216b7e63ed5e36597fcf3f2739d70f1a0ce","target":"record","created_at":"2026-05-18T00:00:13Z","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":"2093f911fc5c051ef7e8dc497b36f4176dd10576e153acd343b8a1e6a7b0c3eb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-02T20:31:30Z","title_canon_sha256":"0a35df917a9a19ae21e12c7d306203891c77a84c75259111f835bfe6d6668e36"},"schema_version":"1.0","source":{"id":"1806.00701","kind":"arxiv","version":5}},"canonical_sha256":"05f5d1e9a7e695d8ca84384e0e15cfbd2e559f04f54632269fca8ef6cc2eda33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05f5d1e9a7e695d8ca84384e0e15cfbd2e559f04f54632269fca8ef6cc2eda33","first_computed_at":"2026-05-18T00:00:13.110099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:13.110099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dNz5q6egz0+9NggSpDjCd5kcgCoklWjZLEdV664yEejpbahfliu68Tgt+n4B2t6JHt8dWGIZTuCHTq1ZT0P/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:13.110727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00701","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff84089e13b8a84e7b3fee622deb1216b7e63ed5e36597fcf3f2739d70f1a0ce","sha256:9747d91b66ebf3d37e97c3693135d596960b67e52d56cbb760c0310daeeaa613"],"state_sha256":"1f952e6e6c1a0ca54889295df16e4a465dc8fac61fc16b64e749904718f5fe79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EPFqCl0rCyOODINvkPdE4IJLS1+8lTvlYWfaP2sDWC6LQYOjvmde/TB9hFAJiVia9+J6I4Q8J38hRIgnMsKADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:35:32.667441Z","bundle_sha256":"8adaa28f2c9c948940517939a22855d1641b452ae9375fa49cdcabd89cdb3bd1"}}