{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PAHBY4TS3XEGJOAZ5RRAGXE5ZI","short_pith_number":"pith:PAHBY4TS","schema_version":"1.0","canonical_sha256":"780e1c7272ddc864b819ec62035c9dca1c550044633bb784f55a34fa81a79322","source":{"kind":"arxiv","id":"2405.12655","version":1},"attestation_state":"computed","paper":{"title":"Lipschitz minimization and the Goldstein modulus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrian S. Lewis, Siyu Kong","submitted_at":"2024-05-21T10:08:12Z","abstract_excerpt":"Goldstein's 1977 idealized iteration for minimizing a Lipschitz objective fixes a distance - the step size - and relies on a certain approximate subgradient. That \"Goldstein subgradient\" is the shortest convex combination of objective gradients at points within that distance of the current iterate. A recent implementable Goldstein-style algorithm allows a remarkable complexity analysis (Zhang et al. 2020), and a more sophisticated variant (Davis and Jiang, 2022) leverages typical objective geometry to force near-linear convergence. To explore such methods, we introduce a new modulus, based on "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.12655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-21T10:08:12Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"1c95b46fc667016fd57dc5be6d7ef809de186cd457ea780375e6644cabfbf150","abstract_canon_sha256":"9994cc107e344510e7bb8c828593ce70f3260af7d801ecb11822bd2926a451e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:23.644533Z","signature_b64":"xwWRgsxL4hn16YBLWepXQhgHY+xFIUHrakLm/bTwJTygyhLiUJDkL7Nt3MbHZTZ/E0ywd4pNc4IuxGzql7pJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"780e1c7272ddc864b819ec62035c9dca1c550044633bb784f55a34fa81a79322","last_reissued_at":"2026-07-05T08:21:23.644077Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:23.644077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lipschitz minimization and the Goldstein modulus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrian S. Lewis, Siyu Kong","submitted_at":"2024-05-21T10:08:12Z","abstract_excerpt":"Goldstein's 1977 idealized iteration for minimizing a Lipschitz objective fixes a distance - the step size - and relies on a certain approximate subgradient. That \"Goldstein subgradient\" is the shortest convex combination of objective gradients at points within that distance of the current iterate. A recent implementable Goldstein-style algorithm allows a remarkable complexity analysis (Zhang et al. 2020), and a more sophisticated variant (Davis and Jiang, 2022) leverages typical objective geometry to force near-linear convergence. To explore such methods, we introduce a new modulus, based on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12655","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/2405.12655/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.12655","created_at":"2026-07-05T08:21:23.644141+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.12655v1","created_at":"2026-07-05T08:21:23.644141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12655","created_at":"2026-07-05T08:21:23.644141+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAHBY4TS3XEG","created_at":"2026-07-05T08:21:23.644141+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAHBY4TS3XEGJOAZ","created_at":"2026-07-05T08:21:23.644141+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAHBY4TS","created_at":"2026-07-05T08:21:23.644141+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07143","citing_title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI","json":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI.json","graph_json":"https://pith.science/api/pith-number/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/graph.json","events_json":"https://pith.science/api/pith-number/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/events.json","paper":"https://pith.science/paper/PAHBY4TS"},"agent_actions":{"view_html":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI","download_json":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI.json","view_paper":"https://pith.science/paper/PAHBY4TS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.12655&json=true","fetch_graph":"https://pith.science/api/pith-number/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/graph.json","fetch_events":"https://pith.science/api/pith-number/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/action/storage_attestation","attest_author":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/action/author_attestation","sign_citation":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/action/citation_signature","submit_replication":"https://pith.science/pith/PAHBY4TS3XEGJOAZ5RRAGXE5ZI/action/replication_record"}},"created_at":"2026-07-05T08:21:23.644141+00:00","updated_at":"2026-07-05T08:21:23.644141+00:00"}