{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WGOJFB7SIM757EO4Y2TWVI2KHH","short_pith_number":"pith:WGOJFB7S","schema_version":"1.0","canonical_sha256":"b19c9287f2433fdf91dcc6a76aa34a39c9a929fabff147a5875def382af9aab8","source":{"kind":"arxiv","id":"1208.2936","version":1},"attestation_state":"computed","paper":{"title":"Forwarding Without Repeating: Efficient Rumor Spreading in Bounded-Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Michael Rabbat, Vincent Gripon, Vitaly Skachek","submitted_at":"2012-08-14T18:16:36Z","abstract_excerpt":"We study a gossip protocol called forwarding without repeating (FWR). The objective is to spread multiple rumors over a graph as efficiently as possible. FWR accomplishes this by having nodes record which messages they have forwarded to each neighbor, so that each message is forwarded at most once to each neighbor. We prove that FWR spreads a rumor over a strongly connected digraph, with high probability, in time which is within a constant factor of optimal for digraphs with bounded out-degree. Moreover, on digraphs with bounded out-degree and bounded number of rumors, the number of transmissi"},"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":"1208.2936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-14T18:16:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"790c56c98e0a55d05c903c0e2495f6f6eb3d1c1c07cfff78e7375e3e43334a50","abstract_canon_sha256":"fa2aa9b54afe65cef1a4dea70aadb504a967c24aa91504a4340005fc2ec7f678"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:46.872880Z","signature_b64":"WhnS8uFjUsRJgyLW880xYyUyQj7X3dYq6z/5d4votk9n+3t+M42/eOCiFT9R/u1W3Qmey8Sq5pnyRsyKC16iAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b19c9287f2433fdf91dcc6a76aa34a39c9a929fabff147a5875def382af9aab8","last_reissued_at":"2026-05-18T03:48:46.872147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:46.872147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forwarding Without Repeating: Efficient Rumor Spreading in Bounded-Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Michael Rabbat, Vincent Gripon, Vitaly Skachek","submitted_at":"2012-08-14T18:16:36Z","abstract_excerpt":"We study a gossip protocol called forwarding without repeating (FWR). The objective is to spread multiple rumors over a graph as efficiently as possible. FWR accomplishes this by having nodes record which messages they have forwarded to each neighbor, so that each message is forwarded at most once to each neighbor. We prove that FWR spreads a rumor over a strongly connected digraph, with high probability, in time which is within a constant factor of optimal for digraphs with bounded out-degree. Moreover, on digraphs with bounded out-degree and bounded number of rumors, the number of transmissi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2936","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.2936","created_at":"2026-05-18T03:48:46.872258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2936v1","created_at":"2026-05-18T03:48:46.872258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2936","created_at":"2026-05-18T03:48:46.872258+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGOJFB7SIM75","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGOJFB7SIM757EO4","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGOJFB7S","created_at":"2026-05-18T12:27:25.539911+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/WGOJFB7SIM757EO4Y2TWVI2KHH","json":"https://pith.science/pith/WGOJFB7SIM757EO4Y2TWVI2KHH.json","graph_json":"https://pith.science/api/pith-number/WGOJFB7SIM757EO4Y2TWVI2KHH/graph.json","events_json":"https://pith.science/api/pith-number/WGOJFB7SIM757EO4Y2TWVI2KHH/events.json","paper":"https://pith.science/paper/WGOJFB7S"},"agent_actions":{"view_html":"https://pith.science/pith/WGOJFB7SIM757EO4Y2TWVI2KHH","download_json":"https://pith.science/pith/WGOJFB7SIM757EO4Y2TWVI2KHH.json","view_paper":"https://pith.science/paper/WGOJFB7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2936&json=true","fetch_graph":"https://pith.science/api/pith-number/WGOJFB7SIM757EO4Y2TWVI2KHH/graph.json","fetch_events":"https://pith.science/api/pith-number/WGOJFB7SIM757EO4Y2TWVI2KHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGOJFB7SIM757EO4Y2TWVI2KHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGOJFB7SIM757EO4Y2TWVI2KHH/action/storage_attestation","attest_author":"https://pith.science/pith/WGOJFB7SIM757EO4Y2TWVI2KHH/action/author_attestation","sign_citation":"https://pith.science/pith/WGOJFB7SIM757EO4Y2TWVI2KHH/action/citation_signature","submit_replication":"https://pith.science/pith/WGOJFB7SIM757EO4Y2TWVI2KHH/action/replication_record"}},"created_at":"2026-05-18T03:48:46.872258+00:00","updated_at":"2026-05-18T03:48:46.872258+00:00"}