{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NQNCMYMWZP3DFEXLJD7BSHHGS7","short_pith_number":"pith:NQNCMYMW","schema_version":"1.0","canonical_sha256":"6c1a266196cbf63292eb48fe191ce697ccea1c60663d48de3197fe5cb36b050c","source":{"kind":"arxiv","id":"1803.10359","version":4},"attestation_state":"computed","paper":{"title":"Achieving Linear Convergence in Distributed Asynchronous Multi-agent Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Gesualdo Scutari, Ye Tian, Ying Sun","submitted_at":"2018-03-28T00:04:43Z","abstract_excerpt":"This papers studies multi-agent (convex and \\emph{nonconvex}) optimization over static digraphs. We propose a general distributed \\emph{asynchronous} algorithmic framework whereby i) agents can update their local variables as well as communicate with their neighbors at any time, without any form of coordination; and ii) they can perform their local computations using (possibly) delayed, out-of-sync information from the other agents. Delays need not be known to the agent or obey any specific profile, and can also be time-varying (but bounded). The algorithm builds on a tracking mechanism that i"},"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":"1803.10359","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-28T00:04:43Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"460085faed16741430e0f53f9a18f1321f3eb6cd399f5428c47fe5cfeec80a06","abstract_canon_sha256":"f88159e55e4dd2a2a8f764d0a1824cc9922aa56e4fb92271f3752cb91c46dcfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:53.571219Z","signature_b64":"2ddVVN8mxRExZpgJtW2pKHfxsSDi8lPo3lRgwTD5NbnjIOKdgVnYZ0aTh0Dqm9qNgT+IjzxfEZIYatcTawN9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1a266196cbf63292eb48fe191ce697ccea1c60663d48de3197fe5cb36b050c","last_reissued_at":"2026-07-05T00:03:53.570779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:53.570779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Linear Convergence in Distributed Asynchronous Multi-agent Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Gesualdo Scutari, Ye Tian, Ying Sun","submitted_at":"2018-03-28T00:04:43Z","abstract_excerpt":"This papers studies multi-agent (convex and \\emph{nonconvex}) optimization over static digraphs. We propose a general distributed \\emph{asynchronous} algorithmic framework whereby i) agents can update their local variables as well as communicate with their neighbors at any time, without any form of coordination; and ii) they can perform their local computations using (possibly) delayed, out-of-sync information from the other agents. Delays need not be known to the agent or obey any specific profile, and can also be time-varying (but bounded). The algorithm builds on a tracking mechanism that i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10359","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1803.10359/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1803.10359","created_at":"2026-07-05T00:03:53.570837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10359v4","created_at":"2026-07-05T00:03:53.570837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10359","created_at":"2026-07-05T00:03:53.570837+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQNCMYMWZP3D","created_at":"2026-07-05T00:03:53.570837+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQNCMYMWZP3DFEXL","created_at":"2026-07-05T00:03:53.570837+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQNCMYMW","created_at":"2026-07-05T00:03:53.570837+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/NQNCMYMWZP3DFEXLJD7BSHHGS7","json":"https://pith.science/pith/NQNCMYMWZP3DFEXLJD7BSHHGS7.json","graph_json":"https://pith.science/api/pith-number/NQNCMYMWZP3DFEXLJD7BSHHGS7/graph.json","events_json":"https://pith.science/api/pith-number/NQNCMYMWZP3DFEXLJD7BSHHGS7/events.json","paper":"https://pith.science/paper/NQNCMYMW"},"agent_actions":{"view_html":"https://pith.science/pith/NQNCMYMWZP3DFEXLJD7BSHHGS7","download_json":"https://pith.science/pith/NQNCMYMWZP3DFEXLJD7BSHHGS7.json","view_paper":"https://pith.science/paper/NQNCMYMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10359&json=true","fetch_graph":"https://pith.science/api/pith-number/NQNCMYMWZP3DFEXLJD7BSHHGS7/graph.json","fetch_events":"https://pith.science/api/pith-number/NQNCMYMWZP3DFEXLJD7BSHHGS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQNCMYMWZP3DFEXLJD7BSHHGS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQNCMYMWZP3DFEXLJD7BSHHGS7/action/storage_attestation","attest_author":"https://pith.science/pith/NQNCMYMWZP3DFEXLJD7BSHHGS7/action/author_attestation","sign_citation":"https://pith.science/pith/NQNCMYMWZP3DFEXLJD7BSHHGS7/action/citation_signature","submit_replication":"https://pith.science/pith/NQNCMYMWZP3DFEXLJD7BSHHGS7/action/replication_record"}},"created_at":"2026-07-05T00:03:53.570837+00:00","updated_at":"2026-07-05T00:03:53.570837+00:00"}