{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HT62PADILDRVNJ5ESZMMTXE4YS","short_pith_number":"pith:HT62PADI","canonical_record":{"source":{"id":"1602.05768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-18T11:49:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3bdc83cdcf6e2d9724c8be4e8ff3d98e17a208f30388420fadfc0f4445479b27","abstract_canon_sha256":"52eae6b003c4e6732401631fa5cd8fc66aa9bd83583e7833e8c5e83a17c774ea"},"schema_version":"1.0"},"canonical_sha256":"3cfda7806858e356a7a49658c9dc9cc491cabef08f3ec1c184220743917f4e01","source":{"kind":"arxiv","id":"1602.05768","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05768","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05768v2","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05768","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"HT62PADILDRV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HT62PADILDRVNJ5E","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HT62PADI","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HT62PADILDRVNJ5ESZMMTXE4YS","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-18T11:49:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3bdc83cdcf6e2d9724c8be4e8ff3d98e17a208f30388420fadfc0f4445479b27","abstract_canon_sha256":"52eae6b003c4e6732401631fa5cd8fc66aa9bd83583e7833e8c5e83a17c774ea"},"schema_version":"1.0"},"canonical_sha256":"3cfda7806858e356a7a49658c9dc9cc491cabef08f3ec1c184220743917f4e01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:37.665438Z","signature_b64":"YCAm7nsdZEwVPg5Gr4FJHv+MKajvSvnC232Ax1+1waUVfR+fC+taAUQXi391fuyfgATRzG/PQxPe7shwNvvXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cfda7806858e356a7a49658c9dc9cc491cabef08f3ec1c184220743917f4e01","last_reissued_at":"2026-05-18T01:13:37.664635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:37.664635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05768","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+TU7Q7RRiGHPKinAL4/JorKzd5I3MI1wwfy7RJTK9T1R3DLUNVWEtJg4k8mgjixxgdiHKrNG9b7tYoqYwj8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:09:57.378211Z"},"content_sha256":"96068391596205768bfc3dc818ecc007d057c7c89122d63fa374cfdf71383b8e","schema_version":"1.0","event_id":"sha256:96068391596205768bfc3dc818ecc007d057c7c89122d63fa374cfdf71383b8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HT62PADILDRVNJ5ESZMMTXE4YS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The coalescing-branching random walk on expanders and the dual epidemic process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DC","authors_text":"Colin Cooper, Nicolas Rivera, Tomasz Radzik","submitted_at":"2016-02-18T11:49:52Z","abstract_excerpt":"Information propagation on graphs is a fundamental topic in distributed computing. One of the simplest models of information propagation is the push protocol in which at each round each agent independently pushes the current knowledge to a random neighbour. In this paper we study the so-called coalescing-branching random walk (COBRA), in which each vertex pushes the information to $k$ randomly selected neighbours and then stops passing information until it receives the information again. The aim of COBRA is to propagate information fast but with a limited number of transmissions per vertex per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05768","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNRI/D4/vjjAkS4p4jjhoHBboHOdt1ia3E+84D69Ua/iwqlyZmY5eUZwZDO9sbpBTPeTmrSqLlsdWQTI7WwIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:09:57.378700Z"},"content_sha256":"659bf06a8c8857446a1b4a0cee76df0d1eacb34c94cb13ebd65c8c2c88400db8","schema_version":"1.0","event_id":"sha256:659bf06a8c8857446a1b4a0cee76df0d1eacb34c94cb13ebd65c8c2c88400db8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/bundle.json","state_url":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HT62PADILDRVNJ5ESZMMTXE4YS/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-22T16:09:57Z","links":{"resolver":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS","bundle":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/bundle.json","state":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HT62PADILDRVNJ5ESZMMTXE4YS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HT62PADILDRVNJ5ESZMMTXE4YS","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":"52eae6b003c4e6732401631fa5cd8fc66aa9bd83583e7833e8c5e83a17c774ea","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-18T11:49:52Z","title_canon_sha256":"3bdc83cdcf6e2d9724c8be4e8ff3d98e17a208f30388420fadfc0f4445479b27"},"schema_version":"1.0","source":{"id":"1602.05768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05768","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05768v2","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05768","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"HT62PADILDRV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HT62PADILDRVNJ5E","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HT62PADI","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:659bf06a8c8857446a1b4a0cee76df0d1eacb34c94cb13ebd65c8c2c88400db8","target":"graph","created_at":"2026-05-18T01:13:37Z","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 propagation on graphs is a fundamental topic in distributed computing. One of the simplest models of information propagation is the push protocol in which at each round each agent independently pushes the current knowledge to a random neighbour. In this paper we study the so-called coalescing-branching random walk (COBRA), in which each vertex pushes the information to $k$ randomly selected neighbours and then stops passing information until it receives the information again. The aim of COBRA is to propagate information fast but with a limited number of transmissions per vertex per","authors_text":"Colin Cooper, Nicolas Rivera, Tomasz Radzik","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-18T11:49:52Z","title":"The coalescing-branching random walk on expanders and the dual epidemic process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05768","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:96068391596205768bfc3dc818ecc007d057c7c89122d63fa374cfdf71383b8e","target":"record","created_at":"2026-05-18T01:13:37Z","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":"52eae6b003c4e6732401631fa5cd8fc66aa9bd83583e7833e8c5e83a17c774ea","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-18T11:49:52Z","title_canon_sha256":"3bdc83cdcf6e2d9724c8be4e8ff3d98e17a208f30388420fadfc0f4445479b27"},"schema_version":"1.0","source":{"id":"1602.05768","kind":"arxiv","version":2}},"canonical_sha256":"3cfda7806858e356a7a49658c9dc9cc491cabef08f3ec1c184220743917f4e01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cfda7806858e356a7a49658c9dc9cc491cabef08f3ec1c184220743917f4e01","first_computed_at":"2026-05-18T01:13:37.664635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:37.664635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YCAm7nsdZEwVPg5Gr4FJHv+MKajvSvnC232Ax1+1waUVfR+fC+taAUQXi391fuyfgATRzG/PQxPe7shwNvvXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:37.665438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96068391596205768bfc3dc818ecc007d057c7c89122d63fa374cfdf71383b8e","sha256:659bf06a8c8857446a1b4a0cee76df0d1eacb34c94cb13ebd65c8c2c88400db8"],"state_sha256":"5c210b18e32f80475b738a947954832bc750ef40a733972aaba346e17af419a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHx14uy7DRNB7MsaJDTlIAvTYSmGHmDPsHXqGFDrZwoOggJj4fpqz1cGpeSbu7mmTFFOEPaaLbWRKI4sO1D0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T16:09:57.381173Z","bundle_sha256":"d4e6439c1e446703ded4e1916268a4c762ba2ed589886b2c55303262eff81331"}}