{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WBRPWRVVQNTK7KEELQ627OYOEY","short_pith_number":"pith:WBRPWRVV","canonical_record":{"source":{"id":"1612.08463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-27T00:24:51Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f2b577a5d5a897f241fd005140cf6a7abbab471e4aa7ad481afa55ed8d616759","abstract_canon_sha256":"8a58abef1583ef9b43de7f7084e8cadfb399716012d26a2253be51073b51e852"},"schema_version":"1.0"},"canonical_sha256":"b062fb46b58366afa8845c3dafbb0e2617e91caaa5609108ffe0270a241bba0d","source":{"kind":"arxiv","id":"1612.08463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08463","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08463v1","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08463","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"WBRPWRVVQNTK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WBRPWRVVQNTK7KEE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WBRPWRVV","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WBRPWRVVQNTK7KEELQ627OYOEY","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-27T00:24:51Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f2b577a5d5a897f241fd005140cf6a7abbab471e4aa7ad481afa55ed8d616759","abstract_canon_sha256":"8a58abef1583ef9b43de7f7084e8cadfb399716012d26a2253be51073b51e852"},"schema_version":"1.0"},"canonical_sha256":"b062fb46b58366afa8845c3dafbb0e2617e91caaa5609108ffe0270a241bba0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:52.955918Z","signature_b64":"wtjiyy92LtXD39BoXOHhlwEw5AE9hzDZpWpzIlpDSa3cbGGQWFOUP1VGbvEbqo9LDBBb31BUqa8rJhaSIKPwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b062fb46b58366afa8845c3dafbb0e2617e91caaa5609108ffe0270a241bba0d","last_reissued_at":"2026-05-18T00:53:52.954130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:52.954130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08463","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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86XVXTp9TMyrcu4Vhkch+Bi/n1c2CqoLk87jH6RxVLaMhrh6P/JqSGtVYGn2Dx6LscIEOy6N20PxE969wVhNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:09:57.879206Z"},"content_sha256":"e2beb790d0d7ba8437259ed7548f9daadea0c6e32588dd3fa519674658b98ee7","schema_version":"1.0","event_id":"sha256:e2beb790d0d7ba8437259ed7548f9daadea0c6e32588dd3fa519674658b98ee7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WBRPWRVVQNTK7KEELQ627OYOEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Request-Based Gossiping without Deadlocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"A. Stephen Morse, Brian D. O. Anderson, Changbin Yu, Ji Liu, Shaoshuai Mou","submitted_at":"2016-12-27T00:24:51Z","abstract_excerpt":"By the distributed averaging problem is meant the problem of computing the average value of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each iterative step. Crafting a gossiping protocol which accomplishes this is challenging because gossiping is an inherently collaborative process which can lead to deadlocks unless careful precautions are taken "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08463","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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58PsNg8o2YiRdPk9+XSOYJdKeRNBWGzle0cGBtM4BNcBuV57khACKMjv1HoWD0ziEmG+WuJM8MLLRdu6frijCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:09:57.879780Z"},"content_sha256":"c0dbfbab493e34a45cadda5662f2c99c4304763d14f69de0bc2fee849917213a","schema_version":"1.0","event_id":"sha256:c0dbfbab493e34a45cadda5662f2c99c4304763d14f69de0bc2fee849917213a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/bundle.json","state_url":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBRPWRVVQNTK7KEELQ627OYOEY/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-03T22:09:57Z","links":{"resolver":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY","bundle":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/bundle.json","state":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBRPWRVVQNTK7KEELQ627OYOEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WBRPWRVVQNTK7KEELQ627OYOEY","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":"8a58abef1583ef9b43de7f7084e8cadfb399716012d26a2253be51073b51e852","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-27T00:24:51Z","title_canon_sha256":"f2b577a5d5a897f241fd005140cf6a7abbab471e4aa7ad481afa55ed8d616759"},"schema_version":"1.0","source":{"id":"1612.08463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08463","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08463v1","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08463","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"WBRPWRVVQNTK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WBRPWRVVQNTK7KEE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WBRPWRVV","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:c0dbfbab493e34a45cadda5662f2c99c4304763d14f69de0bc2fee849917213a","target":"graph","created_at":"2026-05-18T00:53:52Z","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":"By the distributed averaging problem is meant the problem of computing the average value of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each iterative step. Crafting a gossiping protocol which accomplishes this is challenging because gossiping is an inherently collaborative process which can lead to deadlocks unless careful precautions are taken ","authors_text":"A. Stephen Morse, Brian D. O. Anderson, Changbin Yu, Ji Liu, Shaoshuai Mou","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-27T00:24:51Z","title":"Request-Based Gossiping without Deadlocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08463","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:e2beb790d0d7ba8437259ed7548f9daadea0c6e32588dd3fa519674658b98ee7","target":"record","created_at":"2026-05-18T00:53:52Z","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":"8a58abef1583ef9b43de7f7084e8cadfb399716012d26a2253be51073b51e852","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-27T00:24:51Z","title_canon_sha256":"f2b577a5d5a897f241fd005140cf6a7abbab471e4aa7ad481afa55ed8d616759"},"schema_version":"1.0","source":{"id":"1612.08463","kind":"arxiv","version":1}},"canonical_sha256":"b062fb46b58366afa8845c3dafbb0e2617e91caaa5609108ffe0270a241bba0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b062fb46b58366afa8845c3dafbb0e2617e91caaa5609108ffe0270a241bba0d","first_computed_at":"2026-05-18T00:53:52.954130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:52.954130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wtjiyy92LtXD39BoXOHhlwEw5AE9hzDZpWpzIlpDSa3cbGGQWFOUP1VGbvEbqo9LDBBb31BUqa8rJhaSIKPwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:52.955918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2beb790d0d7ba8437259ed7548f9daadea0c6e32588dd3fa519674658b98ee7","sha256:c0dbfbab493e34a45cadda5662f2c99c4304763d14f69de0bc2fee849917213a"],"state_sha256":"2c1558b432bdcdaf166ac25ab55ff0290009d39fa1ee336e3cc1273b50868792"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7vlXhGvnciiRHACsJRDn4BsTe57ww10lDEVhFEliXsrdYpbNNrY5urox1qms13O5KrgviypLPxxi9wG1ePNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:09:57.882472Z","bundle_sha256":"b84dd2de4664aa7358564a6578c1190b930eeaeeaf76c61bee427363b3017fe7"}}