{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3XL3SR7PS3BJHSHLGSXNGSV4FF","short_pith_number":"pith:3XL3SR7P","canonical_record":{"source":{"id":"1812.11903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-12-31T17:12:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"af616dc09b85126c432cb9c156dd0852139ad32b9dc703144dd7848f0e2e574a","abstract_canon_sha256":"c7fee382791d99b0cb6ef2d564097cdbe57258fcc21bdb6c2cb8e14c2b1b06c0"},"schema_version":"1.0"},"canonical_sha256":"ddd7b947ef96c293c8eb34aed34abc2971951a5b58a510b581c32c1f7215fb70","source":{"kind":"arxiv","id":"1812.11903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11903","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11903v1","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11903","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"pith_short_12","alias_value":"3XL3SR7PS3BJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3XL3SR7PS3BJHSHL","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3XL3SR7P","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3XL3SR7PS3BJHSHLGSXNGSV4FF","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-12-31T17:12:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"af616dc09b85126c432cb9c156dd0852139ad32b9dc703144dd7848f0e2e574a","abstract_canon_sha256":"c7fee382791d99b0cb6ef2d564097cdbe57258fcc21bdb6c2cb8e14c2b1b06c0"},"schema_version":"1.0"},"canonical_sha256":"ddd7b947ef96c293c8eb34aed34abc2971951a5b58a510b581c32c1f7215fb70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:10.809001Z","signature_b64":"Jmu96JgH1j23rtH6bBA87DL4H6VERv77jEevR7lPxGJx+rxD7huBm2NHk3hylMs+2VjOI2sKRepi5DRWq0RiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddd7b947ef96c293c8eb34aed34abc2971951a5b58a510b581c32c1f7215fb70","last_reissued_at":"2026-05-17T23:57:10.808644Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:10.808644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11903","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:57:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jjg4VfKrYo4iGOz/wRZgoil+OwsLfvq+jEvrMeFkhuWNYAmxg6ntTZTSRUrglm0sFpAO2duY8eQPs5L2oK1SAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:26:50.871184Z"},"content_sha256":"43cf880cb6837e539101c5f61c63d2589c637014b9f3e87c9b69c0192c22fe97","schema_version":"1.0","event_id":"sha256:43cf880cb6837e539101c5f61c63d2589c637014b9f3e87c9b69c0192c22fe97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3XL3SR7PS3BJHSHLGSXNGSV4FF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Rumor Spreading in Ad Hoc Networks with Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SI","authors_text":"Christopher Thraves Caro, Dariusz R. Kowalski","submitted_at":"2018-12-31T17:12:30Z","abstract_excerpt":"The randomized rumor spreading problem generates a big interest in the area of distributed algorithms due to its simplicity, robustness and wide range of applications. The two most popular communication paradigms used for spreading the rumor are Push and Pull algorithms. The former protocol allows nodes to send the rumor to a randomly selected neighbor at each step, while the latter is based on sending a request and downloading the rumor from a randomly selected neighbor, provided the neighbor has it. Previous analysis of these protocols assumed that every node could process all such push/pull"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11903","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:57:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GH2VrW01+MWCs1gyFG27a8giMK9bJcKhAboSw/WWfyO7FZrhsN+ViD8Trte2xGqwBgbuYR2qXkcGyORv5D+YAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:26:50.871547Z"},"content_sha256":"e36e27fb7c45b2efa16933c690cf43e659c383cb023590fd0d7752c253c0603a","schema_version":"1.0","event_id":"sha256:e36e27fb7c45b2efa16933c690cf43e659c383cb023590fd0d7752c253c0603a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XL3SR7PS3BJHSHLGSXNGSV4FF/bundle.json","state_url":"https://pith.science/pith/3XL3SR7PS3BJHSHLGSXNGSV4FF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XL3SR7PS3BJHSHLGSXNGSV4FF/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-23T20:26:50Z","links":{"resolver":"https://pith.science/pith/3XL3SR7PS3BJHSHLGSXNGSV4FF","bundle":"https://pith.science/pith/3XL3SR7PS3BJHSHLGSXNGSV4FF/bundle.json","state":"https://pith.science/pith/3XL3SR7PS3BJHSHLGSXNGSV4FF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XL3SR7PS3BJHSHLGSXNGSV4FF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3XL3SR7PS3BJHSHLGSXNGSV4FF","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":"c7fee382791d99b0cb6ef2d564097cdbe57258fcc21bdb6c2cb8e14c2b1b06c0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-12-31T17:12:30Z","title_canon_sha256":"af616dc09b85126c432cb9c156dd0852139ad32b9dc703144dd7848f0e2e574a"},"schema_version":"1.0","source":{"id":"1812.11903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11903","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11903v1","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11903","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"pith_short_12","alias_value":"3XL3SR7PS3BJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3XL3SR7PS3BJHSHL","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3XL3SR7P","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:e36e27fb7c45b2efa16933c690cf43e659c383cb023590fd0d7752c253c0603a","target":"graph","created_at":"2026-05-17T23:57:10Z","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":"The randomized rumor spreading problem generates a big interest in the area of distributed algorithms due to its simplicity, robustness and wide range of applications. The two most popular communication paradigms used for spreading the rumor are Push and Pull algorithms. The former protocol allows nodes to send the rumor to a randomly selected neighbor at each step, while the latter is based on sending a request and downloading the rumor from a randomly selected neighbor, provided the neighbor has it. Previous analysis of these protocols assumed that every node could process all such push/pull","authors_text":"Christopher Thraves Caro, Dariusz R. Kowalski","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-12-31T17:12:30Z","title":"Randomized Rumor Spreading in Ad Hoc Networks with Buffers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11903","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:43cf880cb6837e539101c5f61c63d2589c637014b9f3e87c9b69c0192c22fe97","target":"record","created_at":"2026-05-17T23:57:10Z","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":"c7fee382791d99b0cb6ef2d564097cdbe57258fcc21bdb6c2cb8e14c2b1b06c0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-12-31T17:12:30Z","title_canon_sha256":"af616dc09b85126c432cb9c156dd0852139ad32b9dc703144dd7848f0e2e574a"},"schema_version":"1.0","source":{"id":"1812.11903","kind":"arxiv","version":1}},"canonical_sha256":"ddd7b947ef96c293c8eb34aed34abc2971951a5b58a510b581c32c1f7215fb70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddd7b947ef96c293c8eb34aed34abc2971951a5b58a510b581c32c1f7215fb70","first_computed_at":"2026-05-17T23:57:10.808644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:10.808644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jmu96JgH1j23rtH6bBA87DL4H6VERv77jEevR7lPxGJx+rxD7huBm2NHk3hylMs+2VjOI2sKRepi5DRWq0RiAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:10.809001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43cf880cb6837e539101c5f61c63d2589c637014b9f3e87c9b69c0192c22fe97","sha256:e36e27fb7c45b2efa16933c690cf43e659c383cb023590fd0d7752c253c0603a"],"state_sha256":"1c0d82a8fcb68698b54acfe01dbb63129305b090b611c098822ac906ebe65969"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnE0jFKw+KP8jhNnqcQq4nrtGmEW0a15OeelE/IXxhd/E1AqwxZQM9HugsIxxXIVx7mCl4Acc7+98D6/BcYBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:26:50.873457Z","bundle_sha256":"a186ec82e57a63167777eb42e6581d164e813f43f08aebb94f27fb88ee660a8c"}}