{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RCPCVODHCOW76G66GCJ2GBPV2H","short_pith_number":"pith:RCPCVODH","schema_version":"1.0","canonical_sha256":"889e2ab86713adff1bde3093a305f5d1c789d9d89ba8e2bde8f7d2e259e7ea3c","source":{"kind":"arxiv","id":"2312.00646","version":1},"attestation_state":"computed","paper":{"title":"Distributed Asynchronous Discrete-Time Feedback Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabriel Behrendt, Matthew Hale, Matthew Longmire, Zachary I. Bell","submitted_at":"2023-12-01T15:18:27Z","abstract_excerpt":"In this article, we present an algorithm that drives the outputs of a network of agents to jointly track the solutions of time-varying optimization problems in a way that is robust to asynchrony in the agents' operations. We consider three operations that can be asynchronous: (1) computations of control inputs, (2) measurements of network outputs, and (3) communications of agents' inputs and outputs. We first show that our algorithm converges to the solution of a time-invariant feedback optimization problem in linear time. Next, we show that our algorithm drives outputs to track the solution o"},"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":"2312.00646","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-01T15:18:27Z","cross_cats_sorted":[],"title_canon_sha256":"ef058a10305967d40d81012b507b277553b67821482735ac1395fdde998005e7","abstract_canon_sha256":"c29ba6c30003ba83d76f1c7894293e18b1d4ec92c5acff467cf1c391bbf27769"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:12.515324Z","signature_b64":"wWqUszu6mwjlh5JkYXwJILKC8kd0/NZAetGCiPyxTU/s9vsjzf+BENkca9W+rJ0s1QqPwZGVMjH5GDoad+X8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889e2ab86713adff1bde3093a305f5d1c789d9d89ba8e2bde8f7d2e259e7ea3c","last_reissued_at":"2026-07-05T07:19:12.514866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:12.514866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Asynchronous Discrete-Time Feedback Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabriel Behrendt, Matthew Hale, Matthew Longmire, Zachary I. Bell","submitted_at":"2023-12-01T15:18:27Z","abstract_excerpt":"In this article, we present an algorithm that drives the outputs of a network of agents to jointly track the solutions of time-varying optimization problems in a way that is robust to asynchrony in the agents' operations. We consider three operations that can be asynchronous: (1) computations of control inputs, (2) measurements of network outputs, and (3) communications of agents' inputs and outputs. We first show that our algorithm converges to the solution of a time-invariant feedback optimization problem in linear time. Next, we show that our algorithm drives outputs to track the solution o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.00646","kind":"arxiv","version":1},"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/2312.00646/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":"2312.00646","created_at":"2026-07-05T07:19:12.514932+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.00646v1","created_at":"2026-07-05T07:19:12.514932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.00646","created_at":"2026-07-05T07:19:12.514932+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCPCVODHCOW7","created_at":"2026-07-05T07:19:12.514932+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCPCVODHCOW76G66","created_at":"2026-07-05T07:19:12.514932+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCPCVODH","created_at":"2026-07-05T07:19:12.514932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11732","citing_title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H","json":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H.json","graph_json":"https://pith.science/api/pith-number/RCPCVODHCOW76G66GCJ2GBPV2H/graph.json","events_json":"https://pith.science/api/pith-number/RCPCVODHCOW76G66GCJ2GBPV2H/events.json","paper":"https://pith.science/paper/RCPCVODH"},"agent_actions":{"view_html":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H","download_json":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H.json","view_paper":"https://pith.science/paper/RCPCVODH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.00646&json=true","fetch_graph":"https://pith.science/api/pith-number/RCPCVODHCOW76G66GCJ2GBPV2H/graph.json","fetch_events":"https://pith.science/api/pith-number/RCPCVODHCOW76G66GCJ2GBPV2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H/action/storage_attestation","attest_author":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H/action/author_attestation","sign_citation":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H/action/citation_signature","submit_replication":"https://pith.science/pith/RCPCVODHCOW76G66GCJ2GBPV2H/action/replication_record"}},"created_at":"2026-07-05T07:19:12.514932+00:00","updated_at":"2026-07-05T07:19:12.514932+00:00"}