{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QMFPWBQIE6KKZBAOPEFP7OBN6T","short_pith_number":"pith:QMFPWBQI","schema_version":"1.0","canonical_sha256":"830afb06082794ac840e790affb82df4ea7077f224e2e22c1ad8804a4e2ef4a2","source":{"kind":"arxiv","id":"1801.00316","version":2},"attestation_state":"computed","paper":{"title":"Pull and Push&Pull in Random Evolving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Rami Daknama","submitted_at":"2017-12-31T17:03:54Z","abstract_excerpt":"The Push, the Pull and the Push&Pull algorithms are well-studied rumor spreading protocols. In all three, in the beginning one node of a graph is informed. In the Push setting, every round every informed node chooses a neighbor uniformly at random and, if it is not already informed anyway, informs it. In the Pull setting, each round each uninformed node chooses a neighbor uniformly at random and asks it for the rumor; if the asked neighbor is informed, now also the asking node is informed. Push&Pull is a combination of Push and Pull: In each round, each node picks a neighbor uniformly at rando"},"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":"1801.00316","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-31T17:03:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"81945a6aba0e73534790379052a6ff9acebe127a74367f575295f3e6f7f5522d","abstract_canon_sha256":"4175c55d5fe922970064dde6d02638ad84af813af6f5d305ac82803248d95ccb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:28.545099Z","signature_b64":"OVlcAVfC60yEYtjLaNEqNVYzJzr69GrAkWk43LybzJcdLpMlGnMrwvzwRAG5DlnXwdpXYqyURPRFbiodAWH0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"830afb06082794ac840e790affb82df4ea7077f224e2e22c1ad8804a4e2ef4a2","last_reissued_at":"2026-05-18T00:24:28.544690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:28.544690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pull and Push&Pull in Random Evolving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Rami Daknama","submitted_at":"2017-12-31T17:03:54Z","abstract_excerpt":"The Push, the Pull and the Push&Pull algorithms are well-studied rumor spreading protocols. In all three, in the beginning one node of a graph is informed. In the Push setting, every round every informed node chooses a neighbor uniformly at random and, if it is not already informed anyway, informs it. In the Pull setting, each round each uninformed node chooses a neighbor uniformly at random and asks it for the rumor; if the asked neighbor is informed, now also the asking node is informed. Push&Pull is a combination of Push and Pull: In each round, each node picks a neighbor uniformly at rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00316","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":"1801.00316","created_at":"2026-05-18T00:24:28.544750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00316v2","created_at":"2026-05-18T00:24:28.544750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00316","created_at":"2026-05-18T00:24:28.544750+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMFPWBQIE6KK","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMFPWBQIE6KKZBAO","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMFPWBQI","created_at":"2026-05-18T12:31:39.905425+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/QMFPWBQIE6KKZBAOPEFP7OBN6T","json":"https://pith.science/pith/QMFPWBQIE6KKZBAOPEFP7OBN6T.json","graph_json":"https://pith.science/api/pith-number/QMFPWBQIE6KKZBAOPEFP7OBN6T/graph.json","events_json":"https://pith.science/api/pith-number/QMFPWBQIE6KKZBAOPEFP7OBN6T/events.json","paper":"https://pith.science/paper/QMFPWBQI"},"agent_actions":{"view_html":"https://pith.science/pith/QMFPWBQIE6KKZBAOPEFP7OBN6T","download_json":"https://pith.science/pith/QMFPWBQIE6KKZBAOPEFP7OBN6T.json","view_paper":"https://pith.science/paper/QMFPWBQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00316&json=true","fetch_graph":"https://pith.science/api/pith-number/QMFPWBQIE6KKZBAOPEFP7OBN6T/graph.json","fetch_events":"https://pith.science/api/pith-number/QMFPWBQIE6KKZBAOPEFP7OBN6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMFPWBQIE6KKZBAOPEFP7OBN6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMFPWBQIE6KKZBAOPEFP7OBN6T/action/storage_attestation","attest_author":"https://pith.science/pith/QMFPWBQIE6KKZBAOPEFP7OBN6T/action/author_attestation","sign_citation":"https://pith.science/pith/QMFPWBQIE6KKZBAOPEFP7OBN6T/action/citation_signature","submit_replication":"https://pith.science/pith/QMFPWBQIE6KKZBAOPEFP7OBN6T/action/replication_record"}},"created_at":"2026-05-18T00:24:28.544750+00:00","updated_at":"2026-05-18T00:24:28.544750+00:00"}