{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6AZQLGCDQMCLJR2TF5JPPNMVDW","short_pith_number":"pith:6AZQLGCD","canonical_record":{"source":{"id":"1104.1087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-06T13:16:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e5cd5069ae097b6ced2e1726d1ae9b0a5eb4364b07a3db90174701b15be03342","abstract_canon_sha256":"6ec8ab6eeba3f00f249808aac5b2fc41833a72d6fe4b977820cf0b39fa7a6caa"},"schema_version":"1.0"},"canonical_sha256":"f0330598438304b4c7532f52f7b5951d943f4c5e00bc4fd9e57bb92f3adef8b5","source":{"kind":"arxiv","id":"1104.1087","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6AZQLGCDQMCLJR2TF5JPPNMVDW","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-06T13:16:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e5cd5069ae097b6ced2e1726d1ae9b0a5eb4364b07a3db90174701b15be03342","abstract_canon_sha256":"6ec8ab6eeba3f00f249808aac5b2fc41833a72d6fe4b977820cf0b39fa7a6caa"},"schema_version":"1.0"},"canonical_sha256":"f0330598438304b4c7532f52f7b5951d943f4c5e00bc4fd9e57bb92f3adef8b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:32.419819Z","signature_b64":"AitaUOttKQKw5W9TRvgK25mfO39FhBJgK7mF9aIL5CUy1AX+sWBDA/B7bWfPZizYZEiV4ipS0M5pfvyqfXdcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0330598438304b4c7532f52f7b5951d943f4c5e00bc4fd9e57bb92f3adef8b5","last_reissued_at":"2026-05-18T04:03:32.419043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:32.419043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1087","source_version":3,"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-18T04:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cg6Lo3PGn6RyngjTv1ti1y6Zy/56B7GVVkYHsgS1wH7jvXWMOL5w21BOoOLci1OUeBKiFkDCLZeGb6aajeUaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:45:43.365796Z"},"content_sha256":"2862cc2e06cb005c28bd1d47d8653876fd2eaba85c07854115224eff1d8390e3","schema_version":"1.0","event_id":"sha256:2862cc2e06cb005c28bd1d47d8653876fd2eaba85c07854115224eff1d8390e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6AZQLGCDQMCLJR2TF5JPPNMVDW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Caroline Verhoeven, Ignace Loris","submitted_at":"2011-04-06T13:16:18Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1087","kind":"arxiv","version":3},"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-18T04:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WHR7mLfS5+WXrWv0rIiw4yhSJQhmabZsjylsK7Ix0WWyBPFcwzRcUhIrH3JVio2eKRKVHI03OyXzRwJAA3RAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:45:43.366146Z"},"content_sha256":"566b30a476baf21e49dff63fc4953aca7e39ec66c4e2ecfd73ded29d31160029","schema_version":"1.0","event_id":"sha256:566b30a476baf21e49dff63fc4953aca7e39ec66c4e2ecfd73ded29d31160029"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AZQLGCDQMCLJR2TF5JPPNMVDW/bundle.json","state_url":"https://pith.science/pith/6AZQLGCDQMCLJR2TF5JPPNMVDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AZQLGCDQMCLJR2TF5JPPNMVDW/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-28T06:45:43Z","links":{"resolver":"https://pith.science/pith/6AZQLGCDQMCLJR2TF5JPPNMVDW","bundle":"https://pith.science/pith/6AZQLGCDQMCLJR2TF5JPPNMVDW/bundle.json","state":"https://pith.science/pith/6AZQLGCDQMCLJR2TF5JPPNMVDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AZQLGCDQMCLJR2TF5JPPNMVDW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GY2EI8eCxFIBrXedmEs68c2VGG4ogt4fsV6pb0xc2PeV9xydN02X73AkmPSqcdytkRHScIu4RQboPjAUKMtJBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:45:43.368118Z","bundle_sha256":"f72e4b73b0edb2fa732730edfafba909edf727e23c1fae2824593aea2c59bf5f"}}