{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6KSOQ3RLI6DLMWDAHWBT3L7HPG","short_pith_number":"pith:6KSOQ3RL","schema_version":"1.0","canonical_sha256":"f2a4e86e2b4786b658603d833dafe779b23973835c6544f90b2134eee8e6acda","source":{"kind":"arxiv","id":"1608.08031","version":1},"attestation_state":"computed","paper":{"title":"A Bregman Splitting Algorithm for Distributed Optimization over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinming Xu, Lihua Xie, Shanying Zhu, Yeng Chai Soh","submitted_at":"2016-08-29T12:47:30Z","abstract_excerpt":"We consider distributed optimization problems in which a group of agents are to collaboratively seek the global optimum through peer-to-peer communication networks. The problem arises in various application areas, such as resource allocation, sensor fusion and distributed learning. We propose a general efficient distributed algorithm--termed Distributed Forward-Backward Bregman Splitting (D-FBBS)--to simultaneously solve the above primal problem as well as its dual based on Bregman method and operator splitting. The proposed algorithm allows agents to communicate asynchronously and thus lends "},"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":"1608.08031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-29T12:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"f4f14a8602553ed08c060c2683c292dfdebf9cdc4f70f32d3ab84433353e82ac","abstract_canon_sha256":"dab856b495d5e992be9e7aa89f88d2ba68103f0c4ef518a8045dbc35f9668037"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:49.296152Z","signature_b64":"IBelb7s+QKS+t7/7H+DrqdDHFtZPI7jxKX/LzfMeYqqizIn7bDosau8Uv+EPxMWr3En3TOx2TsHRVqd24+yFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2a4e86e2b4786b658603d833dafe779b23973835c6544f90b2134eee8e6acda","last_reissued_at":"2026-05-18T01:07:49.295700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:49.295700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bregman Splitting Algorithm for Distributed Optimization over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinming Xu, Lihua Xie, Shanying Zhu, Yeng Chai Soh","submitted_at":"2016-08-29T12:47:30Z","abstract_excerpt":"We consider distributed optimization problems in which a group of agents are to collaboratively seek the global optimum through peer-to-peer communication networks. The problem arises in various application areas, such as resource allocation, sensor fusion and distributed learning. We propose a general efficient distributed algorithm--termed Distributed Forward-Backward Bregman Splitting (D-FBBS)--to simultaneously solve the above primal problem as well as its dual based on Bregman method and operator splitting. The proposed algorithm allows agents to communicate asynchronously and thus lends "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08031","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":""},"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":"1608.08031","created_at":"2026-05-18T01:07:49.295772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08031v1","created_at":"2026-05-18T01:07:49.295772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08031","created_at":"2026-05-18T01:07:49.295772+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KSOQ3RLI6DL","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KSOQ3RLI6DLMWDA","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KSOQ3RL","created_at":"2026-05-18T12:30:01.593930+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/6KSOQ3RLI6DLMWDAHWBT3L7HPG","json":"https://pith.science/pith/6KSOQ3RLI6DLMWDAHWBT3L7HPG.json","graph_json":"https://pith.science/api/pith-number/6KSOQ3RLI6DLMWDAHWBT3L7HPG/graph.json","events_json":"https://pith.science/api/pith-number/6KSOQ3RLI6DLMWDAHWBT3L7HPG/events.json","paper":"https://pith.science/paper/6KSOQ3RL"},"agent_actions":{"view_html":"https://pith.science/pith/6KSOQ3RLI6DLMWDAHWBT3L7HPG","download_json":"https://pith.science/pith/6KSOQ3RLI6DLMWDAHWBT3L7HPG.json","view_paper":"https://pith.science/paper/6KSOQ3RL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08031&json=true","fetch_graph":"https://pith.science/api/pith-number/6KSOQ3RLI6DLMWDAHWBT3L7HPG/graph.json","fetch_events":"https://pith.science/api/pith-number/6KSOQ3RLI6DLMWDAHWBT3L7HPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KSOQ3RLI6DLMWDAHWBT3L7HPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KSOQ3RLI6DLMWDAHWBT3L7HPG/action/storage_attestation","attest_author":"https://pith.science/pith/6KSOQ3RLI6DLMWDAHWBT3L7HPG/action/author_attestation","sign_citation":"https://pith.science/pith/6KSOQ3RLI6DLMWDAHWBT3L7HPG/action/citation_signature","submit_replication":"https://pith.science/pith/6KSOQ3RLI6DLMWDAHWBT3L7HPG/action/replication_record"}},"created_at":"2026-05-18T01:07:49.295772+00:00","updated_at":"2026-05-18T01:07:49.295772+00:00"}