{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SV4W7IXLLZQK4T2JAX5ZZ4VSRJ","short_pith_number":"pith:SV4W7IXL","canonical_record":{"source":{"id":"1411.0948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T15:53:11Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2b715eacff44c83453ac3e65bb6dccfd326e5356454aa4e26035a54eecab6a2b","abstract_canon_sha256":"8ed284dce33a8ad1ed23605d283ed9c5ec01b2c32e86502c7edf263a74258507"},"schema_version":"1.0"},"canonical_sha256":"95796fa2eb5e60ae4f4905fb9cf2b28a5dd55fd39078796660278eb20a99a500","source":{"kind":"arxiv","id":"1411.0948","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0948","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0948v2","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0948","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"SV4W7IXLLZQK","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SV4W7IXLLZQK4T2J","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SV4W7IXL","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SV4W7IXLLZQK4T2JAX5ZZ4VSRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T15:53:11Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2b715eacff44c83453ac3e65bb6dccfd326e5356454aa4e26035a54eecab6a2b","abstract_canon_sha256":"8ed284dce33a8ad1ed23605d283ed9c5ec01b2c32e86502c7edf263a74258507"},"schema_version":"1.0"},"canonical_sha256":"95796fa2eb5e60ae4f4905fb9cf2b28a5dd55fd39078796660278eb20a99a500","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:57.756990Z","signature_b64":"mLxZt9ZD9RdV1pDN/dLfLcYnX0FNgD71w+lSGboSP1arRo/v/NXIiqxisPF7XVNEkG77FMTXyBcLndfhLQ7XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95796fa2eb5e60ae4f4905fb9cf2b28a5dd55fd39078796660278eb20a99a500","last_reissued_at":"2026-05-18T01:32:57.756275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:57.756275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0948","source_version":2,"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-18T01:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHzbhTHcBnw33bb5EVR+Me8fMGQHyeUDHWa+wd08QFAL2J6ZHNQkm5hPc0kjLkPZFJMrcIrJh/wPWyZ92srxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:37:33.001924Z"},"content_sha256":"59ad5a8727717fa2baeb78e82a99c0417e90cef83420115cec84e0fbebac9e99","schema_version":"1.0","event_id":"sha256:59ad5a8727717fa2baeb78e82a99c0417e90cef83420115cec84e0fbebac9e99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SV4W7IXLLZQK4T2JAX5ZZ4VSRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the push&pull protocol for rumour spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DC","authors_text":"Abbas Mehrabian, Andrea Collevecchio, Huseyin Acan, Nick Wormald","submitted_at":"2014-11-04T15:53:11Z","abstract_excerpt":"The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$ knows the rumour. Whenever the clock of a vertex $x$ rings, it calls a random neighbour $y$: if $x$ knows the rumour and $y$ does not, then $x$ tells $y$ the rumour (a push operation), and if $x$ does not know the rumour and $y$ knows it, $y$ tells $x$ the rumour (a pull operation). The average spread time of $G$ is the expected time it takes for all vertices to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0948","kind":"arxiv","version":2},"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-18T01:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIaQ7NXEB2GU2rURu0xjYoNKGCTz4AufTlR9SjGusVS9kv25sumx2bBaBS08D1jTloH4bGE8xhgVqKvUMyQ4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:37:33.002622Z"},"content_sha256":"a1b6078940f0ca7eda1a499082e2fb714abfcde5defd2c5c8f52d72f94cdb937","schema_version":"1.0","event_id":"sha256:a1b6078940f0ca7eda1a499082e2fb714abfcde5defd2c5c8f52d72f94cdb937"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/bundle.json","state_url":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/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-05-26T00:37:33Z","links":{"resolver":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ","bundle":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/bundle.json","state":"https://pith.science/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SV4W7IXLLZQK4T2JAX5ZZ4VSRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SV4W7IXLLZQK4T2JAX5ZZ4VSRJ","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":"8ed284dce33a8ad1ed23605d283ed9c5ec01b2c32e86502c7edf263a74258507","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T15:53:11Z","title_canon_sha256":"2b715eacff44c83453ac3e65bb6dccfd326e5356454aa4e26035a54eecab6a2b"},"schema_version":"1.0","source":{"id":"1411.0948","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0948","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0948v2","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0948","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"SV4W7IXLLZQK","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SV4W7IXLLZQK4T2J","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SV4W7IXL","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:a1b6078940f0ca7eda1a499082e2fb714abfcde5defd2c5c8f52d72f94cdb937","target":"graph","created_at":"2026-05-18T01:32:57Z","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 asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$ knows the rumour. Whenever the clock of a vertex $x$ rings, it calls a random neighbour $y$: if $x$ knows the rumour and $y$ does not, then $x$ tells $y$ the rumour (a push operation), and if $x$ does not know the rumour and $y$ knows it, $y$ tells $x$ the rumour (a pull operation). The average spread time of $G$ is the expected time it takes for all vertices to","authors_text":"Abbas Mehrabian, Andrea Collevecchio, Huseyin Acan, Nick Wormald","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T15:53:11Z","title":"On the push&pull protocol for rumour spreading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0948","kind":"arxiv","version":2},"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:59ad5a8727717fa2baeb78e82a99c0417e90cef83420115cec84e0fbebac9e99","target":"record","created_at":"2026-05-18T01:32:57Z","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":"8ed284dce33a8ad1ed23605d283ed9c5ec01b2c32e86502c7edf263a74258507","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T15:53:11Z","title_canon_sha256":"2b715eacff44c83453ac3e65bb6dccfd326e5356454aa4e26035a54eecab6a2b"},"schema_version":"1.0","source":{"id":"1411.0948","kind":"arxiv","version":2}},"canonical_sha256":"95796fa2eb5e60ae4f4905fb9cf2b28a5dd55fd39078796660278eb20a99a500","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95796fa2eb5e60ae4f4905fb9cf2b28a5dd55fd39078796660278eb20a99a500","first_computed_at":"2026-05-18T01:32:57.756275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:57.756275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLxZt9ZD9RdV1pDN/dLfLcYnX0FNgD71w+lSGboSP1arRo/v/NXIiqxisPF7XVNEkG77FMTXyBcLndfhLQ7XAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:57.756990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0948","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59ad5a8727717fa2baeb78e82a99c0417e90cef83420115cec84e0fbebac9e99","sha256:a1b6078940f0ca7eda1a499082e2fb714abfcde5defd2c5c8f52d72f94cdb937"],"state_sha256":"30f64e039f5988d2d10f8b086a6cc0096a26392832280a3ee286c9fa237d1b49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6zysEwmhQcWUwlM4CHq8I9c+AGycdPyjHHkAZT1vJgO3DsWXdoccPnO4cppKgw84B7aSW0bujeIMa1KEb7fZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:37:33.006409Z","bundle_sha256":"d8d26daa948ff742187b13d69a053086e8470ff7816508c60c47106de2add597"}}