{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:UYGSXPS72GC3L7FDKXYBPL4OXS","short_pith_number":"pith:UYGSXPS7","canonical_record":{"source":{"id":"2301.03175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T05:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"98bc6dc0d314ffce266aa824ff99b89cbc90d277ce165ff095b78419d4234eba","abstract_canon_sha256":"d86a41a28d61d52a18c7950c423069d3610fe52043bdcc1ebbb13305bc76421d"},"schema_version":"1.0"},"canonical_sha256":"a60d2bbe5fd185b5fca355f017af8ebc987dd2bb43d281061cde3e80cb84005b","source":{"kind":"arxiv","id":"2301.03175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.03175","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"arxiv_version","alias_value":"2301.03175v1","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03175","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"pith_short_12","alias_value":"UYGSXPS72GC3","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"pith_short_16","alias_value":"UYGSXPS72GC3L7FD","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"pith_short_8","alias_value":"UYGSXPS7","created_at":"2026-07-05T05:31:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:UYGSXPS72GC3L7FDKXYBPL4OXS","target":"record","payload":{"canonical_record":{"source":{"id":"2301.03175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T05:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"98bc6dc0d314ffce266aa824ff99b89cbc90d277ce165ff095b78419d4234eba","abstract_canon_sha256":"d86a41a28d61d52a18c7950c423069d3610fe52043bdcc1ebbb13305bc76421d"},"schema_version":"1.0"},"canonical_sha256":"a60d2bbe5fd185b5fca355f017af8ebc987dd2bb43d281061cde3e80cb84005b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:26.472155Z","signature_b64":"q0x0MqNzGAEXcUWU4b+AmZM1HpFrMoL7hYudh+QS5i9KxDx7Kb160+M9qsFwC2YdIlKYy5nTQGaA5D1FwHckAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a60d2bbe5fd185b5fca355f017af8ebc987dd2bb43d281061cde3e80cb84005b","last_reissued_at":"2026-07-05T05:31:26.471783Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:26.471783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.03175","source_version":1,"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-05T05:31:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+DINr3BU46uQg6cFGQSzA2LrKbevT1k9hLH6+lQ9ZfutWA1Hv3w7Nv+WKxPvr4Hy5aB36W1Ia1NefFixZSMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:55:08.309415Z"},"content_sha256":"7a3b8f0e32a8dd09fa79d874a01abe7d6bd8b58120888e2ce6f8eb91680895e7","schema_version":"1.0","event_id":"sha256:7a3b8f0e32a8dd09fa79d874a01abe7d6bd8b58120888e2ce6f8eb91680895e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:UYGSXPS72GC3L7FDKXYBPL4OXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Convergence Rate in Subgradient Norm of the Proximal Point Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guoyong Gu, Junfeng Yang","submitted_at":"2023-01-09T05:24:45Z","abstract_excerpt":"Proximal point algorithm has found many applications, and it has been playing fundamental roles in the understanding, design, and analysis of many first-order methods. In this paper, we derive the tight convergence rate in subgradient norm of the proximal point algorithm, which was conjectured by Taylor, Hendrickx and Glineur [SIAM J.~Optim., 27 (2017), pp.~1283--1313]. This sort of convergence results in terms of the residual (sub)gradient norm is particularly interesting when considering dual methods, where the dual residual gradient norm corresponds to the primal distance to feasibility."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03175","kind":"arxiv","version":1},"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/2301.03175/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-05T05:31:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xb/mCs/sFbzfDRIpvvw6V8TC2yl7DS1/Z7j9bf1/Dio6saw5mcQ3RA/TIphXP/bTFCkI3xNbhmz+HsNdJFEKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:55:08.310223Z"},"content_sha256":"df46785b38adc24aaccd697e26bd355da905be8196443d7e0649de4eb9a81442","schema_version":"1.0","event_id":"sha256:df46785b38adc24aaccd697e26bd355da905be8196443d7e0649de4eb9a81442"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYGSXPS72GC3L7FDKXYBPL4OXS/bundle.json","state_url":"https://pith.science/pith/UYGSXPS72GC3L7FDKXYBPL4OXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYGSXPS72GC3L7FDKXYBPL4OXS/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-09T09:55:08Z","links":{"resolver":"https://pith.science/pith/UYGSXPS72GC3L7FDKXYBPL4OXS","bundle":"https://pith.science/pith/UYGSXPS72GC3L7FDKXYBPL4OXS/bundle.json","state":"https://pith.science/pith/UYGSXPS72GC3L7FDKXYBPL4OXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYGSXPS72GC3L7FDKXYBPL4OXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:UYGSXPS72GC3L7FDKXYBPL4OXS","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":"d86a41a28d61d52a18c7950c423069d3610fe52043bdcc1ebbb13305bc76421d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T05:24:45Z","title_canon_sha256":"98bc6dc0d314ffce266aa824ff99b89cbc90d277ce165ff095b78419d4234eba"},"schema_version":"1.0","source":{"id":"2301.03175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.03175","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"arxiv_version","alias_value":"2301.03175v1","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03175","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"pith_short_12","alias_value":"UYGSXPS72GC3","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"pith_short_16","alias_value":"UYGSXPS72GC3L7FD","created_at":"2026-07-05T05:31:26Z"},{"alias_kind":"pith_short_8","alias_value":"UYGSXPS7","created_at":"2026-07-05T05:31:26Z"}],"graph_snapshots":[{"event_id":"sha256:df46785b38adc24aaccd697e26bd355da905be8196443d7e0649de4eb9a81442","target":"graph","created_at":"2026-07-05T05:31:26Z","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/2301.03175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Proximal point algorithm has found many applications, and it has been playing fundamental roles in the understanding, design, and analysis of many first-order methods. In this paper, we derive the tight convergence rate in subgradient norm of the proximal point algorithm, which was conjectured by Taylor, Hendrickx and Glineur [SIAM J.~Optim., 27 (2017), pp.~1283--1313]. This sort of convergence results in terms of the residual (sub)gradient norm is particularly interesting when considering dual methods, where the dual residual gradient norm corresponds to the primal distance to feasibility.","authors_text":"Guoyong Gu, Junfeng Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T05:24:45Z","title":"Tight Convergence Rate in Subgradient Norm of the Proximal Point Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03175","kind":"arxiv","version":1},"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:7a3b8f0e32a8dd09fa79d874a01abe7d6bd8b58120888e2ce6f8eb91680895e7","target":"record","created_at":"2026-07-05T05:31:26Z","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":"d86a41a28d61d52a18c7950c423069d3610fe52043bdcc1ebbb13305bc76421d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T05:24:45Z","title_canon_sha256":"98bc6dc0d314ffce266aa824ff99b89cbc90d277ce165ff095b78419d4234eba"},"schema_version":"1.0","source":{"id":"2301.03175","kind":"arxiv","version":1}},"canonical_sha256":"a60d2bbe5fd185b5fca355f017af8ebc987dd2bb43d281061cde3e80cb84005b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a60d2bbe5fd185b5fca355f017af8ebc987dd2bb43d281061cde3e80cb84005b","first_computed_at":"2026-07-05T05:31:26.471783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:31:26.471783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q0x0MqNzGAEXcUWU4b+AmZM1HpFrMoL7hYudh+QS5i9KxDx7Kb160+M9qsFwC2YdIlKYy5nTQGaA5D1FwHckAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:31:26.472155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.03175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a3b8f0e32a8dd09fa79d874a01abe7d6bd8b58120888e2ce6f8eb91680895e7","sha256:df46785b38adc24aaccd697e26bd355da905be8196443d7e0649de4eb9a81442"],"state_sha256":"5bfab65c2ca27f9ba5c49cd76d23bb5a7abef7a8bfbc4ae666e6b342bcdedf42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+3Q6yHauqi5vnVBR+qoBvuI1sS5rKH0U/U/tWfnN8b1WqUCGPLlsgjsdrYXB1cHjwl9uFuo4Qb1YgBEPHp6eBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T09:55:08.316700Z","bundle_sha256":"3550d1f7fd849ac68abd018a2bce00e1f69a2b3a091592970fb8b0a0b40b92be"}}