{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EAOHQDCPWGED5W7PAOAI25LHOD","short_pith_number":"pith:EAOHQDCP","schema_version":"1.0","canonical_sha256":"201c780c4fb1883edbef03808d756770d9da7314eeec055f05e2458d26c9f005","source":{"kind":"arxiv","id":"2106.08271","version":1},"attestation_state":"computed","paper":{"title":"Distributed Constrained Optimization with Delayed Subgradient Information over Time-Varying Network under Adaptive Quantization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel W. C. Ho, Jie Liu, Zhan Yu","submitted_at":"2021-06-15T16:32:48Z","abstract_excerpt":"In this paper, we consider a distributed constrained optimization problem with delayed subgradient information over the time-varying communication network, where each agent can only communicate with its neighbors and the communication channel has a limited data rate. We propose an adaptive quantization method to address this problem. A mirror descent algorithm with delayed subgradient information is established based on the theory of Bregman divergence. With non-Euclidean Bregman projection-based scheme, the proposed method essentially generalizes many previous classical Euclidean projection-b"},"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":"2106.08271","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-06-15T16:32:48Z","cross_cats_sorted":[],"title_canon_sha256":"750adc3dac8f3aaa2b1256564e0f66a7d0e51f4c901b9d75467441751411b059","abstract_canon_sha256":"14bfc1e15abf22ea3a721174311dbe9dac892cbc26fae7898680f66da98a079e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:38.871545Z","signature_b64":"FHtHtjzuvJxgbAlmEbOa1hciccIkscfXX2YodEgw+8RAZtkwSgTsZ2GvM2ycs6ZnQNLj2AtV9nU4y361W3ctAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201c780c4fb1883edbef03808d756770d9da7314eeec055f05e2458d26c9f005","last_reissued_at":"2026-07-05T02:49:38.871193Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:38.871193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Constrained Optimization with Delayed Subgradient Information over Time-Varying Network under Adaptive Quantization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel W. C. Ho, Jie Liu, Zhan Yu","submitted_at":"2021-06-15T16:32:48Z","abstract_excerpt":"In this paper, we consider a distributed constrained optimization problem with delayed subgradient information over the time-varying communication network, where each agent can only communicate with its neighbors and the communication channel has a limited data rate. We propose an adaptive quantization method to address this problem. A mirror descent algorithm with delayed subgradient information is established based on the theory of Bregman divergence. With non-Euclidean Bregman projection-based scheme, the proposed method essentially generalizes many previous classical Euclidean projection-b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08271","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/2106.08271/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":"2106.08271","created_at":"2026-07-05T02:49:38.871253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.08271v1","created_at":"2026-07-05T02:49:38.871253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08271","created_at":"2026-07-05T02:49:38.871253+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAOHQDCPWGED","created_at":"2026-07-05T02:49:38.871253+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAOHQDCPWGED5W7P","created_at":"2026-07-05T02:49:38.871253+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAOHQDCP","created_at":"2026-07-05T02:49:38.871253+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/EAOHQDCPWGED5W7PAOAI25LHOD","json":"https://pith.science/pith/EAOHQDCPWGED5W7PAOAI25LHOD.json","graph_json":"https://pith.science/api/pith-number/EAOHQDCPWGED5W7PAOAI25LHOD/graph.json","events_json":"https://pith.science/api/pith-number/EAOHQDCPWGED5W7PAOAI25LHOD/events.json","paper":"https://pith.science/paper/EAOHQDCP"},"agent_actions":{"view_html":"https://pith.science/pith/EAOHQDCPWGED5W7PAOAI25LHOD","download_json":"https://pith.science/pith/EAOHQDCPWGED5W7PAOAI25LHOD.json","view_paper":"https://pith.science/paper/EAOHQDCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.08271&json=true","fetch_graph":"https://pith.science/api/pith-number/EAOHQDCPWGED5W7PAOAI25LHOD/graph.json","fetch_events":"https://pith.science/api/pith-number/EAOHQDCPWGED5W7PAOAI25LHOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAOHQDCPWGED5W7PAOAI25LHOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAOHQDCPWGED5W7PAOAI25LHOD/action/storage_attestation","attest_author":"https://pith.science/pith/EAOHQDCPWGED5W7PAOAI25LHOD/action/author_attestation","sign_citation":"https://pith.science/pith/EAOHQDCPWGED5W7PAOAI25LHOD/action/citation_signature","submit_replication":"https://pith.science/pith/EAOHQDCPWGED5W7PAOAI25LHOD/action/replication_record"}},"created_at":"2026-07-05T02:49:38.871253+00:00","updated_at":"2026-07-05T02:49:38.871253+00:00"}