{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DAIAKTAFKHU7JOIYDG66CSFUN2","short_pith_number":"pith:DAIAKTAF","canonical_record":{"source":{"id":"1410.5355","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-20T17:10:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3ac472c431dcd33fd3406d388498df82cd83d2a802c141c7f387b542ebf894f5","abstract_canon_sha256":"16788cff6660a40cf59f4d946d7a25bd020f9df27726b21c34c2537b3df0807c"},"schema_version":"1.0"},"canonical_sha256":"1810054c0551e9f4b91819bde148b46ebc3430007fb01b3c752a744a71cb89b0","source":{"kind":"arxiv","id":"1410.5355","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5355","created_at":"2026-05-18T02:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5355v3","created_at":"2026-05-18T02:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5355","created_at":"2026-05-18T02:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"DAIAKTAFKHU7","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DAIAKTAFKHU7JOIY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DAIAKTAF","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DAIAKTAFKHU7JOIYDG66CSFUN2","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5355","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-20T17:10:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3ac472c431dcd33fd3406d388498df82cd83d2a802c141c7f387b542ebf894f5","abstract_canon_sha256":"16788cff6660a40cf59f4d946d7a25bd020f9df27726b21c34c2537b3df0807c"},"schema_version":"1.0"},"canonical_sha256":"1810054c0551e9f4b91819bde148b46ebc3430007fb01b3c752a744a71cb89b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:46.347501Z","signature_b64":"4CdiAoevovEYjyCiLHaBleInn6+CyY+msCNtnC9UgGC1NbFNgn0T5QhLEXJJTTcqBwTO1LCaAbzRQd+q/tsABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1810054c0551e9f4b91819bde148b46ebc3430007fb01b3c752a744a71cb89b0","last_reissued_at":"2026-05-18T02:31:46.346899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:46.346899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5355","source_version":3,"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-18T02:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UP6Nke6DFsNAwt7AvPurf7Ib9s8GJQuSknVMNLtKIESujYbWy5zSl2X/LgNCpxij0TlM9V82Tuw8NMVILejECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:42:39.839175Z"},"content_sha256":"ed7ddca3d5cc96198f32ea1e6ca10c4c280a515e9c76078184c64de5b69a0b6b","schema_version":"1.0","event_id":"sha256:ed7ddca3d5cc96198f32ea1e6ca10c4c280a515e9c76078184c64de5b69a0b6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DAIAKTAFKHU7JOIYDG66CSFUN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Influence of Graph Density on Randomized Gossiping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Dominik Kaaser, Robert Els\\\"asser","submitted_at":"2014-10-20T17:10:32Z","abstract_excerpt":"Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, the broadcasting problem, a message has to be spread among all nodes of a graph. A prominent communication protocol for this problem is based on the random phone call model (Karp et al., FOCS 2000). In each step, every node opens a communication channel to a randomly chosen neighbor for bi-directional communication.\n  Motivated by replicated databases and peer-to-peer networks, Berenbrink et al., ICALP 2010, considered the gossiping problem in the random phone call model. There, e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5355","kind":"arxiv","version":3},"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-18T02:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZF/U+8MFYdwz3/uDqSHkJLqqzSfPZVtru4tFqncTVd7EhHQRAe6gIEra9ZjvnzwHboDaH6ynslfiXl4kKsK7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:42:39.839540Z"},"content_sha256":"ab2b08ad1c538ed74bc78b1dbf8284241a80f6d0747d4aad7c6fafd5f6015fc0","schema_version":"1.0","event_id":"sha256:ab2b08ad1c538ed74bc78b1dbf8284241a80f6d0747d4aad7c6fafd5f6015fc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAIAKTAFKHU7JOIYDG66CSFUN2/bundle.json","state_url":"https://pith.science/pith/DAIAKTAFKHU7JOIYDG66CSFUN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAIAKTAFKHU7JOIYDG66CSFUN2/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-04T17:42:39Z","links":{"resolver":"https://pith.science/pith/DAIAKTAFKHU7JOIYDG66CSFUN2","bundle":"https://pith.science/pith/DAIAKTAFKHU7JOIYDG66CSFUN2/bundle.json","state":"https://pith.science/pith/DAIAKTAFKHU7JOIYDG66CSFUN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAIAKTAFKHU7JOIYDG66CSFUN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DAIAKTAFKHU7JOIYDG66CSFUN2","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":"16788cff6660a40cf59f4d946d7a25bd020f9df27726b21c34c2537b3df0807c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-20T17:10:32Z","title_canon_sha256":"3ac472c431dcd33fd3406d388498df82cd83d2a802c141c7f387b542ebf894f5"},"schema_version":"1.0","source":{"id":"1410.5355","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5355","created_at":"2026-05-18T02:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5355v3","created_at":"2026-05-18T02:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5355","created_at":"2026-05-18T02:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"DAIAKTAFKHU7","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DAIAKTAFKHU7JOIY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DAIAKTAF","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:ab2b08ad1c538ed74bc78b1dbf8284241a80f6d0747d4aad7c6fafd5f6015fc0","target":"graph","created_at":"2026-05-18T02:31:46Z","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":"Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, the broadcasting problem, a message has to be spread among all nodes of a graph. A prominent communication protocol for this problem is based on the random phone call model (Karp et al., FOCS 2000). In each step, every node opens a communication channel to a randomly chosen neighbor for bi-directional communication.\n  Motivated by replicated databases and peer-to-peer networks, Berenbrink et al., ICALP 2010, considered the gossiping problem in the random phone call model. There, e","authors_text":"Dominik Kaaser, Robert Els\\\"asser","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-20T17:10:32Z","title":"On the Influence of Graph Density on Randomized Gossiping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5355","kind":"arxiv","version":3},"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:ed7ddca3d5cc96198f32ea1e6ca10c4c280a515e9c76078184c64de5b69a0b6b","target":"record","created_at":"2026-05-18T02:31:46Z","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":"16788cff6660a40cf59f4d946d7a25bd020f9df27726b21c34c2537b3df0807c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-20T17:10:32Z","title_canon_sha256":"3ac472c431dcd33fd3406d388498df82cd83d2a802c141c7f387b542ebf894f5"},"schema_version":"1.0","source":{"id":"1410.5355","kind":"arxiv","version":3}},"canonical_sha256":"1810054c0551e9f4b91819bde148b46ebc3430007fb01b3c752a744a71cb89b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1810054c0551e9f4b91819bde148b46ebc3430007fb01b3c752a744a71cb89b0","first_computed_at":"2026-05-18T02:31:46.346899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:46.346899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4CdiAoevovEYjyCiLHaBleInn6+CyY+msCNtnC9UgGC1NbFNgn0T5QhLEXJJTTcqBwTO1LCaAbzRQd+q/tsABg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:46.347501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5355","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed7ddca3d5cc96198f32ea1e6ca10c4c280a515e9c76078184c64de5b69a0b6b","sha256:ab2b08ad1c538ed74bc78b1dbf8284241a80f6d0747d4aad7c6fafd5f6015fc0"],"state_sha256":"480d31c061a54235b0b7e801804d3cf7dec597d8418010bd22ac4564333a5156"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"me1IMBH8htErezUrm3g9CrmDS3mz+KsaHPlHTHID0iiONZmRtHCfpFGRq2Y4OGsthCKT3cKjsUEiknJmRYhkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:42:39.841643Z","bundle_sha256":"09564e5d01f752bd882e12a65c29f55f11e92c5dc8ed4b9f20ed4582d5d42c5a"}}