{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:E4PKHHF3BLMVEUXYS3ZYPJXTSP","short_pith_number":"pith:E4PKHHF3","canonical_record":{"source":{"id":"2509.02804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T20:15:47Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"40f8d0afd8020d88fca22b842f590f60717a48b5a84ef4be36712c855cb05271","abstract_canon_sha256":"03af72f846858e47fac0fc9eba68cf644de00c79f5f08cd5837591b56deff399"},"schema_version":"1.0"},"canonical_sha256":"271ea39cbb0ad95252f896f387a6f393c13422e4885693007b76681f51866f92","source":{"kind":"arxiv","id":"2509.02804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.02804","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"2509.02804v1","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02804","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"E4PKHHF3BLMV","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"pith_short_16","alias_value":"E4PKHHF3BLMVEUXY","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"pith_short_8","alias_value":"E4PKHHF3","created_at":"2026-07-05T12:03:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:E4PKHHF3BLMVEUXYS3ZYPJXTSP","target":"record","payload":{"canonical_record":{"source":{"id":"2509.02804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T20:15:47Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"40f8d0afd8020d88fca22b842f590f60717a48b5a84ef4be36712c855cb05271","abstract_canon_sha256":"03af72f846858e47fac0fc9eba68cf644de00c79f5f08cd5837591b56deff399"},"schema_version":"1.0"},"canonical_sha256":"271ea39cbb0ad95252f896f387a6f393c13422e4885693007b76681f51866f92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:57.967855Z","signature_b64":"Y9xcMHWbLdtD+LIwr3+beMRMs9SDoE3tAcKSv1Hrl/WvK3eWtElmkOFl9L0A+uRhrHMtu97gBnSyPude1ExnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"271ea39cbb0ad95252f896f387a6f393c13422e4885693007b76681f51866f92","last_reissued_at":"2026-07-05T12:03:57.967324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:57.967324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.02804","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-05T12:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mcu954Nt/Cjvmv9aOAv+jskyqkWQhW8BN2jWQTlvpbqMNs01thJyAOJnGr+p6drsXGujhwNU6+c6XlHFWz7gBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:12:56.331802Z"},"content_sha256":"ffc3ba5031675501b359744d837fcbffeb7d3abe9794690015b65205cae381be","schema_version":"1.0","event_id":"sha256:ffc3ba5031675501b359744d837fcbffeb7d3abe9794690015b65205cae381be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:E4PKHHF3BLMVEUXYS3ZYPJXTSP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Feng-Yi Liao, Yang Zheng","submitted_at":"2025-09-02T20:15:47Z","abstract_excerpt":"We study the problem of minimizing a $m$-weakly convex and possibly nonsmooth function. Weak convexity provides a broad framework that subsumes convex, smooth, and many composite nonconvex functions. In this work, we propose a $\\textit{proximal descent method}$, a simple and efficient first-order algorithm that combines the inexact proximal point method with classical convex bundle techniques. Our analysis establishes explicit non-asymptotic convergence rates in terms of $(\\eta,\\epsilon)$-inexact stationarity. In particular, the method finds an $(\\eta,\\epsilon)$-inexact stationary point using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.02804","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/2509.02804/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-05T12:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nF2CQIPWkzDlqHNLVXM6cy0i5qIaSHgL43OeWD/W41W2i2EMygo8CKYF0tX1kdgGoQI7islhUdn6A0TttGG4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:12:56.333254Z"},"content_sha256":"362a0fc86729a11cc994227ca64b95e6ca689c30ee7788282bd72b84621c08ea","schema_version":"1.0","event_id":"sha256:362a0fc86729a11cc994227ca64b95e6ca689c30ee7788282bd72b84621c08ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4PKHHF3BLMVEUXYS3ZYPJXTSP/bundle.json","state_url":"https://pith.science/pith/E4PKHHF3BLMVEUXYS3ZYPJXTSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4PKHHF3BLMVEUXYS3ZYPJXTSP/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-08T05:12:56Z","links":{"resolver":"https://pith.science/pith/E4PKHHF3BLMVEUXYS3ZYPJXTSP","bundle":"https://pith.science/pith/E4PKHHF3BLMVEUXYS3ZYPJXTSP/bundle.json","state":"https://pith.science/pith/E4PKHHF3BLMVEUXYS3ZYPJXTSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4PKHHF3BLMVEUXYS3ZYPJXTSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:E4PKHHF3BLMVEUXYS3ZYPJXTSP","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":"03af72f846858e47fac0fc9eba68cf644de00c79f5f08cd5837591b56deff399","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T20:15:47Z","title_canon_sha256":"40f8d0afd8020d88fca22b842f590f60717a48b5a84ef4be36712c855cb05271"},"schema_version":"1.0","source":{"id":"2509.02804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.02804","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"2509.02804v1","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02804","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"E4PKHHF3BLMV","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"pith_short_16","alias_value":"E4PKHHF3BLMVEUXY","created_at":"2026-07-05T12:03:57Z"},{"alias_kind":"pith_short_8","alias_value":"E4PKHHF3","created_at":"2026-07-05T12:03:57Z"}],"graph_snapshots":[{"event_id":"sha256:362a0fc86729a11cc994227ca64b95e6ca689c30ee7788282bd72b84621c08ea","target":"graph","created_at":"2026-07-05T12:03:57Z","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/2509.02804/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of minimizing a $m$-weakly convex and possibly nonsmooth function. Weak convexity provides a broad framework that subsumes convex, smooth, and many composite nonconvex functions. In this work, we propose a $\\textit{proximal descent method}$, a simple and efficient first-order algorithm that combines the inexact proximal point method with classical convex bundle techniques. Our analysis establishes explicit non-asymptotic convergence rates in terms of $(\\eta,\\epsilon)$-inexact stationarity. In particular, the method finds an $(\\eta,\\epsilon)$-inexact stationary point using ","authors_text":"Feng-Yi Liao, Yang Zheng","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.02804","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:ffc3ba5031675501b359744d837fcbffeb7d3abe9794690015b65205cae381be","target":"record","created_at":"2026-07-05T12:03:57Z","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":"03af72f846858e47fac0fc9eba68cf644de00c79f5f08cd5837591b56deff399","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-02T20:15:47Z","title_canon_sha256":"40f8d0afd8020d88fca22b842f590f60717a48b5a84ef4be36712c855cb05271"},"schema_version":"1.0","source":{"id":"2509.02804","kind":"arxiv","version":1}},"canonical_sha256":"271ea39cbb0ad95252f896f387a6f393c13422e4885693007b76681f51866f92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"271ea39cbb0ad95252f896f387a6f393c13422e4885693007b76681f51866f92","first_computed_at":"2026-07-05T12:03:57.967324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:03:57.967324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y9xcMHWbLdtD+LIwr3+beMRMs9SDoE3tAcKSv1Hrl/WvK3eWtElmkOFl9L0A+uRhrHMtu97gBnSyPude1ExnCw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:03:57.967855Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.02804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffc3ba5031675501b359744d837fcbffeb7d3abe9794690015b65205cae381be","sha256:362a0fc86729a11cc994227ca64b95e6ca689c30ee7788282bd72b84621c08ea"],"state_sha256":"8981c6d2525ab1b864d8403fe02a594c75ff30104d6a4b6b0f441edbc30db3d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dfVdGuCikA0Y/djA39jyw/4PBsrwpCyteoV48Cu2SPAdRDLmg0e79NWzuR2OhUyKoYay2wsR8Wty0d/IOx0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T05:12:56.339967Z","bundle_sha256":"98dbdedddcd27e7b7cd038469daa80bc881406585d15ede6e43e5256bff7592a"}}