{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:M6DMKBJLTUVEMUGG5LXAXO5PUO","short_pith_number":"pith:M6DMKBJL","schema_version":"1.0","canonical_sha256":"6786c5052b9d2a4650c6eaee0bbbafa3a3658cd6f455832365d3bf6019598660","source":{"kind":"arxiv","id":"1504.02317","version":1},"attestation_state":"computed","paper":{"title":"Quantization Design for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Colin N. Jones, Melanie N. Zeilinger, Ye Pu","submitted_at":"2015-04-09T14:08:10Z","abstract_excerpt":"We consider the problem of solving a distributed optimization problem using a distributed computing platform, where the communication in the network is limited: each node can only communicate with its neighbours and the channel has a limited data-rate. A common technique to address the latter limitation is to apply quantization to the exchanged information. We propose two distributed optimization algorithms with an iteratively refining quantization design based on the inexact proximal gradient method and its accelerated variant. We show that if the parameters of the quantizers, i.e. the number"},"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":"1504.02317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-09T14:08:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"354b4e25f035d2564dc31e116a9a469f1d3709b7f4e71b423c94e842cd3b619c","abstract_canon_sha256":"52f3fb05952201cfa0e45ecee51b4b9242382f352bff9c5985203f3c67ead612"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:15.434303Z","signature_b64":"yf/KSEF0ztsP7VS3DYyev8JgtVAFAUiW3gWpM6AB5wh1DpoJ8P70dyWOOfxabxSCc9ub35fbRIpBIUnsx8XOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6786c5052b9d2a4650c6eaee0bbbafa3a3658cd6f455832365d3bf6019598660","last_reissued_at":"2026-05-18T02:19:15.433686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:15.433686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantization Design for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Colin N. Jones, Melanie N. Zeilinger, Ye Pu","submitted_at":"2015-04-09T14:08:10Z","abstract_excerpt":"We consider the problem of solving a distributed optimization problem using a distributed computing platform, where the communication in the network is limited: each node can only communicate with its neighbours and the channel has a limited data-rate. A common technique to address the latter limitation is to apply quantization to the exchanged information. We propose two distributed optimization algorithms with an iteratively refining quantization design based on the inexact proximal gradient method and its accelerated variant. We show that if the parameters of the quantizers, i.e. the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02317","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":""},"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":"1504.02317","created_at":"2026-05-18T02:19:15.433779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02317v1","created_at":"2026-05-18T02:19:15.433779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02317","created_at":"2026-05-18T02:19:15.433779+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6DMKBJLTUVE","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6DMKBJLTUVEMUGG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6DMKBJL","created_at":"2026-05-18T12:29:32.376354+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/M6DMKBJLTUVEMUGG5LXAXO5PUO","json":"https://pith.science/pith/M6DMKBJLTUVEMUGG5LXAXO5PUO.json","graph_json":"https://pith.science/api/pith-number/M6DMKBJLTUVEMUGG5LXAXO5PUO/graph.json","events_json":"https://pith.science/api/pith-number/M6DMKBJLTUVEMUGG5LXAXO5PUO/events.json","paper":"https://pith.science/paper/M6DMKBJL"},"agent_actions":{"view_html":"https://pith.science/pith/M6DMKBJLTUVEMUGG5LXAXO5PUO","download_json":"https://pith.science/pith/M6DMKBJLTUVEMUGG5LXAXO5PUO.json","view_paper":"https://pith.science/paper/M6DMKBJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02317&json=true","fetch_graph":"https://pith.science/api/pith-number/M6DMKBJLTUVEMUGG5LXAXO5PUO/graph.json","fetch_events":"https://pith.science/api/pith-number/M6DMKBJLTUVEMUGG5LXAXO5PUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6DMKBJLTUVEMUGG5LXAXO5PUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6DMKBJLTUVEMUGG5LXAXO5PUO/action/storage_attestation","attest_author":"https://pith.science/pith/M6DMKBJLTUVEMUGG5LXAXO5PUO/action/author_attestation","sign_citation":"https://pith.science/pith/M6DMKBJLTUVEMUGG5LXAXO5PUO/action/citation_signature","submit_replication":"https://pith.science/pith/M6DMKBJLTUVEMUGG5LXAXO5PUO/action/replication_record"}},"created_at":"2026-05-18T02:19:15.433779+00:00","updated_at":"2026-05-18T02:19:15.433779+00:00"}