{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QMEQL6V77M5SAGPWRRV65XOEAS","short_pith_number":"pith:QMEQL6V7","canonical_record":{"source":{"id":"1301.2722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-12T20:58:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b2a93b336f50b9f1ac1c8e8e529fa583431aeccfc8b0b91703e3edcdcaef338e","abstract_canon_sha256":"5717aa06b1d28ac8da71644f515293ca4395ca3b496a1fa7e50a4426225a271e"},"schema_version":"1.0"},"canonical_sha256":"830905fabffb3b2019f68c6beeddc40491c4e14f6a6a1bea9e22ed1d652dba0e","source":{"kind":"arxiv","id":"1301.2722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2722","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2722v1","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2722","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"pith_short_12","alias_value":"QMEQL6V77M5S","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QMEQL6V77M5SAGPW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QMEQL6V7","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QMEQL6V77M5SAGPWRRV65XOEAS","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-12T20:58:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b2a93b336f50b9f1ac1c8e8e529fa583431aeccfc8b0b91703e3edcdcaef338e","abstract_canon_sha256":"5717aa06b1d28ac8da71644f515293ca4395ca3b496a1fa7e50a4426225a271e"},"schema_version":"1.0"},"canonical_sha256":"830905fabffb3b2019f68c6beeddc40491c4e14f6a6a1bea9e22ed1d652dba0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:35.442900Z","signature_b64":"UWB+QqCTjoF97j//jZhclFmMp5d6OK3TthzHmKYmFGto+2ZSOAc4oJS9jscVR9yJrL/did88nko6Bt40nbr3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"830905fabffb3b2019f68c6beeddc40491c4e14f6a6a1bea9e22ed1d652dba0e","last_reissued_at":"2026-05-18T03:36:35.442194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:35.442194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2722","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-18T03:36:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vIVEigu5KiQGItoJXmZBVX4C287p6/zOkOETMOqn3Z8IUr2hRpg7g+s3T8x2hdQtoq0ZBvsJETsrSPUqs5O9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:45:48.618129Z"},"content_sha256":"2b7d03798d4e5192b1dd5aea1395e1291582f74f525d74b7a4980c42f7d0b843","schema_version":"1.0","event_id":"sha256:2b7d03798d4e5192b1dd5aea1395e1291582f74f525d74b7a4980c42f7d0b843"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QMEQL6V77M5SAGPWRRV65XOEAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Consensus Formation Through Unconstrained Gossiping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Annie S. Wu, Christopher D. Hollander","submitted_at":"2013-01-12T20:58:17Z","abstract_excerpt":"Gossip algorithms are widely used to solve the distributed consensus problem, but issues can arise when nodes receive multiple signals either at the same time or before they are able to finish processing their current work load. Specifically, a node may assume a new state that represents a linear combination of all received signals; even if such a state makes no sense in the problem domain. As a solution to this problem, we introduce the notion of conflict resolution for gossip algorithms and prove that their application leads to a valid consensus state when the underlying communication networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2722","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-18T03:36:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQRxzXjaO6I1zsVC8O1a1IY5STUaUrIG0kQlCexAbCSztIEmg4rNhWg1J/ngS/hc2QtACuA/9+A4Zu6UOJg+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:45:48.618506Z"},"content_sha256":"74c8eebc7ee6c8a32847482150ac2185233a3a54b7bc5fff494e0d2a1cdebb56","schema_version":"1.0","event_id":"sha256:74c8eebc7ee6c8a32847482150ac2185233a3a54b7bc5fff494e0d2a1cdebb56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMEQL6V77M5SAGPWRRV65XOEAS/bundle.json","state_url":"https://pith.science/pith/QMEQL6V77M5SAGPWRRV65XOEAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMEQL6V77M5SAGPWRRV65XOEAS/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-10T21:45:48Z","links":{"resolver":"https://pith.science/pith/QMEQL6V77M5SAGPWRRV65XOEAS","bundle":"https://pith.science/pith/QMEQL6V77M5SAGPWRRV65XOEAS/bundle.json","state":"https://pith.science/pith/QMEQL6V77M5SAGPWRRV65XOEAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMEQL6V77M5SAGPWRRV65XOEAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QMEQL6V77M5SAGPWRRV65XOEAS","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":"5717aa06b1d28ac8da71644f515293ca4395ca3b496a1fa7e50a4426225a271e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-12T20:58:17Z","title_canon_sha256":"b2a93b336f50b9f1ac1c8e8e529fa583431aeccfc8b0b91703e3edcdcaef338e"},"schema_version":"1.0","source":{"id":"1301.2722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2722","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2722v1","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2722","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"pith_short_12","alias_value":"QMEQL6V77M5S","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QMEQL6V77M5SAGPW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QMEQL6V7","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:74c8eebc7ee6c8a32847482150ac2185233a3a54b7bc5fff494e0d2a1cdebb56","target":"graph","created_at":"2026-05-18T03:36:35Z","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":"Gossip algorithms are widely used to solve the distributed consensus problem, but issues can arise when nodes receive multiple signals either at the same time or before they are able to finish processing their current work load. Specifically, a node may assume a new state that represents a linear combination of all received signals; even if such a state makes no sense in the problem domain. As a solution to this problem, we introduce the notion of conflict resolution for gossip algorithms and prove that their application leads to a valid consensus state when the underlying communication networ","authors_text":"Annie S. Wu, Christopher D. Hollander","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-12T20:58:17Z","title":"Distributed Consensus Formation Through Unconstrained Gossiping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2722","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:2b7d03798d4e5192b1dd5aea1395e1291582f74f525d74b7a4980c42f7d0b843","target":"record","created_at":"2026-05-18T03:36:35Z","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":"5717aa06b1d28ac8da71644f515293ca4395ca3b496a1fa7e50a4426225a271e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-01-12T20:58:17Z","title_canon_sha256":"b2a93b336f50b9f1ac1c8e8e529fa583431aeccfc8b0b91703e3edcdcaef338e"},"schema_version":"1.0","source":{"id":"1301.2722","kind":"arxiv","version":1}},"canonical_sha256":"830905fabffb3b2019f68c6beeddc40491c4e14f6a6a1bea9e22ed1d652dba0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"830905fabffb3b2019f68c6beeddc40491c4e14f6a6a1bea9e22ed1d652dba0e","first_computed_at":"2026-05-18T03:36:35.442194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:35.442194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UWB+QqCTjoF97j//jZhclFmMp5d6OK3TthzHmKYmFGto+2ZSOAc4oJS9jscVR9yJrL/did88nko6Bt40nbr3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:35.442900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b7d03798d4e5192b1dd5aea1395e1291582f74f525d74b7a4980c42f7d0b843","sha256:74c8eebc7ee6c8a32847482150ac2185233a3a54b7bc5fff494e0d2a1cdebb56"],"state_sha256":"23faff959950488a64c57532cecfa04e9f95b9f75f272b3fc6f4b1a93c9fe3f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HE/z9G30uMLflclgt7xrKG0CkJooiCdy7vs5pz9lOYTKs8czjSWjVyVZga1cKXni+Hhns1z3NGYCtf2uHMpoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:45:48.620462Z","bundle_sha256":"56a6cfb514bd7c7b34281a0eb6099ba91a5808ee08d1748008e7dc5d67671ff4"}}