{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HKJP7BESJDRFAISWVI5T4URJU6","short_pith_number":"pith:HKJP7BES","schema_version":"1.0","canonical_sha256":"3a92ff849248e2502256aa3b3e5229a781d5d58a3f36bb88207b82fd5afbb9bf","source":{"kind":"arxiv","id":"2503.18806","version":1},"attestation_state":"computed","paper":{"title":"Formalization of Algorithms for Optimization with Block Structures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenyi Li, Pengfei Hao, Yifan Bai, Yunxi Duan, Yuqing Gao, Zaiwen Wen, Zichen Wang","submitted_at":"2025-03-24T15:49:32Z","abstract_excerpt":"Block-structured problems are central to advances in numerical optimization and machine learning. This paper provides the formalization of convergence analysis for two pivotal algorithms in such settings: the block coordinate descent (BCD) method and the alternating direction method of multipliers (ADMM). Utilizing the type-theory-based proof assistant Lean4, we develop a rigorous framework to formally represent these algorithms. Essential concepts in nonsmooth and nonconvex optimization are formalized, notably subdifferentials, which extend the classical differentiability to handle nonsmooth "},"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":"2503.18806","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-24T15:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"07a81f5e3303e58a8314b012a5caa88c0716577133ee14e02ff9b8d33ffc6767","abstract_canon_sha256":"8e3c415e8e09e4c00ace43c3651a118c9b573e608706862033b4cd6191b1b460"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:26.877688Z","signature_b64":"j0yNqQgYdftThdrZFdJqCEitWJAZI2ygS5pu8G/JdV4wKcwTJNoyCDecQcU2d7pOp5P2LjpUS5JP+4OWKOwTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a92ff849248e2502256aa3b3e5229a781d5d58a3f36bb88207b82fd5afbb9bf","last_reissued_at":"2026-07-05T10:38:26.877225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:26.877225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formalization of Algorithms for Optimization with Block Structures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenyi Li, Pengfei Hao, Yifan Bai, Yunxi Duan, Yuqing Gao, Zaiwen Wen, Zichen Wang","submitted_at":"2025-03-24T15:49:32Z","abstract_excerpt":"Block-structured problems are central to advances in numerical optimization and machine learning. This paper provides the formalization of convergence analysis for two pivotal algorithms in such settings: the block coordinate descent (BCD) method and the alternating direction method of multipliers (ADMM). Utilizing the type-theory-based proof assistant Lean4, we develop a rigorous framework to formally represent these algorithms. Essential concepts in nonsmooth and nonconvex optimization are formalized, notably subdifferentials, which extend the classical differentiability to handle nonsmooth "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.18806","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/2503.18806/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":"2503.18806","created_at":"2026-07-05T10:38:26.877300+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.18806v1","created_at":"2026-07-05T10:38:26.877300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.18806","created_at":"2026-07-05T10:38:26.877300+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKJP7BESJDRF","created_at":"2026-07-05T10:38:26.877300+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKJP7BESJDRFAISW","created_at":"2026-07-05T10:38:26.877300+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKJP7BES","created_at":"2026-07-05T10:38:26.877300+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25412","citing_title":"Formalization of Line Search Methods by Lean","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6","json":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6.json","graph_json":"https://pith.science/api/pith-number/HKJP7BESJDRFAISWVI5T4URJU6/graph.json","events_json":"https://pith.science/api/pith-number/HKJP7BESJDRFAISWVI5T4URJU6/events.json","paper":"https://pith.science/paper/HKJP7BES"},"agent_actions":{"view_html":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6","download_json":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6.json","view_paper":"https://pith.science/paper/HKJP7BES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.18806&json=true","fetch_graph":"https://pith.science/api/pith-number/HKJP7BESJDRFAISWVI5T4URJU6/graph.json","fetch_events":"https://pith.science/api/pith-number/HKJP7BESJDRFAISWVI5T4URJU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/action/storage_attestation","attest_author":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/action/author_attestation","sign_citation":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/action/citation_signature","submit_replication":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/action/replication_record"}},"created_at":"2026-07-05T10:38:26.877300+00:00","updated_at":"2026-07-05T10:38:26.877300+00:00"}