{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BONF7VUHBE7DHFWXHY3QCUXQG7","short_pith_number":"pith:BONF7VUH","schema_version":"1.0","canonical_sha256":"0b9a5fd687093e3396d73e370152f037cb80d70b4db68009da0ef5ee721381ad","source":{"kind":"arxiv","id":"1709.02893","version":5},"attestation_state":"computed","paper":{"title":"Convolutional Dictionary Learning: A Comparative Review and New Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendt Wohlberg, Cristina Garcia-Cardona","submitted_at":"2017-09-09T01:45:43Z","abstract_excerpt":"Convolutional sparse representations are a form of sparse representation with a dictionary that has a structure that is equivalent to convolution with a set of linear filters. While effective algorithms have recently been developed for the convolutional sparse coding problem, the corresponding dictionary learning problem is substantially more challenging. Furthermore, although a number of different approaches have been proposed, the absence of thorough comparisons between them makes it difficult to determine which of them represents the current state of the art. The present work both addresses"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1709.02893","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-09T01:45:43Z","cross_cats_sorted":["eess.IV","stat.ML"],"title_canon_sha256":"9216b490188204a39d4902861c980413426410b2cec5b1d9211b3d02d713eb8d","abstract_canon_sha256":"992f207a811b2f94f4befe11ed28c9cbe62890bde79829b73868c3ca8b0d0893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:30.958401Z","signature_b64":"t70LutLbmvmr1tO7tHN5G4aAaFfovr3NVdVsVRzLIm3UJxWOxV67YfulxUxA41M/3v6kFYHRrgbZz/3NiMUAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b9a5fd687093e3396d73e370152f037cb80d70b4db68009da0ef5ee721381ad","last_reissued_at":"2026-05-18T00:06:30.957937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:30.957937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convolutional Dictionary Learning: A Comparative Review and New Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendt Wohlberg, Cristina Garcia-Cardona","submitted_at":"2017-09-09T01:45:43Z","abstract_excerpt":"Convolutional sparse representations are a form of sparse representation with a dictionary that has a structure that is equivalent to convolution with a set of linear filters. While effective algorithms have recently been developed for the convolutional sparse coding problem, the corresponding dictionary learning problem is substantially more challenging. Furthermore, although a number of different approaches have been proposed, the absence of thorough comparisons between them makes it difficult to determine which of them represents the current state of the art. The present work both addresses"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02893","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.02893","created_at":"2026-05-18T00:06:30.958006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02893v5","created_at":"2026-05-18T00:06:30.958006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02893","created_at":"2026-05-18T00:06:30.958006+00:00"},{"alias_kind":"pith_short_12","alias_value":"BONF7VUHBE7D","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BONF7VUHBE7DHFWX","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BONF7VUH","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7","json":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7.json","graph_json":"https://pith.science/api/pith-number/BONF7VUHBE7DHFWXHY3QCUXQG7/graph.json","events_json":"https://pith.science/api/pith-number/BONF7VUHBE7DHFWXHY3QCUXQG7/events.json","paper":"https://pith.science/paper/BONF7VUH"},"agent_actions":{"view_html":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7","download_json":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7.json","view_paper":"https://pith.science/paper/BONF7VUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02893&json=true","fetch_graph":"https://pith.science/api/pith-number/BONF7VUHBE7DHFWXHY3QCUXQG7/graph.json","fetch_events":"https://pith.science/api/pith-number/BONF7VUHBE7DHFWXHY3QCUXQG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7/action/storage_attestation","attest_author":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7/action/author_attestation","sign_citation":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7/action/citation_signature","submit_replication":"https://pith.science/pith/BONF7VUHBE7DHFWXHY3QCUXQG7/action/replication_record"}},"created_at":"2026-05-18T00:06:30.958006+00:00","updated_at":"2026-05-18T00:06:30.958006+00:00"}