{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IOHBYP3TEW3UZLGYBTKREULDBW","short_pith_number":"pith:IOHBYP3T","canonical_record":{"source":{"id":"1810.10051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-23T19:01:21Z","cross_cats_sorted":[],"title_canon_sha256":"dcd46529129a5d6ed353cbbece08f7bb5cefbfd4227e07e67b4c6ec556fd0e24","abstract_canon_sha256":"f72327681fd9e080c98bb7f949078ee999188b351ced1921763f1cbd081e90e2"},"schema_version":"1.0"},"canonical_sha256":"438e1c3f7325b74cacd80cd51251630d8f812ec2ce018fd34c4a4cbe45d669be","source":{"kind":"arxiv","id":"1810.10051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10051","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10051v1","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10051","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"IOHBYP3TEW3U","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IOHBYP3TEW3UZLGY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IOHBYP3T","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IOHBYP3TEW3UZLGYBTKREULDBW","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-23T19:01:21Z","cross_cats_sorted":[],"title_canon_sha256":"dcd46529129a5d6ed353cbbece08f7bb5cefbfd4227e07e67b4c6ec556fd0e24","abstract_canon_sha256":"f72327681fd9e080c98bb7f949078ee999188b351ced1921763f1cbd081e90e2"},"schema_version":"1.0"},"canonical_sha256":"438e1c3f7325b74cacd80cd51251630d8f812ec2ce018fd34c4a4cbe45d669be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.379287Z","signature_b64":"MMmsq/VsH4BvZmEXfBfQme26vLYa31hoolu5ibQxOGKW0MtPyieoYye15WyCL+5GD8QGgU3tpu4RPiaZADt5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"438e1c3f7325b74cacd80cd51251630d8f812ec2ce018fd34c4a4cbe45d669be","last_reissued_at":"2026-05-18T00:02:24.378634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.378634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10051","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-05-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0vgzpToAidLLbhPqVoPRdxjtY4jKzHPWgPC74sfwzt2gOnYyyUtIRuMFVX/LF4aVfWLWc+R0nAOHESLs59SDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:52:16.783115Z"},"content_sha256":"373cce8c3c466457a7c5607382d087f3ad6305515452bab13af02339b98b4b75","schema_version":"1.0","event_id":"sha256:373cce8c3c466457a7c5607382d087f3ad6305515452bab13af02339b98b4b75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IOHBYP3TEW3UZLGYBTKREULDBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jane Ye, Jin Zhang, Shangzhi Zeng, Xiangfeng Wang, Xiaoming Yuan","submitted_at":"2018-10-23T19:01:21Z","abstract_excerpt":"We develop new perturbation techniques for conducting convergence analysis of various first-order algorithms for a class of nonsmooth optimization problems. We consider the iteration scheme of an algorithm to construct a perturbed stationary point set-valued map, and define the perturbing parameter by the difference of two consecutive iterates. Then, we show that the calmness condition of the induced set-valued map, together with a local version of the proper separation of stationary value condition, is a sufficient condition to ensure the linear convergence of the algorithm. The equivalence o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10051","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":""},"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-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjc8m9oiLNkjO3oxDonaks8k8xNCW6aUhIcMgKJg08nVtNFi/KiVzRp116pVZ+wHoehZ9lXp/Ylf50qGxBQPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:52:16.783494Z"},"content_sha256":"b45102dc5dafd1a5823b55cd4420d5f0fef90306ee9bd943d6350b3d08e325b2","schema_version":"1.0","event_id":"sha256:b45102dc5dafd1a5823b55cd4420d5f0fef90306ee9bd943d6350b3d08e325b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOHBYP3TEW3UZLGYBTKREULDBW/bundle.json","state_url":"https://pith.science/pith/IOHBYP3TEW3UZLGYBTKREULDBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOHBYP3TEW3UZLGYBTKREULDBW/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-19T11:52:16Z","links":{"resolver":"https://pith.science/pith/IOHBYP3TEW3UZLGYBTKREULDBW","bundle":"https://pith.science/pith/IOHBYP3TEW3UZLGYBTKREULDBW/bundle.json","state":"https://pith.science/pith/IOHBYP3TEW3UZLGYBTKREULDBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOHBYP3TEW3UZLGYBTKREULDBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IOHBYP3TEW3UZLGYBTKREULDBW","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":"f72327681fd9e080c98bb7f949078ee999188b351ced1921763f1cbd081e90e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-23T19:01:21Z","title_canon_sha256":"dcd46529129a5d6ed353cbbece08f7bb5cefbfd4227e07e67b4c6ec556fd0e24"},"schema_version":"1.0","source":{"id":"1810.10051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10051","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10051v1","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10051","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"IOHBYP3TEW3U","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IOHBYP3TEW3UZLGY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IOHBYP3T","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:b45102dc5dafd1a5823b55cd4420d5f0fef90306ee9bd943d6350b3d08e325b2","target":"graph","created_at":"2026-05-18T00:02:24Z","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 develop new perturbation techniques for conducting convergence analysis of various first-order algorithms for a class of nonsmooth optimization problems. We consider the iteration scheme of an algorithm to construct a perturbed stationary point set-valued map, and define the perturbing parameter by the difference of two consecutive iterates. Then, we show that the calmness condition of the induced set-valued map, together with a local version of the proper separation of stationary value condition, is a sufficient condition to ensure the linear convergence of the algorithm. The equivalence o","authors_text":"Jane Ye, Jin Zhang, Shangzhi Zeng, Xiangfeng Wang, Xiaoming Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-23T19:01:21Z","title":"Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10051","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:373cce8c3c466457a7c5607382d087f3ad6305515452bab13af02339b98b4b75","target":"record","created_at":"2026-05-18T00:02:24Z","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":"f72327681fd9e080c98bb7f949078ee999188b351ced1921763f1cbd081e90e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-23T19:01:21Z","title_canon_sha256":"dcd46529129a5d6ed353cbbece08f7bb5cefbfd4227e07e67b4c6ec556fd0e24"},"schema_version":"1.0","source":{"id":"1810.10051","kind":"arxiv","version":1}},"canonical_sha256":"438e1c3f7325b74cacd80cd51251630d8f812ec2ce018fd34c4a4cbe45d669be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"438e1c3f7325b74cacd80cd51251630d8f812ec2ce018fd34c4a4cbe45d669be","first_computed_at":"2026-05-18T00:02:24.378634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:24.378634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMmsq/VsH4BvZmEXfBfQme26vLYa31hoolu5ibQxOGKW0MtPyieoYye15WyCL+5GD8QGgU3tpu4RPiaZADt5CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:24.379287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:373cce8c3c466457a7c5607382d087f3ad6305515452bab13af02339b98b4b75","sha256:b45102dc5dafd1a5823b55cd4420d5f0fef90306ee9bd943d6350b3d08e325b2"],"state_sha256":"9dde346be464a7c6e07051d3c94add6b56830a629e225b3351f6416629239e8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmJKaCM3N62V0I/4ZWt0wxGs8vQ9x+OS6xwGavntfCJ1vRGwIVVjcaNjPyve9NxB4oc9HmA7LX5sFVGfkEuXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:52:16.785127Z","bundle_sha256":"9301a5ff3773ad2e33c761883144ccedeff09b91e2fdb0bc7986765c9a6714e7"}}