{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S7NYEOKHKELRIG5YYTWZQDG5VE","short_pith_number":"pith:S7NYEOKH","schema_version":"1.0","canonical_sha256":"97db8239475117141bb8c4ed980cdda90e958873c25614c7d79dbfb4da60135a","source":{"kind":"arxiv","id":"2505.09146","version":1},"attestation_state":"computed","paper":{"title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abolfazl Hashemi, Antesh Upadhyay, Sang Bin Moon","submitted_at":"2025-05-14T05:04:49Z","abstract_excerpt":"Large-scale constrained optimization problems are at the core of many tasks in control, signal processing, and machine learning. Notably, problems with functional constraints arise when, beyond a performance{\\nobreakdash-}centric goal (e.g., minimizing the empirical loss), one desires to satisfy other requirements such as robustness, fairness, etc. A simple method for such problems, which remarkably achieves optimal rates for non-smooth, convex, strongly convex, and weakly convex functions under first-order oracle, is Switching Gradient Method (SGM): in each iteration depending on a predetermi"},"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":"2505.09146","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T05:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"261df679c1253fc6ddfcb55daa236c8234d7ceab35c622f142b777ad5ac0def2","abstract_canon_sha256":"60de1d029e91207e108d62f8e3f639157ad8444d4a4a690a1252885b5bdd32f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:51.008358Z","signature_b64":"BCY46Vvx5mTnwzW0WixDV3uJZ86Ld18kX+C3vhcAsEZhCmZ6T8maY48CLO3KYAQ+rwRA5IKS6l2/hUS/2MEiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97db8239475117141bb8c4ed980cdda90e958873c25614c7d79dbfb4da60135a","last_reissued_at":"2026-07-05T11:02:51.007873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:51.007873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abolfazl Hashemi, Antesh Upadhyay, Sang Bin Moon","submitted_at":"2025-05-14T05:04:49Z","abstract_excerpt":"Large-scale constrained optimization problems are at the core of many tasks in control, signal processing, and machine learning. Notably, problems with functional constraints arise when, beyond a performance{\\nobreakdash-}centric goal (e.g., minimizing the empirical loss), one desires to satisfy other requirements such as robustness, fairness, etc. A simple method for such problems, which remarkably achieves optimal rates for non-smooth, convex, strongly convex, and weakly convex functions under first-order oracle, is Switching Gradient Method (SGM): in each iteration depending on a predetermi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09146","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/2505.09146/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":"2505.09146","created_at":"2026-07-05T11:02:51.007933+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.09146v1","created_at":"2026-07-05T11:02:51.007933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09146","created_at":"2026-07-05T11:02:51.007933+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7NYEOKHKELR","created_at":"2026-07-05T11:02:51.007933+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7NYEOKHKELRIG5Y","created_at":"2026-07-05T11:02:51.007933+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7NYEOKH","created_at":"2026-07-05T11:02:51.007933+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.05774","citing_title":"First-Order Softmax Weighted Switching Gradient Method for Distributed Stochastic Minimax Optimization with Stochastic Constraints","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE","json":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE.json","graph_json":"https://pith.science/api/pith-number/S7NYEOKHKELRIG5YYTWZQDG5VE/graph.json","events_json":"https://pith.science/api/pith-number/S7NYEOKHKELRIG5YYTWZQDG5VE/events.json","paper":"https://pith.science/paper/S7NYEOKH"},"agent_actions":{"view_html":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE","download_json":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE.json","view_paper":"https://pith.science/paper/S7NYEOKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.09146&json=true","fetch_graph":"https://pith.science/api/pith-number/S7NYEOKHKELRIG5YYTWZQDG5VE/graph.json","fetch_events":"https://pith.science/api/pith-number/S7NYEOKHKELRIG5YYTWZQDG5VE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE/action/storage_attestation","attest_author":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE/action/author_attestation","sign_citation":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE/action/citation_signature","submit_replication":"https://pith.science/pith/S7NYEOKHKELRIG5YYTWZQDG5VE/action/replication_record"}},"created_at":"2026-07-05T11:02:51.007933+00:00","updated_at":"2026-07-05T11:02:51.007933+00:00"}