{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HKJP7BESJDRFAISWVI5T4URJU6","short_pith_number":"pith:HKJP7BES","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"},"canonical_sha256":"3a92ff849248e2502256aa3b3e5229a781d5d58a3f36bb88207b82fd5afbb9bf","source":{"kind":"arxiv","id":"2503.18806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.18806","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"arxiv_version","alias_value":"2503.18806v1","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.18806","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"pith_short_12","alias_value":"HKJP7BESJDRF","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"pith_short_16","alias_value":"HKJP7BESJDRFAISW","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"pith_short_8","alias_value":"HKJP7BES","created_at":"2026-07-05T10:38:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HKJP7BESJDRFAISWVI5T4URJU6","target":"record","payload":{"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"},"canonical_sha256":"3a92ff849248e2502256aa3b3e5229a781d5d58a3f36bb88207b82fd5afbb9bf","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"},"source_kind":"arxiv","source_id":"2503.18806","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-05T10:38:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44tLGEd19AdP3u7p487H798iw79hMit8qT6+KOb2K0S7lDLtSTZ5vD2saH8fPpHYPBqD1S4ElOMC+1b64wZuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:29:58.248283Z"},"content_sha256":"eb22804771461fc4fde83a661b70498c0b2f5edec10d4279a5a5316db3b26eef","schema_version":"1.0","event_id":"sha256:eb22804771461fc4fde83a661b70498c0b2f5edec10d4279a5a5316db3b26eef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HKJP7BESJDRFAISWVI5T4URJU6","target":"graph","payload":{"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"},"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-05T10:38:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XrAlKsvADy+PFCgUzTsfSv4yv4ywANVMKFKXWeJUunQZq/zfgBDo0c4WCw2ReAOzn8DeuOvJ0mal/yGmwJoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:29:58.248887Z"},"content_sha256":"8b5497d6b907f19faf1cd380f8df02dfac8bc2f74a30cc9ff488153d11f09bec","schema_version":"1.0","event_id":"sha256:8b5497d6b907f19faf1cd380f8df02dfac8bc2f74a30cc9ff488153d11f09bec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/bundle.json","state_url":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKJP7BESJDRFAISWVI5T4URJU6/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-07T00:29:58Z","links":{"resolver":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6","bundle":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/bundle.json","state":"https://pith.science/pith/HKJP7BESJDRFAISWVI5T4URJU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKJP7BESJDRFAISWVI5T4URJU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HKJP7BESJDRFAISWVI5T4URJU6","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":"8e3c415e8e09e4c00ace43c3651a118c9b573e608706862033b4cd6191b1b460","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-24T15:49:32Z","title_canon_sha256":"07a81f5e3303e58a8314b012a5caa88c0716577133ee14e02ff9b8d33ffc6767"},"schema_version":"1.0","source":{"id":"2503.18806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.18806","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"arxiv_version","alias_value":"2503.18806v1","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.18806","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"pith_short_12","alias_value":"HKJP7BESJDRF","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"pith_short_16","alias_value":"HKJP7BESJDRFAISW","created_at":"2026-07-05T10:38:26Z"},{"alias_kind":"pith_short_8","alias_value":"HKJP7BES","created_at":"2026-07-05T10:38:26Z"}],"graph_snapshots":[{"event_id":"sha256:8b5497d6b907f19faf1cd380f8df02dfac8bc2f74a30cc9ff488153d11f09bec","target":"graph","created_at":"2026-07-05T10:38:26Z","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/2503.18806/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Chenyi Li, Pengfei Hao, Yifan Bai, Yunxi Duan, Yuqing Gao, Zaiwen Wen, Zichen Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-24T15:49:32Z","title":"Formalization of Algorithms for Optimization with Block Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.18806","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:eb22804771461fc4fde83a661b70498c0b2f5edec10d4279a5a5316db3b26eef","target":"record","created_at":"2026-07-05T10:38:26Z","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":"8e3c415e8e09e4c00ace43c3651a118c9b573e608706862033b4cd6191b1b460","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-24T15:49:32Z","title_canon_sha256":"07a81f5e3303e58a8314b012a5caa88c0716577133ee14e02ff9b8d33ffc6767"},"schema_version":"1.0","source":{"id":"2503.18806","kind":"arxiv","version":1}},"canonical_sha256":"3a92ff849248e2502256aa3b3e5229a781d5d58a3f36bb88207b82fd5afbb9bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a92ff849248e2502256aa3b3e5229a781d5d58a3f36bb88207b82fd5afbb9bf","first_computed_at":"2026-07-05T10:38:26.877225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:38:26.877225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j0yNqQgYdftThdrZFdJqCEitWJAZI2ygS5pu8G/JdV4wKcwTJNoyCDecQcU2d7pOp5P2LjpUS5JP+4OWKOwTBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:38:26.877688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.18806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb22804771461fc4fde83a661b70498c0b2f5edec10d4279a5a5316db3b26eef","sha256:8b5497d6b907f19faf1cd380f8df02dfac8bc2f74a30cc9ff488153d11f09bec"],"state_sha256":"bfdb75a0f469b4c3cd1128e1034d9f015fd9340570370c9cbc4f9cb39763c65d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYD4c7NiT8UvRzkJqLqKYA5nFtwpXA3KrxkCM63p3O9SiI/l8KirpdkAz/I/MRQNcXWHMA58C4EArOzMmvXTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:29:58.254765Z","bundle_sha256":"894f7ccab7fbf25f479f49c216cb404af13833aeed82cd7947425ef38ae803fb"}}