{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FNWCC3JBBZK2WMEXH4HBWF6O77","short_pith_number":"pith:FNWCC3JB","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"},"canonical_sha256":"2b6c216d210e55ab30973f0e1b17ceffd364111513a73c411949152f8545f135","source":{"kind":"arxiv","id":"1404.6264","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6264","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6264v4","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6264","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"FNWCC3JBBZK2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNWCC3JBBZK2WMEX","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNWCC3JB","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FNWCC3JBBZK2WMEXH4HBWF6O77","target":"record","payload":{"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"},"canonical_sha256":"2b6c216d210e55ab30973f0e1b17ceffd364111513a73c411949152f8545f135","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"},"source_kind":"arxiv","source_id":"1404.6264","source_version":4,"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-05-18T02:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7HG8t2w7wfUxEeABQEz58fcAl+X4UnIHptxr8rfEH1MpnDmMlXRoGV/Ve7vgfuje91X9yIC7XpCx8uxlKkbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:32.535984Z"},"content_sha256":"ed85b1e8e9d8a62841e44c8e11c0582f26941304480a68642d66e93795cca02f","schema_version":"1.0","event_id":"sha256:ed85b1e8e9d8a62841e44c8e11c0582f26941304480a68642d66e93795cca02f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FNWCC3JBBZK2WMEXH4HBWF6O77","target":"graph","payload":{"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"},"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-05-18T02:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUu2gS6xYzD7UjErfiw+iOhYIJYOlaSU3swpyswSWb7vYUNOuM+UcQoCuWuxGSGdWGwyzPi6LqZv5qZocD61AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:32.536344Z"},"content_sha256":"00bd8e54916de94ac7b059331cb2bb1e5b137d28eaa6ef392fd8e25949b92eab","schema_version":"1.0","event_id":"sha256:00bd8e54916de94ac7b059331cb2bb1e5b137d28eaa6ef392fd8e25949b92eab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/bundle.json","state_url":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/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-05-28T13:32:32Z","links":{"resolver":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77","bundle":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/bundle.json","state":"https://pith.science/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNWCC3JBBZK2WMEXH4HBWF6O77/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FNWCC3JBBZK2WMEXH4HBWF6O77","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":"e2b0a493ee6439a94c45283d0e0be64980ecf5532cb41974294b074fc998229b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-24T20:28:44Z","title_canon_sha256":"9f164ac214cf4f80927fafc597a714f0a83c3dd5018b038054b62fdb83328e66"},"schema_version":"1.0","source":{"id":"1404.6264","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6264","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6264v4","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6264","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"FNWCC3JBBZK2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNWCC3JBBZK2WMEX","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNWCC3JB","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:00bd8e54916de94ac7b059331cb2bb1e5b137d28eaa6ef392fd8e25949b92eab","target":"graph","created_at":"2026-05-18T02:32:30Z","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"},"paper":{"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","authors_text":"Gang Wu, Qing Ling, Wei Shi, Wotao Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-24T20:28:44Z","title":"EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6264","kind":"arxiv","version":4},"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:ed85b1e8e9d8a62841e44c8e11c0582f26941304480a68642d66e93795cca02f","target":"record","created_at":"2026-05-18T02:32:30Z","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":"e2b0a493ee6439a94c45283d0e0be64980ecf5532cb41974294b074fc998229b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-24T20:28:44Z","title_canon_sha256":"9f164ac214cf4f80927fafc597a714f0a83c3dd5018b038054b62fdb83328e66"},"schema_version":"1.0","source":{"id":"1404.6264","kind":"arxiv","version":4}},"canonical_sha256":"2b6c216d210e55ab30973f0e1b17ceffd364111513a73c411949152f8545f135","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b6c216d210e55ab30973f0e1b17ceffd364111513a73c411949152f8545f135","first_computed_at":"2026-05-18T02:32:30.828355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:30.828355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+4Zi+ckBrnc+j1wtapkTlSXKB6hzuAh3FVMZMv1nAm53P+8HNqpHmzATbuzg8VO3EUFigKlIH3HkpqZudZkLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:30.828735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6264","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed85b1e8e9d8a62841e44c8e11c0582f26941304480a68642d66e93795cca02f","sha256:00bd8e54916de94ac7b059331cb2bb1e5b137d28eaa6ef392fd8e25949b92eab"],"state_sha256":"fa69c86ec8e2b72eef5bb7771a1bbe4e9df5525217779cce7a8e39da3d00eca2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FYLWj1kKJdyMXZrWvpoeZQ33H+1DAUGB3PBUyyOmnPjtTCdBhx3t7XN0io7GsvKixsNUXKKuzK8Sii7313zSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:32:32.538594Z","bundle_sha256":"eeb40cff30d0be327c87a19a3aef493859db9e89065bb93efb5ebf45f0e04b9d"}}