{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HIAB7OJOOP6Y4EQJIRPDMB4FY7","short_pith_number":"pith:HIAB7OJO","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"},"canonical_sha256":"3a001fb92e73fd8e1209445e360785c7d6410805ffacd6f7a5cd62698b6a3480","source":{"kind":"arxiv","id":"1609.09525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09525","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09525v1","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09525","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"HIAB7OJOOP6Y","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HIAB7OJOOP6Y4EQJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HIAB7OJO","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HIAB7OJOOP6Y4EQJIRPDMB4FY7","target":"record","payload":{"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"},"canonical_sha256":"3a001fb92e73fd8e1209445e360785c7d6410805ffacd6f7a5cd62698b6a3480","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"},"source_kind":"arxiv","source_id":"1609.09525","source_version":1,"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-18T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Dr5RPTuA1alw6azPzUtmgrx6mpG++C1PG0vhZxmJJRJS/vSCOdu1MB2XKn5W4OzcrlEBXlVJ5LndmuMgy2tDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:01:03.873974Z"},"content_sha256":"0bd523653aa032773b49e4e47acebe36143d1b640ef2c3bde5b589e9d66e0bcd","schema_version":"1.0","event_id":"sha256:0bd523653aa032773b49e4e47acebe36143d1b640ef2c3bde5b589e9d66e0bcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HIAB7OJOOP6Y4EQJIRPDMB4FY7","target":"graph","payload":{"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"},"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-18T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHrUQz90W38fRZFYhfNBm0Xadozbj4IFMmHIZ3OFgOec+yG01DfNsjLxFhcKpaNivf7PXeLtbc0YjDxxqgMFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:01:03.874613Z"},"content_sha256":"67961015958602a5abe1bc45ea58619c8116909a917d48da013f546d5311c82d","schema_version":"1.0","event_id":"sha256:67961015958602a5abe1bc45ea58619c8116909a917d48da013f546d5311c82d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/bundle.json","state_url":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/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-22T07:01:03Z","links":{"resolver":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7","bundle":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/bundle.json","state":"https://pith.science/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIAB7OJOOP6Y4EQJIRPDMB4FY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HIAB7OJOOP6Y4EQJIRPDMB4FY7","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":"66f6bd0ca492680e394a1c5e011f7b62d6b635904725f749c459eb9cc0bc4819","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-29T20:50:16Z","title_canon_sha256":"dfbdd985e83876c137b51a1e7f704c9363bf79fa62805e4b8c1d1a257a9fdb13"},"schema_version":"1.0","source":{"id":"1609.09525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09525","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09525v1","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09525","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"HIAB7OJOOP6Y","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HIAB7OJOOP6Y4EQJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HIAB7OJO","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:67961015958602a5abe1bc45ea58619c8116909a917d48da013f546d5311c82d","target":"graph","created_at":"2026-05-18T01:03:35Z","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":"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","authors_text":"C\\'edric Gouy-Pailler, Jamal Atif, Mich\\`ele Sebag, Quentin Barth\\'elemy, Yoann Isaac","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-29T20:50:16Z","title":"Multi-dimensional signal approximation with sparse structured priors using split Bregman iterations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09525","kind":"arxiv","version":1},"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:0bd523653aa032773b49e4e47acebe36143d1b640ef2c3bde5b589e9d66e0bcd","target":"record","created_at":"2026-05-18T01:03:35Z","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":"66f6bd0ca492680e394a1c5e011f7b62d6b635904725f749c459eb9cc0bc4819","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-29T20:50:16Z","title_canon_sha256":"dfbdd985e83876c137b51a1e7f704c9363bf79fa62805e4b8c1d1a257a9fdb13"},"schema_version":"1.0","source":{"id":"1609.09525","kind":"arxiv","version":1}},"canonical_sha256":"3a001fb92e73fd8e1209445e360785c7d6410805ffacd6f7a5cd62698b6a3480","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a001fb92e73fd8e1209445e360785c7d6410805ffacd6f7a5cd62698b6a3480","first_computed_at":"2026-05-18T01:03:35.821012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:35.821012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hkk8xBaziroPK+c7q8Fpy4Vtgf05VuYIBoQ7qMudnarBSDPcz9eP6pKkLj7PdZe3XRRvxDWICePG3ZmspC59DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:35.821709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bd523653aa032773b49e4e47acebe36143d1b640ef2c3bde5b589e9d66e0bcd","sha256:67961015958602a5abe1bc45ea58619c8116909a917d48da013f546d5311c82d"],"state_sha256":"79dd9e3212fe5ef1687c642835e0c16585d510e1ba9a1a7d4d27000f20985cd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+Oypt+mRATrYlenMLlEeikp7JCQ8GCl+QaErPG1WlLJzK2wHk/8MROiIyb64BWiGpE0yJVS4jLM2dTjKVfcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T07:01:03.878681Z","bundle_sha256":"85a2f21ac58f9a9d55a88a3f083d067158169c6d3473140e1ffae70831de7b17"}}