{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L7AT7EIKI37ZSOTEHGDFUKTELV","short_pith_number":"pith:L7AT7EIK","schema_version":"1.0","canonical_sha256":"5fc13f910a46ff993a6439865a2a645d77ac51e8946f76bb7258708a9abccade","source":{"kind":"arxiv","id":"1607.04757","version":3},"attestation_state":"computed","paper":{"title":"ADD-OPT: Accelerated Distributed Directed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenguang Xi, Ran Xin, Usman A. Khan","submitted_at":"2016-07-16T16:20:09Z","abstract_excerpt":"In this paper, we consider distributed optimization problems where the goal is to minimize a sum of objective functions over a multi-agent network. We focus on the case when the inter-agent communication is described by a strongly-connected, \\emph{directed} graph. The proposed algorithm, ADD-OPT (Accelerated Distributed Directed Optimization), achieves the best known convergence rate for this class of problems,~$O(\\mu^{k}),0<\\mu<1$, given strongly-convex, objective functions with globally Lipschitz-continuous gradients, where~$k$ is the number of iterations. Moreover, ADD-OPT supports a wider "},"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":"1607.04757","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T16:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"8fa8e26a1314b95dc3684161ee952be4f72b38fd2ffe725f4e663eaf98490cc4","abstract_canon_sha256":"ac9436240174834dfa3e7dcc66622c106f9d62c5e7e51ec1643d666d0e2bdc5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:01.484061Z","signature_b64":"tuv1lQc3CsokBoxIbhDLb/mrAr6D6J4pyiOtzIVzzXetycvEIv9XFtlzOQLA9hg1H1O2bBz8FRq2onlz+HuHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc13f910a46ff993a6439865a2a645d77ac51e8946f76bb7258708a9abccade","last_reissued_at":"2026-05-18T00:14:01.483450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:01.483450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ADD-OPT: Accelerated Distributed Directed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenguang Xi, Ran Xin, Usman A. Khan","submitted_at":"2016-07-16T16:20:09Z","abstract_excerpt":"In this paper, we consider distributed optimization problems where the goal is to minimize a sum of objective functions over a multi-agent network. We focus on the case when the inter-agent communication is described by a strongly-connected, \\emph{directed} graph. The proposed algorithm, ADD-OPT (Accelerated Distributed Directed Optimization), achieves the best known convergence rate for this class of problems,~$O(\\mu^{k}),0<\\mu<1$, given strongly-convex, objective functions with globally Lipschitz-continuous gradients, where~$k$ is the number of iterations. Moreover, ADD-OPT supports a wider "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04757","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":"1607.04757","created_at":"2026-05-18T00:14:01.483549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04757v3","created_at":"2026-05-18T00:14:01.483549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04757","created_at":"2026-05-18T00:14:01.483549+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7AT7EIKI37Z","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7AT7EIKI37ZSOTE","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7AT7EIK","created_at":"2026-05-18T12:30:29.479603+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/L7AT7EIKI37ZSOTEHGDFUKTELV","json":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV.json","graph_json":"https://pith.science/api/pith-number/L7AT7EIKI37ZSOTEHGDFUKTELV/graph.json","events_json":"https://pith.science/api/pith-number/L7AT7EIKI37ZSOTEHGDFUKTELV/events.json","paper":"https://pith.science/paper/L7AT7EIK"},"agent_actions":{"view_html":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV","download_json":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV.json","view_paper":"https://pith.science/paper/L7AT7EIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04757&json=true","fetch_graph":"https://pith.science/api/pith-number/L7AT7EIKI37ZSOTEHGDFUKTELV/graph.json","fetch_events":"https://pith.science/api/pith-number/L7AT7EIKI37ZSOTEHGDFUKTELV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/action/storage_attestation","attest_author":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/action/author_attestation","sign_citation":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/action/citation_signature","submit_replication":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/action/replication_record"}},"created_at":"2026-05-18T00:14:01.483549+00:00","updated_at":"2026-05-18T00:14:01.483549+00:00"}