{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F3QD3I6CDUN5QJ6PXTQR6KW3T2","short_pith_number":"pith:F3QD3I6C","schema_version":"1.0","canonical_sha256":"2ee03da3c21d1bd827cfbce11f2adb9eb83700265748676676eec8f9a7956078","source":{"kind":"arxiv","id":"1604.00723","version":2},"attestation_state":"computed","paper":{"title":"Convergence Analysis of Quantized Primal-dual Algorithm in Network Utility Maximization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ehsan Nekouei, Girish Nair, Robin Evans, Tansu Alpcan","submitted_at":"2016-04-04T02:16:00Z","abstract_excerpt":"This paper investigates the asymptotic and non-asymptotic behavior of the quantized primal dual algorithm in network utility maximization problems, in which a group of agents maximize the sum of their individual concave objective functions under linear constraints. In the asymptotic scenario, we use the information theoretic notion of differential entropy power to establish universal lower bounds on the exponential convergence rates of joint primal dual, primal and dual variables under optimum achieving quantization schemes. These results provide trade offs between the speed of exponential con"},"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":"1604.00723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-04T02:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"a67b048a6377da24430ef2e6f2061fd5bbf2bac42084e416f1df9c3661fdd7f9","abstract_canon_sha256":"df5e8f0852c4b85b34fd95aba84652794e3f3a9d2eaebf38e0600cef7266135d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:29.123159Z","signature_b64":"DWGS+Ttmqfsq/6a/3qlbywMVMe0C/1++ozK2E8OnMfwF8IglelJib0kkOV2NTtQK27EofPN6sGoDFVWctWAACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee03da3c21d1bd827cfbce11f2adb9eb83700265748676676eec8f9a7956078","last_reissued_at":"2026-05-18T01:16:29.122672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:29.122672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Analysis of Quantized Primal-dual Algorithm in Network Utility Maximization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ehsan Nekouei, Girish Nair, Robin Evans, Tansu Alpcan","submitted_at":"2016-04-04T02:16:00Z","abstract_excerpt":"This paper investigates the asymptotic and non-asymptotic behavior of the quantized primal dual algorithm in network utility maximization problems, in which a group of agents maximize the sum of their individual concave objective functions under linear constraints. In the asymptotic scenario, we use the information theoretic notion of differential entropy power to establish universal lower bounds on the exponential convergence rates of joint primal dual, primal and dual variables under optimum achieving quantization schemes. These results provide trade offs between the speed of exponential con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00723","kind":"arxiv","version":2},"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":"1604.00723","created_at":"2026-05-18T01:16:29.122759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00723v2","created_at":"2026-05-18T01:16:29.122759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00723","created_at":"2026-05-18T01:16:29.122759+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3QD3I6CDUN5","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3QD3I6CDUN5QJ6P","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3QD3I6C","created_at":"2026-05-18T12:30:15.759754+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/F3QD3I6CDUN5QJ6PXTQR6KW3T2","json":"https://pith.science/pith/F3QD3I6CDUN5QJ6PXTQR6KW3T2.json","graph_json":"https://pith.science/api/pith-number/F3QD3I6CDUN5QJ6PXTQR6KW3T2/graph.json","events_json":"https://pith.science/api/pith-number/F3QD3I6CDUN5QJ6PXTQR6KW3T2/events.json","paper":"https://pith.science/paper/F3QD3I6C"},"agent_actions":{"view_html":"https://pith.science/pith/F3QD3I6CDUN5QJ6PXTQR6KW3T2","download_json":"https://pith.science/pith/F3QD3I6CDUN5QJ6PXTQR6KW3T2.json","view_paper":"https://pith.science/paper/F3QD3I6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00723&json=true","fetch_graph":"https://pith.science/api/pith-number/F3QD3I6CDUN5QJ6PXTQR6KW3T2/graph.json","fetch_events":"https://pith.science/api/pith-number/F3QD3I6CDUN5QJ6PXTQR6KW3T2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3QD3I6CDUN5QJ6PXTQR6KW3T2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3QD3I6CDUN5QJ6PXTQR6KW3T2/action/storage_attestation","attest_author":"https://pith.science/pith/F3QD3I6CDUN5QJ6PXTQR6KW3T2/action/author_attestation","sign_citation":"https://pith.science/pith/F3QD3I6CDUN5QJ6PXTQR6KW3T2/action/citation_signature","submit_replication":"https://pith.science/pith/F3QD3I6CDUN5QJ6PXTQR6KW3T2/action/replication_record"}},"created_at":"2026-05-18T01:16:29.122759+00:00","updated_at":"2026-05-18T01:16:29.122759+00:00"}