{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:V7X4PMS3S43BVXWCKGB3UL2W3K","short_pith_number":"pith:V7X4PMS3","canonical_record":{"source":{"id":"2308.02261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T11:37:08Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"efdb525ee1f8384ede7d8cedae43fd8f8a87008863fd68e7466b0af78497a1be","abstract_canon_sha256":"a3f377c2e951753a49a3eff4ea726163aa7038df1467cd7ab581201065b8f35a"},"schema_version":"1.0"},"canonical_sha256":"afefc7b25b97361adec25183ba2f56daa6bd46f4603180a73cc3e9aff30c353f","source":{"kind":"arxiv","id":"2308.02261","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.02261","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"2308.02261v2","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02261","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"V7X4PMS3S43B","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"pith_short_16","alias_value":"V7X4PMS3S43BVXWC","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"pith_short_8","alias_value":"V7X4PMS3","created_at":"2026-07-05T07:43:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:V7X4PMS3S43BVXWCKGB3UL2W3K","target":"record","payload":{"canonical_record":{"source":{"id":"2308.02261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T11:37:08Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"efdb525ee1f8384ede7d8cedae43fd8f8a87008863fd68e7466b0af78497a1be","abstract_canon_sha256":"a3f377c2e951753a49a3eff4ea726163aa7038df1467cd7ab581201065b8f35a"},"schema_version":"1.0"},"canonical_sha256":"afefc7b25b97361adec25183ba2f56daa6bd46f4603180a73cc3e9aff30c353f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:54.798798Z","signature_b64":"YrSaZzzsNEBYd1tHHWNC/N4tqnuX2qA400BnLVP3He2oEYO+xl4qABAWyGffPkVP5HN1wIlcejprl0WOD/TfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afefc7b25b97361adec25183ba2f56daa6bd46f4603180a73cc3e9aff30c353f","last_reissued_at":"2026-07-05T07:43:54.798331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:54.798331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.02261","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-07-05T07:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGT6xPuz9x2opjJfSVBIbbjbSMiZOzuMvlvCLWEnrPXqorBiOtiBhkWaKXbaoP2XHIH58muUGiHwL1M+Hej1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T15:33:27.343590Z"},"content_sha256":"d757a3ebc6266ccd4a806be5f60376dec5419936a24ba6e1c19831a7eb15f16f","schema_version":"1.0","event_id":"sha256:d757a3ebc6266ccd4a806be5f60376dec5419936a24ba6e1c19831a7eb15f16f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:V7X4PMS3S43BVXWCKGB3UL2W3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Proximal Gradient Method for Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Konstantin Mishchenko, Yura Malitsky","submitted_at":"2023-08-04T11:37:08Z","abstract_excerpt":"In this paper, we explore two fundamental first-order algorithms in convex optimization, namely, gradient descent (GD) and proximal gradient method (ProxGD). Our focus is on making these algorithms entirely adaptive by leveraging local curvature information of smooth functions. We propose adaptive versions of GD and ProxGD that are based on observed gradient differences and, thus, have no added computational costs. Moreover, we prove convergence of our methods assuming only local Lipschitzness of the gradient. In addition, the proposed versions allow for even larger stepsizes than those initia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02261","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.02261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMbu6SRTO/gFSL6UHQTdyrGDF+LhiGMBbvDt8jSnB/aueeStmnsQ/HNYTqQoEZRfdIPmqdVtbMPHnIVu/IddCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T15:33:27.343969Z"},"content_sha256":"69a222927582d375f718fd9c273c39dddc919ad74c50447fa7345a9ba65cbe12","schema_version":"1.0","event_id":"sha256:69a222927582d375f718fd9c273c39dddc919ad74c50447fa7345a9ba65cbe12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7X4PMS3S43BVXWCKGB3UL2W3K/bundle.json","state_url":"https://pith.science/pith/V7X4PMS3S43BVXWCKGB3UL2W3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7X4PMS3S43BVXWCKGB3UL2W3K/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-08-18T15:33:27Z","links":{"resolver":"https://pith.science/pith/V7X4PMS3S43BVXWCKGB3UL2W3K","bundle":"https://pith.science/pith/V7X4PMS3S43BVXWCKGB3UL2W3K/bundle.json","state":"https://pith.science/pith/V7X4PMS3S43BVXWCKGB3UL2W3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7X4PMS3S43BVXWCKGB3UL2W3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:V7X4PMS3S43BVXWCKGB3UL2W3K","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":"a3f377c2e951753a49a3eff4ea726163aa7038df1467cd7ab581201065b8f35a","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T11:37:08Z","title_canon_sha256":"efdb525ee1f8384ede7d8cedae43fd8f8a87008863fd68e7466b0af78497a1be"},"schema_version":"1.0","source":{"id":"2308.02261","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.02261","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"2308.02261v2","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02261","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"V7X4PMS3S43B","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"pith_short_16","alias_value":"V7X4PMS3S43BVXWC","created_at":"2026-07-05T07:43:54Z"},{"alias_kind":"pith_short_8","alias_value":"V7X4PMS3","created_at":"2026-07-05T07:43:54Z"}],"graph_snapshots":[{"event_id":"sha256:69a222927582d375f718fd9c273c39dddc919ad74c50447fa7345a9ba65cbe12","target":"graph","created_at":"2026-07-05T07:43:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.02261/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we explore two fundamental first-order algorithms in convex optimization, namely, gradient descent (GD) and proximal gradient method (ProxGD). Our focus is on making these algorithms entirely adaptive by leveraging local curvature information of smooth functions. We propose adaptive versions of GD and ProxGD that are based on observed gradient differences and, thus, have no added computational costs. Moreover, we prove convergence of our methods assuming only local Lipschitzness of the gradient. In addition, the proposed versions allow for even larger stepsizes than those initia","authors_text":"Konstantin Mishchenko, Yura Malitsky","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T11:37:08Z","title":"Adaptive Proximal Gradient Method for Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02261","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:d757a3ebc6266ccd4a806be5f60376dec5419936a24ba6e1c19831a7eb15f16f","target":"record","created_at":"2026-07-05T07:43:54Z","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":"a3f377c2e951753a49a3eff4ea726163aa7038df1467cd7ab581201065b8f35a","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T11:37:08Z","title_canon_sha256":"efdb525ee1f8384ede7d8cedae43fd8f8a87008863fd68e7466b0af78497a1be"},"schema_version":"1.0","source":{"id":"2308.02261","kind":"arxiv","version":2}},"canonical_sha256":"afefc7b25b97361adec25183ba2f56daa6bd46f4603180a73cc3e9aff30c353f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afefc7b25b97361adec25183ba2f56daa6bd46f4603180a73cc3e9aff30c353f","first_computed_at":"2026-07-05T07:43:54.798331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:43:54.798331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YrSaZzzsNEBYd1tHHWNC/N4tqnuX2qA400BnLVP3He2oEYO+xl4qABAWyGffPkVP5HN1wIlcejprl0WOD/TfAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:43:54.798798Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.02261","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d757a3ebc6266ccd4a806be5f60376dec5419936a24ba6e1c19831a7eb15f16f","sha256:69a222927582d375f718fd9c273c39dddc919ad74c50447fa7345a9ba65cbe12"],"state_sha256":"135b142bff30f0b2f45be1bdd258e57b8697152780963ad51c6b5624fdf4891c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NORl6DvRp9/MT9euiy9Hq/E5FuzReeskJj/VgtAD99YFzxY8BSG4T3roDnoBAljtTGGgZ8K6sDWFpOsFpQN1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T15:33:27.346483Z","bundle_sha256":"c902cf1008f461ac18b5e923640dabf0eb8dbb69b99bf2f99b6a2d646a3d4112"}}