{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BJT3GMFBNSXAPXJU6KHKF7J6JS","short_pith_number":"pith:BJT3GMFB","canonical_record":{"source":{"id":"1305.4704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T04:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"93c06b95ffbbb928bcf1eddf08b91b7e4f515ba7a0d3d2b018f51fcb67759b41","abstract_canon_sha256":"ed3f277617a354d678e1986f13cf5b3554cdb22559c9a689a8092f5afed4766c"},"schema_version":"1.0"},"canonical_sha256":"0a67b330a16cae07dd34f28ea2fd3e4cbc7662248b6cc600a259637a2a6fad78","source":{"kind":"arxiv","id":"1305.4704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4704","created_at":"2026-05-18T03:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4704v2","created_at":"2026-05-18T03:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4704","created_at":"2026-05-18T03:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"BJT3GMFBNSXA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BJT3GMFBNSXAPXJU","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BJT3GMFB","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BJT3GMFBNSXAPXJU6KHKF7J6JS","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T04:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"93c06b95ffbbb928bcf1eddf08b91b7e4f515ba7a0d3d2b018f51fcb67759b41","abstract_canon_sha256":"ed3f277617a354d678e1986f13cf5b3554cdb22559c9a689a8092f5afed4766c"},"schema_version":"1.0"},"canonical_sha256":"0a67b330a16cae07dd34f28ea2fd3e4cbc7662248b6cc600a259637a2a6fad78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:52.253930Z","signature_b64":"mjo01paQadIEcOPnDAdx7Be2boNOYwsEB7UgJvy/XbaPo6uk+jg02doiOSOMp6l3bT2KiQS4J/66v3yk9v6VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a67b330a16cae07dd34f28ea2fd3e4cbc7662248b6cc600a259637a2a6fad78","last_reissued_at":"2026-05-18T03:14:52.253062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:52.253062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4704","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:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HcmtgF6E4lbfGcLdofPC+sT7flYsP1iNIobMI+hMyNjLm0d+FR5AnPGPkhG4sb0UY6Eq6pW8kVNA8dAGm18QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:42.272945Z"},"content_sha256":"51b16e064cefef5cf19920463144afe7dd2b36a6dacd936d799e395852f2abc5","schema_version":"1.0","event_id":"sha256:51b16e064cefef5cf19920463144afe7dd2b36a6dacd936d799e395852f2abc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BJT3GMFBNSXAPXJU6KHKF7J6JS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The proximal-proximal gradient algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ting Kei Pong","submitted_at":"2013-05-21T04:00:00Z","abstract_excerpt":"We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a composition of a proper closed convex function P and a nonzero affine map, with the proximal mappings of \\tau P, \\tau > 0, easy to compute. In this case, a direct application of the widely used proximal gradient algorithm does not necessarily lead to easy subproblems. In view of this, we propose a new algorithm, the proximal-proximal gradient algorithm, which admi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4704","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:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njyBT1QbEBvMELa1sBMjsmUCGo2k7zJ/usGS84bgpirdqAKDOdVK8EfgVviB8+N5kKhq8Y6gBOfCQkBRvq04BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:42.273615Z"},"content_sha256":"fd21d9aa2e6c0b2bbd16ed14460c9a15857ebcac28b4cb0a1317c7d9739ec283","schema_version":"1.0","event_id":"sha256:fd21d9aa2e6c0b2bbd16ed14460c9a15857ebcac28b4cb0a1317c7d9739ec283"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJT3GMFBNSXAPXJU6KHKF7J6JS/bundle.json","state_url":"https://pith.science/pith/BJT3GMFBNSXAPXJU6KHKF7J6JS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJT3GMFBNSXAPXJU6KHKF7J6JS/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-30T07:45:42Z","links":{"resolver":"https://pith.science/pith/BJT3GMFBNSXAPXJU6KHKF7J6JS","bundle":"https://pith.science/pith/BJT3GMFBNSXAPXJU6KHKF7J6JS/bundle.json","state":"https://pith.science/pith/BJT3GMFBNSXAPXJU6KHKF7J6JS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJT3GMFBNSXAPXJU6KHKF7J6JS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BJT3GMFBNSXAPXJU6KHKF7J6JS","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":"ed3f277617a354d678e1986f13cf5b3554cdb22559c9a689a8092f5afed4766c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T04:00:00Z","title_canon_sha256":"93c06b95ffbbb928bcf1eddf08b91b7e4f515ba7a0d3d2b018f51fcb67759b41"},"schema_version":"1.0","source":{"id":"1305.4704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4704","created_at":"2026-05-18T03:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4704v2","created_at":"2026-05-18T03:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4704","created_at":"2026-05-18T03:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"BJT3GMFBNSXA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BJT3GMFBNSXAPXJU","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BJT3GMFB","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:fd21d9aa2e6c0b2bbd16ed14460c9a15857ebcac28b4cb0a1317c7d9739ec283","target":"graph","created_at":"2026-05-18T03:14:52Z","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":"We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a composition of a proper closed convex function P and a nonzero affine map, with the proximal mappings of \\tau P, \\tau > 0, easy to compute. In this case, a direct application of the widely used proximal gradient algorithm does not necessarily lead to easy subproblems. In view of this, we propose a new algorithm, the proximal-proximal gradient algorithm, which admi","authors_text":"Ting Kei Pong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T04:00:00Z","title":"The proximal-proximal gradient algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4704","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:51b16e064cefef5cf19920463144afe7dd2b36a6dacd936d799e395852f2abc5","target":"record","created_at":"2026-05-18T03:14:52Z","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":"ed3f277617a354d678e1986f13cf5b3554cdb22559c9a689a8092f5afed4766c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T04:00:00Z","title_canon_sha256":"93c06b95ffbbb928bcf1eddf08b91b7e4f515ba7a0d3d2b018f51fcb67759b41"},"schema_version":"1.0","source":{"id":"1305.4704","kind":"arxiv","version":2}},"canonical_sha256":"0a67b330a16cae07dd34f28ea2fd3e4cbc7662248b6cc600a259637a2a6fad78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a67b330a16cae07dd34f28ea2fd3e4cbc7662248b6cc600a259637a2a6fad78","first_computed_at":"2026-05-18T03:14:52.253062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:52.253062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mjo01paQadIEcOPnDAdx7Be2boNOYwsEB7UgJvy/XbaPo6uk+jg02doiOSOMp6l3bT2KiQS4J/66v3yk9v6VBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:52.253930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51b16e064cefef5cf19920463144afe7dd2b36a6dacd936d799e395852f2abc5","sha256:fd21d9aa2e6c0b2bbd16ed14460c9a15857ebcac28b4cb0a1317c7d9739ec283"],"state_sha256":"4cdd3ff4f6cb55df7b06c4e960cc94171ab78fb75528845dfb81e725c3b80f87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VsxsINuym2FcuNlYXn34IgRPCW96Kzsy6NkASMAh5pgoytRvkcL5Wigq91TB2wms6bnkzF6H6XupaOSRyD6HDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:45:42.276851Z","bundle_sha256":"5b83c23db3b2dff85165b769da02b91ce584281dae979497143ba71682f83ce7"}}