{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JTEIZU3LNVOOZACRTWKA3DHYRK","short_pith_number":"pith:JTEIZU3L","canonical_record":{"source":{"id":"1302.2129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-08T19:46:51Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"77b497fa9442e87e2322966b43b92780c459b28af83fb5369a4281e7320d9f6c","abstract_canon_sha256":"6e7fd2c2459dc3c8d7ebe01774017c4e55802f4e0dc8813f3b000157a0e0fe6b"},"schema_version":"1.0"},"canonical_sha256":"4cc88cd36b6d5cec80519d940d8cf88abf18ed7622fb6825b86de0eec783f9dc","source":{"kind":"arxiv","id":"1302.2129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2129","created_at":"2026-05-18T01:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2129v1","created_at":"2026-05-18T01:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2129","created_at":"2026-05-18T01:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"JTEIZU3LNVOO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JTEIZU3LNVOOZACR","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JTEIZU3L","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JTEIZU3LNVOOZACRTWKA3DHYRK","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-08T19:46:51Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"77b497fa9442e87e2322966b43b92780c459b28af83fb5369a4281e7320d9f6c","abstract_canon_sha256":"6e7fd2c2459dc3c8d7ebe01774017c4e55802f4e0dc8813f3b000157a0e0fe6b"},"schema_version":"1.0"},"canonical_sha256":"4cc88cd36b6d5cec80519d940d8cf88abf18ed7622fb6825b86de0eec783f9dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:43.307153Z","signature_b64":"3Ag9hcjunKv+2oOYIOS18bRjBQOugiezHQbNTur3VB0RQf/W1yyx7YddHkeNFXtlCJlbEUhpr/cBDy/tLxThAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cc88cd36b6d5cec80519d940d8cf88abf18ed7622fb6825b86de0eec783f9dc","last_reissued_at":"2026-05-18T01:51:43.306489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:43.306489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2129","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-18T01:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iE56yhQjdTswcKR9EK2RDUOnetQkIuBat4C0TXorhkBLdt1aPPjUpBirn8Odgh+APjSCHuqselpec59gS8vmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:29:41.393957Z"},"content_sha256":"2ed36820d2d7b8d8b0939fd3411681849bf81d6a4a0f29ad4c651e291672484a","schema_version":"1.0","event_id":"sha256:2ed36820d2d7b8d8b0939fd3411681849bf81d6a4a0f29ad4c651e291672484a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JTEIZU3LNVOOZACRTWKA3DHYRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Asymptotic Analysis of an Optimal Algorithm for Network-Constrained Averaging with Noisy Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.DC","authors_text":"Martin Wainwright, Nima Noorshams","submitted_at":"2013-02-08T19:46:51Z","abstract_excerpt":"The problem of network-constrained averaging is to compute the average of a set of values distributed throughout a graph G using an algorithm that can pass messages only along graph edges. We study this problem in the noisy setting, in which the communication along each link is modeled by an additive white Gaussian noise channel. We propose a two-phase decentralized algorithm, and we use stochastic approximation methods in conjunction with the spectral graph theory to provide concrete (non-asymptotic) bounds on the mean-squared error. Having found such bounds, we analyze how the number of iter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2129","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-18T01:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Szm31KzMj+cX1R/+fnKR2jj9/dBViRmT+TgicGMkgWKgH77S8/8S2bXyhlJyMnj+YErjzAP5kWXpr1Y831HABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:29:41.394361Z"},"content_sha256":"513825c57c189c1867a6a484b756e97741dd0faf962999452943e4f0bcd25039","schema_version":"1.0","event_id":"sha256:513825c57c189c1867a6a484b756e97741dd0faf962999452943e4f0bcd25039"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTEIZU3LNVOOZACRTWKA3DHYRK/bundle.json","state_url":"https://pith.science/pith/JTEIZU3LNVOOZACRTWKA3DHYRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTEIZU3LNVOOZACRTWKA3DHYRK/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-03T11:29:41Z","links":{"resolver":"https://pith.science/pith/JTEIZU3LNVOOZACRTWKA3DHYRK","bundle":"https://pith.science/pith/JTEIZU3LNVOOZACRTWKA3DHYRK/bundle.json","state":"https://pith.science/pith/JTEIZU3LNVOOZACRTWKA3DHYRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTEIZU3LNVOOZACRTWKA3DHYRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JTEIZU3LNVOOZACRTWKA3DHYRK","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":"6e7fd2c2459dc3c8d7ebe01774017c4e55802f4e0dc8813f3b000157a0e0fe6b","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-08T19:46:51Z","title_canon_sha256":"77b497fa9442e87e2322966b43b92780c459b28af83fb5369a4281e7320d9f6c"},"schema_version":"1.0","source":{"id":"1302.2129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2129","created_at":"2026-05-18T01:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2129v1","created_at":"2026-05-18T01:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2129","created_at":"2026-05-18T01:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"JTEIZU3LNVOO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JTEIZU3LNVOOZACR","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JTEIZU3L","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:513825c57c189c1867a6a484b756e97741dd0faf962999452943e4f0bcd25039","target":"graph","created_at":"2026-05-18T01:51:43Z","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":"The problem of network-constrained averaging is to compute the average of a set of values distributed throughout a graph G using an algorithm that can pass messages only along graph edges. We study this problem in the noisy setting, in which the communication along each link is modeled by an additive white Gaussian noise channel. We propose a two-phase decentralized algorithm, and we use stochastic approximation methods in conjunction with the spectral graph theory to provide concrete (non-asymptotic) bounds on the mean-squared error. Having found such bounds, we analyze how the number of iter","authors_text":"Martin Wainwright, Nima Noorshams","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-08T19:46:51Z","title":"Non-Asymptotic Analysis of an Optimal Algorithm for Network-Constrained Averaging with Noisy Links"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2129","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:2ed36820d2d7b8d8b0939fd3411681849bf81d6a4a0f29ad4c651e291672484a","target":"record","created_at":"2026-05-18T01:51:43Z","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":"6e7fd2c2459dc3c8d7ebe01774017c4e55802f4e0dc8813f3b000157a0e0fe6b","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-08T19:46:51Z","title_canon_sha256":"77b497fa9442e87e2322966b43b92780c459b28af83fb5369a4281e7320d9f6c"},"schema_version":"1.0","source":{"id":"1302.2129","kind":"arxiv","version":1}},"canonical_sha256":"4cc88cd36b6d5cec80519d940d8cf88abf18ed7622fb6825b86de0eec783f9dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cc88cd36b6d5cec80519d940d8cf88abf18ed7622fb6825b86de0eec783f9dc","first_computed_at":"2026-05-18T01:51:43.306489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:51:43.306489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Ag9hcjunKv+2oOYIOS18bRjBQOugiezHQbNTur3VB0RQf/W1yyx7YddHkeNFXtlCJlbEUhpr/cBDy/tLxThAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:51:43.307153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ed36820d2d7b8d8b0939fd3411681849bf81d6a4a0f29ad4c651e291672484a","sha256:513825c57c189c1867a6a484b756e97741dd0faf962999452943e4f0bcd25039"],"state_sha256":"7af23ff5b0a0f45c4016c3db9903d76c2b629c656435dd9b0c2ae40c194c8dcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZGEl8PtLLPLebaDwVAhPRnmDZNmRepUpdjiCg05cNIyGGdHgRfx5ZElLCiuZxBIHV4roYNRWFgdkvSRmYebCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:29:41.397269Z","bundle_sha256":"46bcb90b1a8b79089163b34a970bc0ae710dd6242dc4944ae38e2f0bf044a308"}}