{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DZRENK3KMWP34I5IUBCRWNLTBQ","short_pith_number":"pith:DZRENK3K","schema_version":"1.0","canonical_sha256":"1e6246ab6a659fbe23a8a0451b35730c31796d6262e42c15d1d94f72c0513e44","source":{"kind":"arxiv","id":"1710.09041","version":1},"attestation_state":"computed","paper":{"title":"Generalized Geometric Programming for Rate Allocation in Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Dror Baron, Junan Zhu, Ryan Pilgrim, Waheed U. Bajwa","submitted_at":"2017-10-25T01:45:09Z","abstract_excerpt":"Distributed averaging, or distributed average consensus, is a common method for computing the sample mean of the data dispersed among the nodes of a network in a decentralized manner. By iteratively exchanging messages with neighbors, the nodes of the network can converge to an agreement on the sample mean of their initial states. In real-world scenarios, these messages are subject to bandwidth and power constraints, which motivates the design of a lossy compression strategy. Few prior works consider the rate allocation problem from the perspective of constrained optimization, which provides a"},"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":"1710.09041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T01:45:09Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"4ae259a75e532a52c32c67873eba9bbd47b3fcf0df619dd7e30b0251e0df362b","abstract_canon_sha256":"51f69654d165381f0088b55a1d41da3ae8f70aef1a695940833709f53bb45de2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:00.509683Z","signature_b64":"grYRyPcDAmGWtK3G9bJ+riNpEbprZq59rcTemFWFpFyZm+3hhGrP+3eTh1Sp2K9+VWj95zC+g8dBxIVvzdUdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e6246ab6a659fbe23a8a0451b35730c31796d6262e42c15d1d94f72c0513e44","last_reissued_at":"2026-05-18T00:32:00.509023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:00.509023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Geometric Programming for Rate Allocation in Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Dror Baron, Junan Zhu, Ryan Pilgrim, Waheed U. Bajwa","submitted_at":"2017-10-25T01:45:09Z","abstract_excerpt":"Distributed averaging, or distributed average consensus, is a common method for computing the sample mean of the data dispersed among the nodes of a network in a decentralized manner. By iteratively exchanging messages with neighbors, the nodes of the network can converge to an agreement on the sample mean of their initial states. In real-world scenarios, these messages are subject to bandwidth and power constraints, which motivates the design of a lossy compression strategy. Few prior works consider the rate allocation problem from the perspective of constrained optimization, which provides a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09041","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":"1710.09041","created_at":"2026-05-18T00:32:00.509126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09041v1","created_at":"2026-05-18T00:32:00.509126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09041","created_at":"2026-05-18T00:32:00.509126+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZRENK3KMWP3","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZRENK3KMWP34I5I","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZRENK3K","created_at":"2026-05-18T12:31:12.930513+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/DZRENK3KMWP34I5IUBCRWNLTBQ","json":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ.json","graph_json":"https://pith.science/api/pith-number/DZRENK3KMWP34I5IUBCRWNLTBQ/graph.json","events_json":"https://pith.science/api/pith-number/DZRENK3KMWP34I5IUBCRWNLTBQ/events.json","paper":"https://pith.science/paper/DZRENK3K"},"agent_actions":{"view_html":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ","download_json":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ.json","view_paper":"https://pith.science/paper/DZRENK3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09041&json=true","fetch_graph":"https://pith.science/api/pith-number/DZRENK3KMWP34I5IUBCRWNLTBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DZRENK3KMWP34I5IUBCRWNLTBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/action/storage_attestation","attest_author":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/action/author_attestation","sign_citation":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/action/citation_signature","submit_replication":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/action/replication_record"}},"created_at":"2026-05-18T00:32:00.509126+00:00","updated_at":"2026-05-18T00:32:00.509126+00:00"}