{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:GL3AHNFQXFK54DUDR4RRIYPL5C","short_pith_number":"pith:GL3AHNFQ","canonical_record":{"source":{"id":"0706.4297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-06-28T18:44:37Z","cross_cats_sorted":[],"title_canon_sha256":"60e4642dd53ff8dc4a7e0ae88f81c843796896a13b7c0d7e894b10a6248f281c","abstract_canon_sha256":"dd6d7bdf291eb9cb4641aed416ecd8c8f7c268a81e1857eb2433297291ee6e7d"},"schema_version":"1.0"},"canonical_sha256":"32f603b4b0b955de0e838f231461ebe8856f3d85a1e2e5af6c42f2c2baef2aad","source":{"kind":"arxiv","id":"0706.4297","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.4297","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"0706.4297v2","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.4297","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"GL3AHNFQXFK5","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"GL3AHNFQXFK54DUD","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"GL3AHNFQ","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:GL3AHNFQXFK54DUDR4RRIYPL5C","target":"record","payload":{"canonical_record":{"source":{"id":"0706.4297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-06-28T18:44:37Z","cross_cats_sorted":[],"title_canon_sha256":"60e4642dd53ff8dc4a7e0ae88f81c843796896a13b7c0d7e894b10a6248f281c","abstract_canon_sha256":"dd6d7bdf291eb9cb4641aed416ecd8c8f7c268a81e1857eb2433297291ee6e7d"},"schema_version":"1.0"},"canonical_sha256":"32f603b4b0b955de0e838f231461ebe8856f3d85a1e2e5af6c42f2c2baef2aad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.203532Z","signature_b64":"La4x+0sbx+5/VVhtyBkPOqdIuK4gJFphJDc5L7bO74El+HwQeMFzUwswrs9BbTtAW3KkykwzDq0WWhP/BFesCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32f603b4b0b955de0e838f231461ebe8856f3d85a1e2e5af6c42f2c2baef2aad","last_reissued_at":"2026-05-18T03:37:42.202803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.202803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0706.4297","source_version":2,"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-18T03:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGNYyY5IxZ0DL6mtvmKP+I2UqtJmmSWN/N6yH26fsw/0NgxETt2ERRkW5al08S1JApK7I8mj1dgvyc1kyaxNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:39.398961Z"},"content_sha256":"ca52607ebe7f33aa93a153cb11c7842c6abfe7551805d621751fab4d534e19e5","schema_version":"1.0","event_id":"sha256:ca52607ebe7f33aa93a153cb11c7842c6abfe7551805d621751fab4d534e19e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:GL3AHNFQXFK54DUDR4RRIYPL5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"I. Daubechies, I. Loris, M. Fornasier","submitted_at":"2007-06-28T18:44:37Z","abstract_excerpt":"Regularization of ill-posed linear inverse problems via $\\ell_1$ penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an $\\ell_1$ penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to $\\ell_1$-constraints, using a gradient method, with projection on $\\ell_1$-balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.4297","kind":"arxiv","version":2},"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-18T03:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dSiaoUMVFWq/f+ZSgsK/lf84zWyapmONt8yiHzFpdSqsOE2BynIfpArszb/ROUzZRARfwRCNlmYIchaM2nJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:39.399569Z"},"content_sha256":"f9a3795d755430932d9b53307eea395f0a5730e0d2a001681d2df4298cc02f37","schema_version":"1.0","event_id":"sha256:f9a3795d755430932d9b53307eea395f0a5730e0d2a001681d2df4298cc02f37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/bundle.json","state_url":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/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-27T13:49:39Z","links":{"resolver":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C","bundle":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/bundle.json","state":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:GL3AHNFQXFK54DUDR4RRIYPL5C","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":"dd6d7bdf291eb9cb4641aed416ecd8c8f7c268a81e1857eb2433297291ee6e7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-06-28T18:44:37Z","title_canon_sha256":"60e4642dd53ff8dc4a7e0ae88f81c843796896a13b7c0d7e894b10a6248f281c"},"schema_version":"1.0","source":{"id":"0706.4297","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.4297","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"0706.4297v2","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.4297","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"GL3AHNFQXFK5","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"GL3AHNFQXFK54DUD","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"GL3AHNFQ","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:f9a3795d755430932d9b53307eea395f0a5730e0d2a001681d2df4298cc02f37","target":"graph","created_at":"2026-05-18T03:37:42Z","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":"Regularization of ill-posed linear inverse problems via $\\ell_1$ penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an $\\ell_1$ penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to $\\ell_1$-constraints, using a gradient method, with projection on $\\ell_1$-balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of","authors_text":"I. Daubechies, I. Loris, M. Fornasier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-06-28T18:44:37Z","title":"Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.4297","kind":"arxiv","version":2},"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:ca52607ebe7f33aa93a153cb11c7842c6abfe7551805d621751fab4d534e19e5","target":"record","created_at":"2026-05-18T03:37:42Z","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":"dd6d7bdf291eb9cb4641aed416ecd8c8f7c268a81e1857eb2433297291ee6e7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-06-28T18:44:37Z","title_canon_sha256":"60e4642dd53ff8dc4a7e0ae88f81c843796896a13b7c0d7e894b10a6248f281c"},"schema_version":"1.0","source":{"id":"0706.4297","kind":"arxiv","version":2}},"canonical_sha256":"32f603b4b0b955de0e838f231461ebe8856f3d85a1e2e5af6c42f2c2baef2aad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32f603b4b0b955de0e838f231461ebe8856f3d85a1e2e5af6c42f2c2baef2aad","first_computed_at":"2026-05-18T03:37:42.202803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:42.202803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"La4x+0sbx+5/VVhtyBkPOqdIuK4gJFphJDc5L7bO74El+HwQeMFzUwswrs9BbTtAW3KkykwzDq0WWhP/BFesCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:42.203532Z","signed_message":"canonical_sha256_bytes"},"source_id":"0706.4297","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca52607ebe7f33aa93a153cb11c7842c6abfe7551805d621751fab4d534e19e5","sha256:f9a3795d755430932d9b53307eea395f0a5730e0d2a001681d2df4298cc02f37"],"state_sha256":"5d5dd941429eb7361e55a651d15c0da5d253b765381f6c2db2d7a9abd7756ee2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6KvirNkJpxCPMne8WxeBAMCS5jDhtEY69o4NMDuf70uBxEAvXcP/u9Ez6HyaimHX94eAQuylf5oW29FxwtWAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:49:39.406866Z","bundle_sha256":"70c4d63d4c17c7cf66a67f9e48733f84441f7d0665b39700ae9e78a12aefe2ce"}}