{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HT62PADILDRVNJ5ESZMMTXE4YS","short_pith_number":"pith:HT62PADI","schema_version":"1.0","canonical_sha256":"3cfda7806858e356a7a49658c9dc9cc491cabef08f3ec1c184220743917f4e01","source":{"kind":"arxiv","id":"1602.05768","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.05768","created_at":"2026-05-18T01:13:37.664768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05768v2","created_at":"2026-05-18T01:13:37.664768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05768","created_at":"2026-05-18T01:13:37.664768+00:00"},{"alias_kind":"pith_short_12","alias_value":"HT62PADILDRV","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HT62PADILDRVNJ5E","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HT62PADI","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS","json":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS.json","graph_json":"https://pith.science/api/pith-number/HT62PADILDRVNJ5ESZMMTXE4YS/graph.json","events_json":"https://pith.science/api/pith-number/HT62PADILDRVNJ5ESZMMTXE4YS/events.json","paper":"https://pith.science/paper/HT62PADI"},"agent_actions":{"view_html":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS","download_json":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS.json","view_paper":"https://pith.science/paper/HT62PADI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05768&json=true","fetch_graph":"https://pith.science/api/pith-number/HT62PADILDRVNJ5ESZMMTXE4YS/graph.json","fetch_events":"https://pith.science/api/pith-number/HT62PADILDRVNJ5ESZMMTXE4YS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/action/storage_attestation","attest_author":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/action/author_attestation","sign_citation":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/action/citation_signature","submit_replication":"https://pith.science/pith/HT62PADILDRVNJ5ESZMMTXE4YS/action/replication_record"}},"created_at":"2026-05-18T01:13:37.664768+00:00","updated_at":"2026-05-18T01:13:37.664768+00:00"}