{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YXVTPXJ52UZMROQMCTDSFX54LP","short_pith_number":"pith:YXVTPXJ5","canonical_record":{"source":{"id":"1810.11568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-27T00:39:26Z","cross_cats_sorted":[],"title_canon_sha256":"0c66cc3af8e980d729762829bf4b727e4ce6176107f49516f5c7f53bc03d4485","abstract_canon_sha256":"b0e968bda4926b4f1acd8ce7cad6c7f7aef72a37d70db4866c17ec396e6e3757"},"schema_version":"1.0"},"canonical_sha256":"c5eb37dd3dd532c8ba0c14c722dfbc5bef84431ac091c68ddc4b4579452d450d","source":{"kind":"arxiv","id":"1810.11568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11568","created_at":"2026-05-18T00:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11568v1","created_at":"2026-05-18T00:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11568","created_at":"2026-05-18T00:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"YXVTPXJ52UZM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YXVTPXJ52UZMROQM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YXVTPXJ5","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YXVTPXJ52UZMROQMCTDSFX54LP","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-27T00:39:26Z","cross_cats_sorted":[],"title_canon_sha256":"0c66cc3af8e980d729762829bf4b727e4ce6176107f49516f5c7f53bc03d4485","abstract_canon_sha256":"b0e968bda4926b4f1acd8ce7cad6c7f7aef72a37d70db4866c17ec396e6e3757"},"schema_version":"1.0"},"canonical_sha256":"c5eb37dd3dd532c8ba0c14c722dfbc5bef84431ac091c68ddc4b4579452d450d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:08.225362Z","signature_b64":"+sIBwINjcYrrCeYls6ZBwCDgmOfiJWv81tB5QLPJGnaY2oxJ/HDgwdIyk510l2FOuSHjfAsGdxVqTKA75GGDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5eb37dd3dd532c8ba0c14c722dfbc5bef84431ac091c68ddc4b4579452d450d","last_reissued_at":"2026-05-18T00:02:08.224664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:08.224664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11568","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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VkzZF+KEFgnFMMfBeWyotxPf6cRDUqi2M1i/i4XMg13lq5Srf9fMHgoqKnudDbSAlt9jWGxyJloz9SlEO7VgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:49:52.428280Z"},"content_sha256":"6401c9ef30e03f05f5ebba17b95b2b58100d0bbe4badfd8d1f289f18a651210e","schema_version":"1.0","event_id":"sha256:6401c9ef30e03f05f5ebba17b95b2b58100d0bbe4badfd8d1f289f18a651210e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YXVTPXJ52UZMROQMCTDSFX54LP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Stochastic Approximation for Solving Network Optimization Problems Under Random Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Justin Romberg, Siva Theja Maguluri, Thinh T. Doan","submitted_at":"2018-10-27T00:39:26Z","abstract_excerpt":"We study distributed optimization problems over a network when the communication between the nodes is constrained, and so information that is exchanged between the nodes must be quantized. This imperfect communication poses a fundamental challenge, and this imperfect communication, if not properly accounted for, prevents the convergence of these algorithms. Our first contribution in this paper is to propose a modified consensus-based gradient method for solving such problems using random (dithered) quantization. This algorithm can be interpreted as a distributed variant of a well-known two-tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11568","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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5hz0It/fQnpfpv9PzzGWJjyLX52ULjMPCzBzt/92aramDIFeLNqrArjtQ5W8k/7NwmZYrvWDlU88She1lSJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:49:52.428822Z"},"content_sha256":"eae51fd36b6a44a1425a62326227c21d14e76d1683959217e5d9250a0968c171","schema_version":"1.0","event_id":"sha256:eae51fd36b6a44a1425a62326227c21d14e76d1683959217e5d9250a0968c171"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXVTPXJ52UZMROQMCTDSFX54LP/bundle.json","state_url":"https://pith.science/pith/YXVTPXJ52UZMROQMCTDSFX54LP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXVTPXJ52UZMROQMCTDSFX54LP/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-05-27T08:49:52Z","links":{"resolver":"https://pith.science/pith/YXVTPXJ52UZMROQMCTDSFX54LP","bundle":"https://pith.science/pith/YXVTPXJ52UZMROQMCTDSFX54LP/bundle.json","state":"https://pith.science/pith/YXVTPXJ52UZMROQMCTDSFX54LP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXVTPXJ52UZMROQMCTDSFX54LP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YXVTPXJ52UZMROQMCTDSFX54LP","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":"b0e968bda4926b4f1acd8ce7cad6c7f7aef72a37d70db4866c17ec396e6e3757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-27T00:39:26Z","title_canon_sha256":"0c66cc3af8e980d729762829bf4b727e4ce6176107f49516f5c7f53bc03d4485"},"schema_version":"1.0","source":{"id":"1810.11568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11568","created_at":"2026-05-18T00:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11568v1","created_at":"2026-05-18T00:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11568","created_at":"2026-05-18T00:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"YXVTPXJ52UZM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YXVTPXJ52UZMROQM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YXVTPXJ5","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:eae51fd36b6a44a1425a62326227c21d14e76d1683959217e5d9250a0968c171","target":"graph","created_at":"2026-05-18T00:02:08Z","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":"We study distributed optimization problems over a network when the communication between the nodes is constrained, and so information that is exchanged between the nodes must be quantized. This imperfect communication poses a fundamental challenge, and this imperfect communication, if not properly accounted for, prevents the convergence of these algorithms. Our first contribution in this paper is to propose a modified consensus-based gradient method for solving such problems using random (dithered) quantization. This algorithm can be interpreted as a distributed variant of a well-known two-tim","authors_text":"Justin Romberg, Siva Theja Maguluri, Thinh T. Doan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-27T00:39:26Z","title":"Distributed Stochastic Approximation for Solving Network Optimization Problems Under Random Quantization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11568","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:6401c9ef30e03f05f5ebba17b95b2b58100d0bbe4badfd8d1f289f18a651210e","target":"record","created_at":"2026-05-18T00:02:08Z","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":"b0e968bda4926b4f1acd8ce7cad6c7f7aef72a37d70db4866c17ec396e6e3757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-27T00:39:26Z","title_canon_sha256":"0c66cc3af8e980d729762829bf4b727e4ce6176107f49516f5c7f53bc03d4485"},"schema_version":"1.0","source":{"id":"1810.11568","kind":"arxiv","version":1}},"canonical_sha256":"c5eb37dd3dd532c8ba0c14c722dfbc5bef84431ac091c68ddc4b4579452d450d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5eb37dd3dd532c8ba0c14c722dfbc5bef84431ac091c68ddc4b4579452d450d","first_computed_at":"2026-05-18T00:02:08.224664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:08.224664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+sIBwINjcYrrCeYls6ZBwCDgmOfiJWv81tB5QLPJGnaY2oxJ/HDgwdIyk510l2FOuSHjfAsGdxVqTKA75GGDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:08.225362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6401c9ef30e03f05f5ebba17b95b2b58100d0bbe4badfd8d1f289f18a651210e","sha256:eae51fd36b6a44a1425a62326227c21d14e76d1683959217e5d9250a0968c171"],"state_sha256":"8b5474ca936483b237a0c326b5bc958cdb48a94abe60a873f61b54e8239be717"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEHTahyNV1t45lr5Tvs2FHXA5rOZRV+qaaMkHnAnAp86wmDdgHWpFSJhUbPhtt6+tL6Cbzg5x44yFIneiQCACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:49:52.431845Z","bundle_sha256":"60e2d3a63f0e713b21c8964acdc58b81193c59d76263a3bef133e08156182c88"}}