{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4YBYDHPHJKOVVZ7DLDYW4A4KJG","short_pith_number":"pith:4YBYDHPH","schema_version":"1.0","canonical_sha256":"e603819de74a9d5ae7e358f16e038a498f797608581a89709dede13539914803","source":{"kind":"arxiv","id":"1607.02005","version":2},"attestation_state":"computed","paper":{"title":"Working Locally Thinking Globally - Part I: Theoretical Guarantees for Convolutional Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jeremias Sulam, Michael Elad, Vardan Papyan","submitted_at":"2016-07-07T13:32:17Z","abstract_excerpt":"The celebrated sparse representation model has led to remarkable results in various signal processing tasks in the last decade. However, despite its initial purpose of serving as a global prior for entire signals, it has been commonly used for modeling low dimensional patches due to the computational constraints it entails when deployed with learned dictionaries. A way around this problem has been proposed recently, adopting a convolutional sparse representation model. This approach assumes that the global dictionary is a concatenation of banded Circulant matrices. Although several works have "},"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":"1607.02005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T13:32:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"405a122a485e9d131649009fbbcf666bd42c40878d6c9f79adcf76291f12c88d","abstract_canon_sha256":"39616d8472c6787575f25d74f739f13634599cded9a1de112b75aa7882040369"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:13.629825Z","signature_b64":"z6lbdpEMOo/a7M42Q/mE0lllyswvOzQmYrvvdRyZ9w1VqFl16foA6tswXkcCTh53R6TxfVlolysTws7eQaVCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e603819de74a9d5ae7e358f16e038a498f797608581a89709dede13539914803","last_reissued_at":"2026-05-18T00:50:13.629376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:13.629376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Working Locally Thinking Globally - Part I: Theoretical Guarantees for Convolutional Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jeremias Sulam, Michael Elad, Vardan Papyan","submitted_at":"2016-07-07T13:32:17Z","abstract_excerpt":"The celebrated sparse representation model has led to remarkable results in various signal processing tasks in the last decade. However, despite its initial purpose of serving as a global prior for entire signals, it has been commonly used for modeling low dimensional patches due to the computational constraints it entails when deployed with learned dictionaries. A way around this problem has been proposed recently, adopting a convolutional sparse representation model. This approach assumes that the global dictionary is a concatenation of banded Circulant matrices. Although several works have "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02005","kind":"arxiv","version":2},"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":"1607.02005","created_at":"2026-05-18T00:50:13.629440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02005v2","created_at":"2026-05-18T00:50:13.629440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02005","created_at":"2026-05-18T00:50:13.629440+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YBYDHPHJKOV","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YBYDHPHJKOVVZ7D","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YBYDHPH","created_at":"2026-05-18T12:29:58.707656+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/4YBYDHPHJKOVVZ7DLDYW4A4KJG","json":"https://pith.science/pith/4YBYDHPHJKOVVZ7DLDYW4A4KJG.json","graph_json":"https://pith.science/api/pith-number/4YBYDHPHJKOVVZ7DLDYW4A4KJG/graph.json","events_json":"https://pith.science/api/pith-number/4YBYDHPHJKOVVZ7DLDYW4A4KJG/events.json","paper":"https://pith.science/paper/4YBYDHPH"},"agent_actions":{"view_html":"https://pith.science/pith/4YBYDHPHJKOVVZ7DLDYW4A4KJG","download_json":"https://pith.science/pith/4YBYDHPHJKOVVZ7DLDYW4A4KJG.json","view_paper":"https://pith.science/paper/4YBYDHPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02005&json=true","fetch_graph":"https://pith.science/api/pith-number/4YBYDHPHJKOVVZ7DLDYW4A4KJG/graph.json","fetch_events":"https://pith.science/api/pith-number/4YBYDHPHJKOVVZ7DLDYW4A4KJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YBYDHPHJKOVVZ7DLDYW4A4KJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YBYDHPHJKOVVZ7DLDYW4A4KJG/action/storage_attestation","attest_author":"https://pith.science/pith/4YBYDHPHJKOVVZ7DLDYW4A4KJG/action/author_attestation","sign_citation":"https://pith.science/pith/4YBYDHPHJKOVVZ7DLDYW4A4KJG/action/citation_signature","submit_replication":"https://pith.science/pith/4YBYDHPHJKOVVZ7DLDYW4A4KJG/action/replication_record"}},"created_at":"2026-05-18T00:50:13.629440+00:00","updated_at":"2026-05-18T00:50:13.629440+00:00"}