{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:T4QV4ENIUIBY2CXTXDYNUV5MFW","short_pith_number":"pith:T4QV4ENI","canonical_record":{"source":{"id":"2605.14376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T04:55:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1ba8a1a4acf202f5455d2241300730f7226a52148104ca6a4b05671976b1e0b8","abstract_canon_sha256":"c10f96f16c56756d9e377e07844bfc318f6fbc80add9fe121cd0430ad8716060"},"schema_version":"1.0"},"canonical_sha256":"9f215e11a8a2038d0af3b8f0da57ac2db45f7ed316f807ddc016abc956759c13","source":{"kind":"arxiv","id":"2605.14376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14376","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14376v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14376","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"T4QV4ENIUIBY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"T4QV4ENIUIBY2CXT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"T4QV4ENI","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:T4QV4ENIUIBY2CXTXDYNUV5MFW","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T04:55:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1ba8a1a4acf202f5455d2241300730f7226a52148104ca6a4b05671976b1e0b8","abstract_canon_sha256":"c10f96f16c56756d9e377e07844bfc318f6fbc80add9fe121cd0430ad8716060"},"schema_version":"1.0"},"canonical_sha256":"9f215e11a8a2038d0af3b8f0da57ac2db45f7ed316f807ddc016abc956759c13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.773141Z","signature_b64":"g35yv4ylpgpzgHW0+7DSwwNSo0PGKAL1/bYjF7us8RrNwPC1YdNcQGHtSNdrFrlfihTnpxMc3K13G+WeSmlyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f215e11a8a2038d0af3b8f0da57ac2db45f7ed316f807ddc016abc956759c13","last_reissued_at":"2026-05-17T23:39:07.772449Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.772449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14376","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-17T23:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ky3S70nwMqO1yqCg11rj7r6Ku/wZ/L80c4CNdIiFqCV2QNvej6RMXft/zclk5RNp/pNpnpLfnqb03R+XhxWBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:11:57.808379Z"},"content_sha256":"d2c974d5c0174630e4c2377d6582afe762dade34efad305783d29f68d87d5e0a","schema_version":"1.0","event_id":"sha256:d2c974d5c0174630e4c2377d6582afe762dade34efad305783d29f68d87d5e0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:T4QV4ENIUIBY2CXTXDYNUV5MFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Gossip-based Rumor Spreading using Small Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Fabien Dufoulon, Gopal Pandurangan, William K. Moses Jr.","submitted_at":"2026-05-14T04:55:05Z","abstract_excerpt":"We study gossip algorithms for the fundamental rumor spreading problem, where the goal is to disseminate a rumor from a given source node to all nodes in an arbitrary (and unknown) graph. Gossip algorithms allow each node to call only one neighbor per round and are therefore highly message-efficient, with low per-node communication overhead per round. The state of the art present fast gossip algorithms, however they typically leverage large-sized messages. This undermines the light-weight communication advantage of gossip, since even though only one neighbor is contacted per round, the message"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14376","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-17T23:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6nHOeBiMBoJ6iBwC/LssFk46RxLhvQ90Rj4oe15DB0k9+dFokSqG94Nret5qOPtTVcN4MzcJqJBYtNhCg+8ZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:11:57.808741Z"},"content_sha256":"e6eba8c9d40d0e18c46058744498d4ad2da396a9466d5c90e784cdceb8a442ca","schema_version":"1.0","event_id":"sha256:e6eba8c9d40d0e18c46058744498d4ad2da396a9466d5c90e784cdceb8a442ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/bundle.json","state_url":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/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-06T20:11:57Z","links":{"resolver":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW","bundle":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/bundle.json","state":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T4QV4ENIUIBY2CXTXDYNUV5MFW","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":"c10f96f16c56756d9e377e07844bfc318f6fbc80add9fe121cd0430ad8716060","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T04:55:05Z","title_canon_sha256":"1ba8a1a4acf202f5455d2241300730f7226a52148104ca6a4b05671976b1e0b8"},"schema_version":"1.0","source":{"id":"2605.14376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14376","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14376v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14376","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"T4QV4ENIUIBY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"T4QV4ENIUIBY2CXT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"T4QV4ENI","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e6eba8c9d40d0e18c46058744498d4ad2da396a9466d5c90e784cdceb8a442ca","target":"graph","created_at":"2026-05-17T23:39:07Z","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":"We study gossip algorithms for the fundamental rumor spreading problem, where the goal is to disseminate a rumor from a given source node to all nodes in an arbitrary (and unknown) graph. Gossip algorithms allow each node to call only one neighbor per round and are therefore highly message-efficient, with low per-node communication overhead per round. The state of the art present fast gossip algorithms, however they typically leverage large-sized messages. This undermines the light-weight communication advantage of gossip, since even though only one neighbor is contacted per round, the message","authors_text":"Fabien Dufoulon, Gopal Pandurangan, William K. Moses Jr.","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T04:55:05Z","title":"Fast Gossip-based Rumor Spreading using Small Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14376","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:d2c974d5c0174630e4c2377d6582afe762dade34efad305783d29f68d87d5e0a","target":"record","created_at":"2026-05-17T23:39:07Z","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":"c10f96f16c56756d9e377e07844bfc318f6fbc80add9fe121cd0430ad8716060","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T04:55:05Z","title_canon_sha256":"1ba8a1a4acf202f5455d2241300730f7226a52148104ca6a4b05671976b1e0b8"},"schema_version":"1.0","source":{"id":"2605.14376","kind":"arxiv","version":1}},"canonical_sha256":"9f215e11a8a2038d0af3b8f0da57ac2db45f7ed316f807ddc016abc956759c13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f215e11a8a2038d0af3b8f0da57ac2db45f7ed316f807ddc016abc956759c13","first_computed_at":"2026-05-17T23:39:07.772449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:07.772449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g35yv4ylpgpzgHW0+7DSwwNSo0PGKAL1/bYjF7us8RrNwPC1YdNcQGHtSNdrFrlfihTnpxMc3K13G+WeSmlyCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:07.773141Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2c974d5c0174630e4c2377d6582afe762dade34efad305783d29f68d87d5e0a","sha256:e6eba8c9d40d0e18c46058744498d4ad2da396a9466d5c90e784cdceb8a442ca"],"state_sha256":"b28b0eaf8d695bdfccef392f4f0561e3d57b6634aab04791223d62f0946df960"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8agk83H0e0ZNh1aOst4byX5g0kee9hqhb0lwvrRnvcnhP3QpuyYei+8UQrdszvUc5VYhRw7JxO7+zmo7H+vAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:11:57.812254Z","bundle_sha256":"56f9cf0d4338e246034de99968cb9fb53369c91749286968ba20031f2eb08123"}}