{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L7AT7EIKI37ZSOTEHGDFUKTELV","short_pith_number":"pith:L7AT7EIK","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"},"canonical_sha256":"5fc13f910a46ff993a6439865a2a645d77ac51e8946f76bb7258708a9abccade","source":{"kind":"arxiv","id":"1607.04757","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04757","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04757v3","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04757","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"pith_short_12","alias_value":"L7AT7EIKI37Z","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7AT7EIKI37ZSOTE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7AT7EIK","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L7AT7EIKI37ZSOTEHGDFUKTELV","target":"record","payload":{"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"},"canonical_sha256":"5fc13f910a46ff993a6439865a2a645d77ac51e8946f76bb7258708a9abccade","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"},"source_kind":"arxiv","source_id":"1607.04757","source_version":3,"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-18T00:14:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tfszapmkpQ1VPR+pOoyhDHWLZcXJznRsk7PUJjAlruxN543rT7lfS4EF2n5U7pcR2YnJJ0Eex2l0jsirh8W2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:30:55.585821Z"},"content_sha256":"f02c873c12094ee88d8cef5a845af51c56862628bd165bff58024005dbabf41f","schema_version":"1.0","event_id":"sha256:f02c873c12094ee88d8cef5a845af51c56862628bd165bff58024005dbabf41f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L7AT7EIKI37ZSOTEHGDFUKTELV","target":"graph","payload":{"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"},"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-18T00:14:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSBKmEZj86ANUG8S3VzyA7O67WWR1NYVBvovAwtB1ZQZKvh6UyQfrOGSj6SgujP7/1hlhIzt4gUhvvN0txPbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:30:55.586284Z"},"content_sha256":"202a81c69d465cd55a5487513b56585f0df4719c2e83c0698d0cd25abfac5106","schema_version":"1.0","event_id":"sha256:202a81c69d465cd55a5487513b56585f0df4719c2e83c0698d0cd25abfac5106"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/bundle.json","state_url":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/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-08-03T18:30:55Z","links":{"resolver":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV","bundle":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/bundle.json","state":"https://pith.science/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7AT7EIKI37ZSOTEHGDFUKTELV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L7AT7EIKI37ZSOTEHGDFUKTELV","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":"ac9436240174834dfa3e7dcc66622c106f9d62c5e7e51ec1643d666d0e2bdc5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T16:20:09Z","title_canon_sha256":"8fa8e26a1314b95dc3684161ee952be4f72b38fd2ffe725f4e663eaf98490cc4"},"schema_version":"1.0","source":{"id":"1607.04757","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04757","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04757v3","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04757","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"pith_short_12","alias_value":"L7AT7EIKI37Z","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7AT7EIKI37ZSOTE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7AT7EIK","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:202a81c69d465cd55a5487513b56585f0df4719c2e83c0698d0cd25abfac5106","target":"graph","created_at":"2026-05-18T00:14:01Z","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":"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 ","authors_text":"Chenguang Xi, Ran Xin, Usman A. Khan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T16:20:09Z","title":"ADD-OPT: Accelerated Distributed Directed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04757","kind":"arxiv","version":3},"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:f02c873c12094ee88d8cef5a845af51c56862628bd165bff58024005dbabf41f","target":"record","created_at":"2026-05-18T00:14:01Z","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":"ac9436240174834dfa3e7dcc66622c106f9d62c5e7e51ec1643d666d0e2bdc5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T16:20:09Z","title_canon_sha256":"8fa8e26a1314b95dc3684161ee952be4f72b38fd2ffe725f4e663eaf98490cc4"},"schema_version":"1.0","source":{"id":"1607.04757","kind":"arxiv","version":3}},"canonical_sha256":"5fc13f910a46ff993a6439865a2a645d77ac51e8946f76bb7258708a9abccade","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fc13f910a46ff993a6439865a2a645d77ac51e8946f76bb7258708a9abccade","first_computed_at":"2026-05-18T00:14:01.483450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:01.483450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tuv1lQc3CsokBoxIbhDLb/mrAr6D6J4pyiOtzIVzzXetycvEIv9XFtlzOQLA9hg1H1O2bBz8FRq2onlz+HuHCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:01.484061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04757","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f02c873c12094ee88d8cef5a845af51c56862628bd165bff58024005dbabf41f","sha256:202a81c69d465cd55a5487513b56585f0df4719c2e83c0698d0cd25abfac5106"],"state_sha256":"9138c5175ce4f42e0f38eb600be40e92131dc0bd638f478412b8c0bd3681a537"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVkTXrexqAzrLtxYTg4Kpvt8RGvhRKkYd17CAKKpU9MRYqpAmPiAURcTpHxAx/327uOpg4Bc2ruBb4LxrZFSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:30:55.590864Z","bundle_sha256":"b5b2d9289fec7d14d0fd556a851b635e1e4368718cb84d5ee89baf317603c205"}}