{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FNWCC3JBBZK2WMEXH4HBWF6O77","short_pith_number":"pith:FNWCC3JB","schema_version":"1.0","canonical_sha256":"2b6c216d210e55ab30973f0e1b17ceffd364111513a73c411949152f8545f135","source":{"kind":"arxiv","id":"1404.6264","version":4},"attestation_state":"computed","paper":{"title":"EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gang Wu, Qing Ling, Wei Shi, Wotao Yin","submitted_at":"2014-04-24T20:28:44Z","abstract_excerpt":"Recently, there have been growing interests in solving consensus optimization problems in a multi-agent network. In this paper, we develop a decentralized algorithm for the consensus optimization problem $$\\min\\limits_{x\\in\\mathbb{R}^p}~\\bar{f}(x)=\\frac{1}{n}\\sum\\limits_{i=1}^n f_i(x),$$ which is defined over a connected network of $n$ agents, where each function $f_i$ is held privately by agent $i$ and encodes the agent's data and objective. All the agents shall collaboratively find the minimizer while each agent can only communicate with its neighbors. Such a computation scheme avoids a data"},"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":"1404.6264","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-24T20:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"9f164ac214cf4f80927fafc597a714f0a83c3dd5018b038054b62fdb83328e66","abstract_canon_sha256":"e2b0a493ee6439a94c45283d0e0be64980ecf5532cb41974294b074fc998229b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:30.828735Z","signature_b64":"+4Zi+ckBrnc+j1wtapkTlSXKB6hzuAh3FVMZMv1nAm53P+8HNqpHmzATbuzg8VO3EUFigKlIH3HkpqZudZkLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b6c216d210e55ab30973f0e1b17ceffd364111513a73c411949152f8545f135","last_reissued_at":"2026-05-18T02:32:30.828355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:30.828355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gang Wu, Qing Ling, Wei Shi, Wotao Yin","submitted_at":"2014-04-24T20:28:44Z","abstract_excerpt":"Recently, there have been growing interests in solving consensus optimization problems in a multi-agent network. In this paper, we develop a decentralized algorithm for the consensus optimization problem $$\\min\\limits_{x\\in\\mathbb{R}^p}~\\bar{f}(x)=\\frac{1}{n}\\sum\\limits_{i=1}^n f_i(x),$$ which is defined over a connected network of $n$ agents, where each function $f_i$ is held privately by agent $i$ and encodes the agent's data and objective. All the agents shall collaboratively find the minimizer while each agent can only communicate with its neighbors. Such a computation scheme avoids a data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6264","kind":"arxiv","version":4},"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":"1404.6264","created_at":"2026-05-18T02:32:30.828422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6264v4","created_at":"2026-05-18T02:32:30.828422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6264","created_at":"2026-05-18T02:32:30.828422+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNWCC3JBBZK2","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNWCC3JBBZK2WMEX","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNWCC3JB","created_at":"2026-05-18T12:28:28.263976+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/FNWCC3JBBZK2WMEXH4HBWF6O77","json":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77.json","graph_json":"https://pith.science/api/pith-number/FNWCC3JBBZK2WMEXH4HBWF6O77/graph.json","events_json":"https://pith.science/api/pith-number/FNWCC3JBBZK2WMEXH4HBWF6O77/events.json","paper":"https://pith.science/paper/FNWCC3JB"},"agent_actions":{"view_html":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77","download_json":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77.json","view_paper":"https://pith.science/paper/FNWCC3JB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6264&json=true","fetch_graph":"https://pith.science/api/pith-number/FNWCC3JBBZK2WMEXH4HBWF6O77/graph.json","fetch_events":"https://pith.science/api/pith-number/FNWCC3JBBZK2WMEXH4HBWF6O77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/action/storage_attestation","attest_author":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/action/author_attestation","sign_citation":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/action/citation_signature","submit_replication":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/action/replication_record"}},"created_at":"2026-05-18T02:32:30.828422+00:00","updated_at":"2026-05-18T02:32:30.828422+00:00"}