{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:K27GZ2PRIMDROAQV3C5U2ZX4FZ","short_pith_number":"pith:K27GZ2PR","schema_version":"1.0","canonical_sha256":"56be6ce9f14307170215d8bb4d66fc2e70e5055337f28250b1838e77c8ef8ded","source":{"kind":"arxiv","id":"2607.17495","version":1},"attestation_state":"computed","paper":{"title":"CADMM-Prox: A Bi-level Consensus ADMM for Non-smooth Non-convex Distributed Consensus Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Apostolos I. Rikos, Karl H. Johansson, Shuting Wu, Xu Du","submitted_at":"2026-07-20T02:53:36Z","abstract_excerpt":"Non-smooth and non-convex optimization problems are pervasive in machine learning, control, and signal processing, due to the need for sparse solutions and the inherently non-convex nature of many objective functions. In this paper, we study non-smooth and non-convex distributed optimization problems. We propose a novel bi-level Consensus Alternating Direction Method of Multipliers (ADMM) algorithm, termed CADMM-Prox. The proposed algorithm integrates classical Consensus ADMM with a proximal mechanism by introducing a sufficiently large proximal term associated with an outer-level variable. Un"},"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":"2607.17495","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-20T02:53:36Z","cross_cats_sorted":[],"title_canon_sha256":"c50b3ebb6e269d7993ad75911e5af6fd89bdd516bd889bbfe61c0589ff24c681","abstract_canon_sha256":"d6e2eb7b5626784d5dfe5f591442ca35068b58a9705c4e05a2481d6cb37a5a7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:48.563023Z","signature_b64":"FyoZUPO7Q8We071vb04yZ4mSfw2wjj13+FpIXIOHQ5Mq/MsoMhHBx+4MgOGL016b5jaR+kJWqpBhqEHwHsqnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56be6ce9f14307170215d8bb4d66fc2e70e5055337f28250b1838e77c8ef8ded","last_reissued_at":"2026-07-21T01:21:48.562160Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:48.562160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CADMM-Prox: A Bi-level Consensus ADMM for Non-smooth Non-convex Distributed Consensus Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Apostolos I. Rikos, Karl H. Johansson, Shuting Wu, Xu Du","submitted_at":"2026-07-20T02:53:36Z","abstract_excerpt":"Non-smooth and non-convex optimization problems are pervasive in machine learning, control, and signal processing, due to the need for sparse solutions and the inherently non-convex nature of many objective functions. In this paper, we study non-smooth and non-convex distributed optimization problems. We propose a novel bi-level Consensus Alternating Direction Method of Multipliers (ADMM) algorithm, termed CADMM-Prox. The proposed algorithm integrates classical Consensus ADMM with a proximal mechanism by introducing a sufficiently large proximal term associated with an outer-level variable. Un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17495","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/2607.17495/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":"2607.17495","created_at":"2026-07-21T01:21:48.562607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.17495v1","created_at":"2026-07-21T01:21:48.562607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17495","created_at":"2026-07-21T01:21:48.562607+00:00"},{"alias_kind":"pith_short_12","alias_value":"K27GZ2PRIMDR","created_at":"2026-07-21T01:21:48.562607+00:00"},{"alias_kind":"pith_short_16","alias_value":"K27GZ2PRIMDROAQV","created_at":"2026-07-21T01:21:48.562607+00:00"},{"alias_kind":"pith_short_8","alias_value":"K27GZ2PR","created_at":"2026-07-21T01:21:48.562607+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ","json":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ.json","graph_json":"https://pith.science/api/pith-number/K27GZ2PRIMDROAQV3C5U2ZX4FZ/graph.json","events_json":"https://pith.science/api/pith-number/K27GZ2PRIMDROAQV3C5U2ZX4FZ/events.json","paper":"https://pith.science/paper/K27GZ2PR"},"agent_actions":{"view_html":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ","download_json":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ.json","view_paper":"https://pith.science/paper/K27GZ2PR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.17495&json=true","fetch_graph":"https://pith.science/api/pith-number/K27GZ2PRIMDROAQV3C5U2ZX4FZ/graph.json","fetch_events":"https://pith.science/api/pith-number/K27GZ2PRIMDROAQV3C5U2ZX4FZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ/action/storage_attestation","attest_author":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ/action/author_attestation","sign_citation":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ/action/citation_signature","submit_replication":"https://pith.science/pith/K27GZ2PRIMDROAQV3C5U2ZX4FZ/action/replication_record"}},"created_at":"2026-07-21T01:21:48.562607+00:00","updated_at":"2026-07-21T01:21:48.562607+00:00"}