{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DZRENK3KMWP34I5IUBCRWNLTBQ","short_pith_number":"pith:DZRENK3K","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"},"canonical_sha256":"1e6246ab6a659fbe23a8a0451b35730c31796d6262e42c15d1d94f72c0513e44","source":{"kind":"arxiv","id":"1710.09041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09041","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09041v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09041","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"DZRENK3KMWP3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DZRENK3KMWP34I5I","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DZRENK3K","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DZRENK3KMWP34I5IUBCRWNLTBQ","target":"record","payload":{"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"},"canonical_sha256":"1e6246ab6a659fbe23a8a0451b35730c31796d6262e42c15d1d94f72c0513e44","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"},"source_kind":"arxiv","source_id":"1710.09041","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgojVQIyxdE9NMicoXgEuKhQxDFiAgAcDseDpzkLrcVFwkvs430HjGHhcLDjEgeJ+MC0SkmTbpVn+7KA+DP0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:27:36.111288Z"},"content_sha256":"8d149ad89442cbfdbe8286708b1e3767695ba9b9a72c1275ff8b4115ada70bb3","schema_version":"1.0","event_id":"sha256:8d149ad89442cbfdbe8286708b1e3767695ba9b9a72c1275ff8b4115ada70bb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DZRENK3KMWP34I5IUBCRWNLTBQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYI6P+L85E5lXt1jwBsRCBatrqRX0ePC9vLESfqPQgdbCs2Aw1WWOMYGRlukVIcsNap0HOoLn5QucrYnHowlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:27:36.111645Z"},"content_sha256":"7293c372f4703cd2e403b8d0b6350266971fe7306a6010074de57dc54174d030","schema_version":"1.0","event_id":"sha256:7293c372f4703cd2e403b8d0b6350266971fe7306a6010074de57dc54174d030"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/bundle.json","state_url":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T07:27:36Z","links":{"resolver":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ","bundle":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/bundle.json","state":"https://pith.science/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZRENK3KMWP34I5IUBCRWNLTBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DZRENK3KMWP34I5IUBCRWNLTBQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"51f69654d165381f0088b55a1d41da3ae8f70aef1a695940833709f53bb45de2","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T01:45:09Z","title_canon_sha256":"4ae259a75e532a52c32c67873eba9bbd47b3fcf0df619dd7e30b0251e0df362b"},"schema_version":"1.0","source":{"id":"1710.09041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09041","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09041v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09041","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"DZRENK3KMWP3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DZRENK3KMWP34I5I","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DZRENK3K","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:7293c372f4703cd2e403b8d0b6350266971fe7306a6010074de57dc54174d030","target":"graph","created_at":"2026-05-18T00:32:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dror Baron, Junan Zhu, Ryan Pilgrim, Waheed U. Bajwa","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T01:45:09Z","title":"Generalized Geometric Programming for Rate Allocation in Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09041","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8d149ad89442cbfdbe8286708b1e3767695ba9b9a72c1275ff8b4115ada70bb3","target":"record","created_at":"2026-05-18T00:32:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"51f69654d165381f0088b55a1d41da3ae8f70aef1a695940833709f53bb45de2","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T01:45:09Z","title_canon_sha256":"4ae259a75e532a52c32c67873eba9bbd47b3fcf0df619dd7e30b0251e0df362b"},"schema_version":"1.0","source":{"id":"1710.09041","kind":"arxiv","version":1}},"canonical_sha256":"1e6246ab6a659fbe23a8a0451b35730c31796d6262e42c15d1d94f72c0513e44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e6246ab6a659fbe23a8a0451b35730c31796d6262e42c15d1d94f72c0513e44","first_computed_at":"2026-05-18T00:32:00.509023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:00.509023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"grYRyPcDAmGWtK3G9bJ+riNpEbprZq59rcTemFWFpFyZm+3hhGrP+3eTh1Sp2K9+VWj95zC+g8dBxIVvzdUdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:00.509683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d149ad89442cbfdbe8286708b1e3767695ba9b9a72c1275ff8b4115ada70bb3","sha256:7293c372f4703cd2e403b8d0b6350266971fe7306a6010074de57dc54174d030"],"state_sha256":"7dde0ef9dcbf8d41a1d2920e874374ae8f4befbf1e1eaf5cdf05e9f0014a8f9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvE31nK/MAy6kVSao5QvHfgZ76gSNsArmiLBK3i9PYwgfxoH3quGTcWR6PDJ/xBtsYndWDM7PZiM4m+3KMtgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:27:36.113620Z","bundle_sha256":"b5ddd2cc41ed0b2cd2c3259647d0bdd972cbb86339da885f4e6983327398fad4"}}