{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HIAB7OJOOP6Y4EQJIRPDMB4FY7","short_pith_number":"pith:HIAB7OJO","schema_version":"1.0","canonical_sha256":"3a001fb92e73fd8e1209445e360785c7d6410805ffacd6f7a5cd62698b6a3480","source":{"kind":"arxiv","id":"1609.09525","version":1},"attestation_state":"computed","paper":{"title":"Multi-dimensional signal approximation with sparse structured priors using split Bregman iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.DS","authors_text":"C\\'edric Gouy-Pailler, Jamal Atif, Mich\\`ele Sebag, Quentin Barth\\'elemy, Yoann Isaac","submitted_at":"2016-09-29T20:50:16Z","abstract_excerpt":"This paper addresses the structurally-constrained sparse decomposition of multi-dimensional signals onto overcomplete families of vectors, called dictionaries. The contribution of the paper is threefold. Firstly, a generic spatio-temporal regularization term is designed and used together with the standard $\\ell_1$ regularization term to enforce a sparse decomposition preserving the spatio-temporal structure of the signal. Secondly, an optimization algorithm based on the split Bregman approach is proposed to handle the associated optimization problem, and its convergence is analyzed. Our well-f"},"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":"1609.09525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-29T20:50:16Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"dfbdd985e83876c137b51a1e7f704c9363bf79fa62805e4b8c1d1a257a9fdb13","abstract_canon_sha256":"66f6bd0ca492680e394a1c5e011f7b62d6b635904725f749c459eb9cc0bc4819"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:35.821709Z","signature_b64":"Hkk8xBaziroPK+c7q8Fpy4Vtgf05VuYIBoQ7qMudnarBSDPcz9eP6pKkLj7PdZe3XRRvxDWICePG3ZmspC59DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a001fb92e73fd8e1209445e360785c7d6410805ffacd6f7a5cd62698b6a3480","last_reissued_at":"2026-05-18T01:03:35.821012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:35.821012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-dimensional signal approximation with sparse structured priors using split Bregman iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.DS","authors_text":"C\\'edric Gouy-Pailler, Jamal Atif, Mich\\`ele Sebag, Quentin Barth\\'elemy, Yoann Isaac","submitted_at":"2016-09-29T20:50:16Z","abstract_excerpt":"This paper addresses the structurally-constrained sparse decomposition of multi-dimensional signals onto overcomplete families of vectors, called dictionaries. The contribution of the paper is threefold. Firstly, a generic spatio-temporal regularization term is designed and used together with the standard $\\ell_1$ regularization term to enforce a sparse decomposition preserving the spatio-temporal structure of the signal. Secondly, an optimization algorithm based on the split Bregman approach is proposed to handle the associated optimization problem, and its convergence is analyzed. Our well-f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09525","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":"1609.09525","created_at":"2026-05-18T01:03:35.821132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09525v1","created_at":"2026-05-18T01:03:35.821132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09525","created_at":"2026-05-18T01:03:35.821132+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIAB7OJOOP6Y","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIAB7OJOOP6Y4EQJ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIAB7OJO","created_at":"2026-05-18T12:30:19.053100+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/HIAB7OJOOP6Y4EQJIRPDMB4FY7","json":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7.json","graph_json":"https://pith.science/api/pith-number/HIAB7OJOOP6Y4EQJIRPDMB4FY7/graph.json","events_json":"https://pith.science/api/pith-number/HIAB7OJOOP6Y4EQJIRPDMB4FY7/events.json","paper":"https://pith.science/paper/HIAB7OJO"},"agent_actions":{"view_html":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7","download_json":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7.json","view_paper":"https://pith.science/paper/HIAB7OJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09525&json=true","fetch_graph":"https://pith.science/api/pith-number/HIAB7OJOOP6Y4EQJIRPDMB4FY7/graph.json","fetch_events":"https://pith.science/api/pith-number/HIAB7OJOOP6Y4EQJIRPDMB4FY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/action/storage_attestation","attest_author":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/action/author_attestation","sign_citation":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/action/citation_signature","submit_replication":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/action/replication_record"}},"created_at":"2026-05-18T01:03:35.821132+00:00","updated_at":"2026-05-18T01:03:35.821132+00:00"}