{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XXGTM2OMHZDYFJYXBRRKI5LKBD","short_pith_number":"pith:XXGTM2OM","schema_version":"1.0","canonical_sha256":"bdcd3669cc3e4782a7170c62a4756a08df3caa3e3ab80395240973f2294c4763","source":{"kind":"arxiv","id":"1604.07814","version":3},"attestation_state":"computed","paper":{"title":"Regularized Jacobi iteration for decentralized convex optimization with separable constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kostas Margellos, Luca Deori, Maria Prandini","submitted_at":"2016-04-26T19:49:25Z","abstract_excerpt":"We consider multi-agent, convex optimization programs subject to separable constraints, where the constraint function of each agent involves only its local decision vector, while the decision vectors of all agents are coupled via a common objective function. We focus on a regularized variant of the so called Jacobi algorithm for decentralized computation in such problems. We first consider the case where the objective function is quadratic, and provide a fixed-point theoretic analysis showing that the algorithm converges to a minimizer of the centralized problem. Moreover, we quantify the pote"},"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":"1604.07814","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-26T19:49:25Z","cross_cats_sorted":[],"title_canon_sha256":"5bcbf6f9194c73a24a0ccedd667ab1ad9ec45dad598eba4df637b45c5c7b6fcb","abstract_canon_sha256":"0592b6ab6a3bb0af65d22175fbdee1b5b0dc0d9702f3db92eab2168755384cf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:21.017191Z","signature_b64":"OSGFdPs48C0GSnp9yC6/5YxWNyTBL70PJ7lu6bSAd+YlLS0APg44Ld3shxeF645Vp2pHLKEZRZ+GhCIAUbHnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdcd3669cc3e4782a7170c62a4756a08df3caa3e3ab80395240973f2294c4763","last_reissued_at":"2026-05-18T00:47:21.016621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:21.016621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Jacobi iteration for decentralized convex optimization with separable constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kostas Margellos, Luca Deori, Maria Prandini","submitted_at":"2016-04-26T19:49:25Z","abstract_excerpt":"We consider multi-agent, convex optimization programs subject to separable constraints, where the constraint function of each agent involves only its local decision vector, while the decision vectors of all agents are coupled via a common objective function. We focus on a regularized variant of the so called Jacobi algorithm for decentralized computation in such problems. We first consider the case where the objective function is quadratic, and provide a fixed-point theoretic analysis showing that the algorithm converges to a minimizer of the centralized problem. Moreover, we quantify the pote"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07814","kind":"arxiv","version":3},"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":"1604.07814","created_at":"2026-05-18T00:47:21.016719+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07814v3","created_at":"2026-05-18T00:47:21.016719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07814","created_at":"2026-05-18T00:47:21.016719+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXGTM2OMHZDY","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXGTM2OMHZDYFJYX","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXGTM2OM","created_at":"2026-05-18T12:30:51.357362+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/XXGTM2OMHZDYFJYXBRRKI5LKBD","json":"https://pith.science/pith/XXGTM2OMHZDYFJYXBRRKI5LKBD.json","graph_json":"https://pith.science/api/pith-number/XXGTM2OMHZDYFJYXBRRKI5LKBD/graph.json","events_json":"https://pith.science/api/pith-number/XXGTM2OMHZDYFJYXBRRKI5LKBD/events.json","paper":"https://pith.science/paper/XXGTM2OM"},"agent_actions":{"view_html":"https://pith.science/pith/XXGTM2OMHZDYFJYXBRRKI5LKBD","download_json":"https://pith.science/pith/XXGTM2OMHZDYFJYXBRRKI5LKBD.json","view_paper":"https://pith.science/paper/XXGTM2OM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07814&json=true","fetch_graph":"https://pith.science/api/pith-number/XXGTM2OMHZDYFJYXBRRKI5LKBD/graph.json","fetch_events":"https://pith.science/api/pith-number/XXGTM2OMHZDYFJYXBRRKI5LKBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXGTM2OMHZDYFJYXBRRKI5LKBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXGTM2OMHZDYFJYXBRRKI5LKBD/action/storage_attestation","attest_author":"https://pith.science/pith/XXGTM2OMHZDYFJYXBRRKI5LKBD/action/author_attestation","sign_citation":"https://pith.science/pith/XXGTM2OMHZDYFJYXBRRKI5LKBD/action/citation_signature","submit_replication":"https://pith.science/pith/XXGTM2OMHZDYFJYXBRRKI5LKBD/action/replication_record"}},"created_at":"2026-05-18T00:47:21.016719+00:00","updated_at":"2026-05-18T00:47:21.016719+00:00"}