{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WBRPWRVVQNTK7KEELQ627OYOEY","short_pith_number":"pith:WBRPWRVV","schema_version":"1.0","canonical_sha256":"b062fb46b58366afa8845c3dafbb0e2617e91caaa5609108ffe0270a241bba0d","source":{"kind":"arxiv","id":"1612.08463","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.08463","created_at":"2026-05-18T00:53:52.954247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08463v1","created_at":"2026-05-18T00:53:52.954247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08463","created_at":"2026-05-18T00:53:52.954247+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBRPWRVVQNTK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBRPWRVVQNTK7KEE","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBRPWRVV","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY","json":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY.json","graph_json":"https://pith.science/api/pith-number/WBRPWRVVQNTK7KEELQ627OYOEY/graph.json","events_json":"https://pith.science/api/pith-number/WBRPWRVVQNTK7KEELQ627OYOEY/events.json","paper":"https://pith.science/paper/WBRPWRVV"},"agent_actions":{"view_html":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY","download_json":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY.json","view_paper":"https://pith.science/paper/WBRPWRVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08463&json=true","fetch_graph":"https://pith.science/api/pith-number/WBRPWRVVQNTK7KEELQ627OYOEY/graph.json","fetch_events":"https://pith.science/api/pith-number/WBRPWRVVQNTK7KEELQ627OYOEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/action/storage_attestation","attest_author":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/action/author_attestation","sign_citation":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/action/citation_signature","submit_replication":"https://pith.science/pith/WBRPWRVVQNTK7KEELQ627OYOEY/action/replication_record"}},"created_at":"2026-05-18T00:53:52.954247+00:00","updated_at":"2026-05-18T00:53:52.954247+00:00"}