{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6AZQLGCDQMCLJR2TF5JPPNMVDW","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":"6ec8ab6eeba3f00f249808aac5b2fc41833a72d6fe4b977820cf0b39fa7a6caa","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-06T13:16:18Z","title_canon_sha256":"e5cd5069ae097b6ced2e1726d1ae9b0a5eb4364b07a3db90174701b15be03342"},"schema_version":"1.0","source":{"id":"1104.1087","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1087","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1087v3","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1087","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"6AZQLGCDQMCL","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6AZQLGCDQMCLJR2T","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6AZQLGCD","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:566b30a476baf21e49dff63fc4953aca7e39ec66c4e2ecfd73ded29d31160029","target":"graph","created_at":"2026-05-18T04:03:32Z","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":"An explicit algorithm for the minimization of an $\\ell_1$ penalized least squares functional, with non-separable $\\ell_1$ term, is proposed. Each step in the iterative algorithm requires four matrix vector multiplications and a single simple projection on a convex set (or equivalently thresholding). Convergence is proven and a 1/N convergence rate is derived for the functional. In the special case where the matrix in the $\\ell_1$ term is the identity (or orthogonal), the algorithm reduces to the traditional iterative soft-thresholding algorithm. In the special case where the matrix in the quad","authors_text":"Caroline Verhoeven, Ignace Loris","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-06T13:16:18Z","title":"On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1087","kind":"arxiv","version":3},"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:2862cc2e06cb005c28bd1d47d8653876fd2eaba85c07854115224eff1d8390e3","target":"record","created_at":"2026-05-18T04:03:32Z","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":"6ec8ab6eeba3f00f249808aac5b2fc41833a72d6fe4b977820cf0b39fa7a6caa","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-06T13:16:18Z","title_canon_sha256":"e5cd5069ae097b6ced2e1726d1ae9b0a5eb4364b07a3db90174701b15be03342"},"schema_version":"1.0","source":{"id":"1104.1087","kind":"arxiv","version":3}},"canonical_sha256":"f0330598438304b4c7532f52f7b5951d943f4c5e00bc4fd9e57bb92f3adef8b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0330598438304b4c7532f52f7b5951d943f4c5e00bc4fd9e57bb92f3adef8b5","first_computed_at":"2026-05-18T04:03:32.419043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:32.419043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AitaUOttKQKw5W9TRvgK25mfO39FhBJgK7mF9aIL5CUy1AX+sWBDA/B7bWfPZizYZEiV4ipS0M5pfvyqfXdcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:32.419819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1087","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2862cc2e06cb005c28bd1d47d8653876fd2eaba85c07854115224eff1d8390e3","sha256:566b30a476baf21e49dff63fc4953aca7e39ec66c4e2ecfd73ded29d31160029"],"state_sha256":"4bb694afc0ff3b0af1e8351f6480f7bf7d141f23ac4a86cd566487cc57a4eb0e"}