{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:KBK77MYHXFVNFRUNY6SNCOCT54","short_pith_number":"pith:KBK77MYH","canonical_record":{"source":{"id":"0903.3537","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-03-20T15:12:13Z","cross_cats_sorted":["cs.IT","cs.MA","math.IT"],"title_canon_sha256":"8ab3deea1007fbb4d34c3c9282199a6b0dcfbad667fafa411a55dce10cd5df07","abstract_canon_sha256":"687fd9eb45cb056ff6d8391c54f9b9be53a6de3881f00298aa2839a047a7db13"},"schema_version":"1.0"},"canonical_sha256":"5055ffb307b96ad2c68dc7a4d13853ef0cb9426d293e2e63b20b00027d808d98","source":{"kind":"arxiv","id":"0903.3537","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.3537","created_at":"2026-05-18T02:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"0903.3537v4","created_at":"2026-05-18T02:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.3537","created_at":"2026-05-18T02:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"KBK77MYHXFVN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KBK77MYHXFVNFRUN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KBK77MYH","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:KBK77MYHXFVNFRUNY6SNCOCT54","target":"record","payload":{"canonical_record":{"source":{"id":"0903.3537","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-03-20T15:12:13Z","cross_cats_sorted":["cs.IT","cs.MA","math.IT"],"title_canon_sha256":"8ab3deea1007fbb4d34c3c9282199a6b0dcfbad667fafa411a55dce10cd5df07","abstract_canon_sha256":"687fd9eb45cb056ff6d8391c54f9b9be53a6de3881f00298aa2839a047a7db13"},"schema_version":"1.0"},"canonical_sha256":"5055ffb307b96ad2c68dc7a4d13853ef0cb9426d293e2e63b20b00027d808d98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:26.981552Z","signature_b64":"sbTtYG+5PykmxpxSmHM4fGpLY/NsAipZIo5PHrxfG+OD6qA55YzcKTKI7x/y7Syw8ZlyknBZW1Tb2zk4XrQxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5055ffb307b96ad2c68dc7a4d13853ef0cb9426d293e2e63b20b00027d808d98","last_reissued_at":"2026-05-18T02:14:26.980787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:26.980787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.3537","source_version":4,"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-18T02:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDV43w83g6gUTtM2ywOlCj36yqbInVqKRju0RuWOs134K+VPH70X77G9bAK0txStA7Rexs45xu2zzjBe5DxcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:54:48.696965Z"},"content_sha256":"2a9cd6c8328268a89f787286d00ea4b2502228e51f908e8606fd9f863d45af29","schema_version":"1.0","event_id":"sha256:2a9cd6c8328268a89f787286d00ea4b2502228e51f908e8606fd9f863d45af29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:KBK77MYHXFVNFRUNY6SNCOCT54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization and Analysis of Distributed Averaging with Short Node Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.MA","math.IT"],"primary_cat":"cs.DC","authors_text":"Boris N. Oreshkin, Mark J. Coates, Michael G. Rabbat","submitted_at":"2009-03-20T15:12:13Z","abstract_excerpt":"In this paper, we demonstrate, both theoretically and by numerical examples, that adding a local prediction component to the update rule can significantly improve the convergence rate of distributed averaging algorithms. We focus on the case where the local predictor is a linear combination of the node's two previous values (i.e., two memory taps), and our update rule computes a combination of the predictor and the usual weighted linear combination of values received from neighbouring nodes. We derive the optimal mixing parameter for combining the predictor with the neighbors' values, and carr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.3537","kind":"arxiv","version":4},"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-18T02:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvZVqt1kQy6tEDGyOF3xYH0PZ3AbBPuzcxeo8QWoGA+/33T2kxgItNyau17LPMkFh0g3Ov40Wjiwa6nR5I0JCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:54:48.697361Z"},"content_sha256":"0a4fa1b5dc84893ca74d99b1ee3060acfdcdf06f806ff19a748f0bf94803229c","schema_version":"1.0","event_id":"sha256:0a4fa1b5dc84893ca74d99b1ee3060acfdcdf06f806ff19a748f0bf94803229c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBK77MYHXFVNFRUNY6SNCOCT54/bundle.json","state_url":"https://pith.science/pith/KBK77MYHXFVNFRUNY6SNCOCT54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBK77MYHXFVNFRUNY6SNCOCT54/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-30T08:54:48Z","links":{"resolver":"https://pith.science/pith/KBK77MYHXFVNFRUNY6SNCOCT54","bundle":"https://pith.science/pith/KBK77MYHXFVNFRUNY6SNCOCT54/bundle.json","state":"https://pith.science/pith/KBK77MYHXFVNFRUNY6SNCOCT54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBK77MYHXFVNFRUNY6SNCOCT54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:KBK77MYHXFVNFRUNY6SNCOCT54","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":"687fd9eb45cb056ff6d8391c54f9b9be53a6de3881f00298aa2839a047a7db13","cross_cats_sorted":["cs.IT","cs.MA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-03-20T15:12:13Z","title_canon_sha256":"8ab3deea1007fbb4d34c3c9282199a6b0dcfbad667fafa411a55dce10cd5df07"},"schema_version":"1.0","source":{"id":"0903.3537","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.3537","created_at":"2026-05-18T02:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"0903.3537v4","created_at":"2026-05-18T02:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.3537","created_at":"2026-05-18T02:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"KBK77MYHXFVN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KBK77MYHXFVNFRUN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KBK77MYH","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:0a4fa1b5dc84893ca74d99b1ee3060acfdcdf06f806ff19a748f0bf94803229c","target":"graph","created_at":"2026-05-18T02:14:26Z","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":"In this paper, we demonstrate, both theoretically and by numerical examples, that adding a local prediction component to the update rule can significantly improve the convergence rate of distributed averaging algorithms. We focus on the case where the local predictor is a linear combination of the node's two previous values (i.e., two memory taps), and our update rule computes a combination of the predictor and the usual weighted linear combination of values received from neighbouring nodes. We derive the optimal mixing parameter for combining the predictor with the neighbors' values, and carr","authors_text":"Boris N. Oreshkin, Mark J. Coates, Michael G. Rabbat","cross_cats":["cs.IT","cs.MA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-03-20T15:12:13Z","title":"Optimization and Analysis of Distributed Averaging with Short Node Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.3537","kind":"arxiv","version":4},"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:2a9cd6c8328268a89f787286d00ea4b2502228e51f908e8606fd9f863d45af29","target":"record","created_at":"2026-05-18T02:14:26Z","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":"687fd9eb45cb056ff6d8391c54f9b9be53a6de3881f00298aa2839a047a7db13","cross_cats_sorted":["cs.IT","cs.MA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-03-20T15:12:13Z","title_canon_sha256":"8ab3deea1007fbb4d34c3c9282199a6b0dcfbad667fafa411a55dce10cd5df07"},"schema_version":"1.0","source":{"id":"0903.3537","kind":"arxiv","version":4}},"canonical_sha256":"5055ffb307b96ad2c68dc7a4d13853ef0cb9426d293e2e63b20b00027d808d98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5055ffb307b96ad2c68dc7a4d13853ef0cb9426d293e2e63b20b00027d808d98","first_computed_at":"2026-05-18T02:14:26.980787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:26.980787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sbTtYG+5PykmxpxSmHM4fGpLY/NsAipZIo5PHrxfG+OD6qA55YzcKTKI7x/y7Syw8ZlyknBZW1Tb2zk4XrQxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:26.981552Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.3537","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a9cd6c8328268a89f787286d00ea4b2502228e51f908e8606fd9f863d45af29","sha256:0a4fa1b5dc84893ca74d99b1ee3060acfdcdf06f806ff19a748f0bf94803229c"],"state_sha256":"cc68a413cbe65c0389076d1c33ca6141853885cfd188f70469f8c3920d1ddd97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcZPB4KL/4ZEDOP9C/sXqjO5kFnyN18jWo062zPAtDPYasTxm4n/tEuoakcfmQ3BSzA9HPzv5oSPXSBNf0N+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:54:48.699845Z","bundle_sha256":"72950f629785f5228ae1bea97ee880b443d887302122511291ac79b7edbfae2d"}}