{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PHHRJV3J5CHYEHIN2UH7H7GRNN","short_pith_number":"pith:PHHRJV3J","canonical_record":{"source":{"id":"1608.03861","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-12T18:02:13Z","cross_cats_sorted":[],"title_canon_sha256":"ad03a68d774ceb3b642e8e3c6b04e480f9c960ee43fecc00d78af34dc3dee7ae","abstract_canon_sha256":"071d3857344613866c282a2152a45d6467ab9a58b5dc48d207b3a7badc6fe6ec"},"schema_version":"1.0"},"canonical_sha256":"79cf14d769e88f821d0dd50ff3fcd16b5a7c17fbb00abf2064b0279174837909","source":{"kind":"arxiv","id":"1608.03861","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03861","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03861v5","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03861","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"PHHRJV3J5CHY","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHHRJV3J5CHYEHIN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHHRJV3J","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PHHRJV3J5CHYEHIN2UH7H7GRNN","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03861","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-12T18:02:13Z","cross_cats_sorted":[],"title_canon_sha256":"ad03a68d774ceb3b642e8e3c6b04e480f9c960ee43fecc00d78af34dc3dee7ae","abstract_canon_sha256":"071d3857344613866c282a2152a45d6467ab9a58b5dc48d207b3a7badc6fe6ec"},"schema_version":"1.0"},"canonical_sha256":"79cf14d769e88f821d0dd50ff3fcd16b5a7c17fbb00abf2064b0279174837909","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:28.797891Z","signature_b64":"55UDGX3XGhItwlCY0guqKOkamP9AvHy3qgZtJlTZJJMAUTVMO8r/p1Zw4UPc/4pSXXKE/0N9bHiHCxZnrM+GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79cf14d769e88f821d0dd50ff3fcd16b5a7c17fbb00abf2064b0279174837909","last_reissued_at":"2026-05-17T23:43:28.797264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:28.797264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03861","source_version":5,"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-17T23:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/oFjS1G2F3VNTRYIwso0dMWgkSzye4U34/V0iIEj10gTqHk0ZLcaC/v+Y+oXPQjzeZgWcyvNqJuZhY+SVbUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:20:44.823863Z"},"content_sha256":"61682e7106eeaf577465c5ae62dd92326a093bb7f0760ce9547e7528922da0c3","schema_version":"1.0","event_id":"sha256:61682e7106eeaf577465c5ae62dd92326a093bb7f0760ce9547e7528922da0c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PHHRJV3J5CHYEHIN2UH7H7GRNN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Donghwan Kim, Jeffrey A. Fessler","submitted_at":"2016-08-12T18:02:13Z","abstract_excerpt":"This paper provides a new way of developing the fast iterative shrinkage/thresholding algorithm (FISTA) that is widely used for minimizing composite convex functions with a nonsmooth term such as the $\\ell_1$ regularizer. In particular, this paper shows that FISTA corresponds to an optimized approach to accelerating the proximal gradient method with respect to a worst-case bound of the cost function. This paper then proposes a new algorithm that is derived by instead optimizing the step coefficients of the proximal gradient method with respect to a worst-case bound of the composite gradient ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03861","kind":"arxiv","version":5},"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-17T23:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aTCqixAE7gxg1P1UYiCjvDNgscOzrd1zBIIUrrFWuym4cJ2fjYl0daUAw5mNjs9t3D+NiqW4NvBYgFgZF03Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:20:44.824214Z"},"content_sha256":"b6ebcbf5bcb9506af195529ba0bcef0ba7e89f23dd4da9d8a47b26da292dcec3","schema_version":"1.0","event_id":"sha256:b6ebcbf5bcb9506af195529ba0bcef0ba7e89f23dd4da9d8a47b26da292dcec3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/bundle.json","state_url":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/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-06-11T11:20:44Z","links":{"resolver":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN","bundle":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/bundle.json","state":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PHHRJV3J5CHYEHIN2UH7H7GRNN","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":"071d3857344613866c282a2152a45d6467ab9a58b5dc48d207b3a7badc6fe6ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-12T18:02:13Z","title_canon_sha256":"ad03a68d774ceb3b642e8e3c6b04e480f9c960ee43fecc00d78af34dc3dee7ae"},"schema_version":"1.0","source":{"id":"1608.03861","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03861","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03861v5","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03861","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"PHHRJV3J5CHY","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHHRJV3J5CHYEHIN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHHRJV3J","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:b6ebcbf5bcb9506af195529ba0bcef0ba7e89f23dd4da9d8a47b26da292dcec3","target":"graph","created_at":"2026-05-17T23:43:28Z","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 provides a new way of developing the fast iterative shrinkage/thresholding algorithm (FISTA) that is widely used for minimizing composite convex functions with a nonsmooth term such as the $\\ell_1$ regularizer. In particular, this paper shows that FISTA corresponds to an optimized approach to accelerating the proximal gradient method with respect to a worst-case bound of the cost function. This paper then proposes a new algorithm that is derived by instead optimizing the step coefficients of the proximal gradient method with respect to a worst-case bound of the composite gradient ma","authors_text":"Donghwan Kim, Jeffrey A. Fessler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-12T18:02:13Z","title":"Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03861","kind":"arxiv","version":5},"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:61682e7106eeaf577465c5ae62dd92326a093bb7f0760ce9547e7528922da0c3","target":"record","created_at":"2026-05-17T23:43:28Z","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":"071d3857344613866c282a2152a45d6467ab9a58b5dc48d207b3a7badc6fe6ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-12T18:02:13Z","title_canon_sha256":"ad03a68d774ceb3b642e8e3c6b04e480f9c960ee43fecc00d78af34dc3dee7ae"},"schema_version":"1.0","source":{"id":"1608.03861","kind":"arxiv","version":5}},"canonical_sha256":"79cf14d769e88f821d0dd50ff3fcd16b5a7c17fbb00abf2064b0279174837909","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79cf14d769e88f821d0dd50ff3fcd16b5a7c17fbb00abf2064b0279174837909","first_computed_at":"2026-05-17T23:43:28.797264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:28.797264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55UDGX3XGhItwlCY0guqKOkamP9AvHy3qgZtJlTZJJMAUTVMO8r/p1Zw4UPc/4pSXXKE/0N9bHiHCxZnrM+GCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:28.797891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03861","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61682e7106eeaf577465c5ae62dd92326a093bb7f0760ce9547e7528922da0c3","sha256:b6ebcbf5bcb9506af195529ba0bcef0ba7e89f23dd4da9d8a47b26da292dcec3"],"state_sha256":"3c8c48068d42edb14bfbdcf2a002afbc90abcd0dadc3921854e7af194c8d24db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EeJL0SWUeVuqjZ21OGAxOxJdlbQWRHoI8J2dIREhIEr1ffFaEYKD4foMtHrJ2VPAJH6xVhpV3B9DcSeUAe0BCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:20:44.826258Z","bundle_sha256":"cb16d8725a54c5bddbfbb889b30c97c01f5b44216642b2405ca4abb4425e6daa"}}