{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UXTEQ7E72SDTERPFZ72T6QUIFQ","short_pith_number":"pith:UXTEQ7E7","schema_version":"1.0","canonical_sha256":"a5e6487c9fd4873245e5cff53f42882c08c55e2d00175e5f5f9d7723915df131","source":{"kind":"arxiv","id":"1707.06066","version":1},"attestation_state":"computed","paper":{"title":"Working Locally Thinking Globally: 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":"2017-07-12T07:50:49Z","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 recently proposed, adopting a convolutional sparse representation model. This approach assumes that the global dictionary is a concatenation of banded Circulant matrices. While several works have pre"},"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":"1707.06066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T07:50:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"37e56fe2a023d6f30883f126d58088bd1dbc9466aa684dc00caa566824db766b","abstract_canon_sha256":"51b3844b7e8769500f2817ee85bda240086f341685903f945f6557b39617d543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:16.318613Z","signature_b64":"T399vyF/bJCxAmDa00q9rmlkhhMK4489lipZGUGPnHBl1fM1CY2WsuzlB4h7TviF/qaM6p0hI9NH5AsSatDiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5e6487c9fd4873245e5cff53f42882c08c55e2d00175e5f5f9d7723915df131","last_reissued_at":"2026-05-18T00:33:16.317981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:16.317981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Working Locally Thinking Globally: 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":"2017-07-12T07:50:49Z","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 recently proposed, adopting a convolutional sparse representation model. This approach assumes that the global dictionary is a concatenation of banded Circulant matrices. While several works have pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06066","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.06066","created_at":"2026-05-18T00:33:16.318065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06066v1","created_at":"2026-05-18T00:33:16.318065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06066","created_at":"2026-05-18T00:33:16.318065+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXTEQ7E72SDT","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXTEQ7E72SDTERPF","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXTEQ7E7","created_at":"2026-05-18T12:31:49.984773+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/UXTEQ7E72SDTERPFZ72T6QUIFQ","json":"https://pith.science/pith/UXTEQ7E72SDTERPFZ72T6QUIFQ.json","graph_json":"https://pith.science/api/pith-number/UXTEQ7E72SDTERPFZ72T6QUIFQ/graph.json","events_json":"https://pith.science/api/pith-number/UXTEQ7E72SDTERPFZ72T6QUIFQ/events.json","paper":"https://pith.science/paper/UXTEQ7E7"},"agent_actions":{"view_html":"https://pith.science/pith/UXTEQ7E72SDTERPFZ72T6QUIFQ","download_json":"https://pith.science/pith/UXTEQ7E72SDTERPFZ72T6QUIFQ.json","view_paper":"https://pith.science/paper/UXTEQ7E7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06066&json=true","fetch_graph":"https://pith.science/api/pith-number/UXTEQ7E72SDTERPFZ72T6QUIFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UXTEQ7E72SDTERPFZ72T6QUIFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXTEQ7E72SDTERPFZ72T6QUIFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXTEQ7E72SDTERPFZ72T6QUIFQ/action/storage_attestation","attest_author":"https://pith.science/pith/UXTEQ7E72SDTERPFZ72T6QUIFQ/action/author_attestation","sign_citation":"https://pith.science/pith/UXTEQ7E72SDTERPFZ72T6QUIFQ/action/citation_signature","submit_replication":"https://pith.science/pith/UXTEQ7E72SDTERPFZ72T6QUIFQ/action/replication_record"}},"created_at":"2026-05-18T00:33:16.318065+00:00","updated_at":"2026-05-18T00:33:16.318065+00:00"}