{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZAMDLSOZI77RIHEGWB3WNUOVG7","short_pith_number":"pith:ZAMDLSOZ","schema_version":"1.0","canonical_sha256":"c81835c9d947ff141c86b07766d1d537df120970d1f31222cea2e613caf8eeca","source":{"kind":"arxiv","id":"1111.0583","version":2},"attestation_state":"computed","paper":{"title":"Information Spreading in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DM","authors_text":"Andrea Clementi, Luca Trevisan, Riccardo Silvestri","submitted_at":"2011-11-02T17:53:30Z","abstract_excerpt":"We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process).\n  We consider arbitrary converging Markovian dynamic graph process, that is, processes in which the topology of the graph at time $t$ depends only on its topology at time $t-1$ and which have a unique stationary distribution. The most well studied models of dynamic graphs are all Markovian and converging.\n  Under general conditions, we bound the flooding time in terms of the mixing time of the dynamic gra"},"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":"1111.0583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-02T17:53:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e14aefd1b5a08a4ac34b33631fd643b642c1b8cb7a42f4e1509b670b409b87f7","abstract_canon_sha256":"4772e7ecc8e7a0c6a85a2aa3ab82e5824e39901a84b0abeeb138b4d343b2d4bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:34.953863Z","signature_b64":"HC0bOFjN+t5ydHh3ge4DPBTXK6pPhYkzSbVd5XbsV24dOnKjYEf9TQcakD4st/E5z6GL57k6uQekC3hplBXFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c81835c9d947ff141c86b07766d1d537df120970d1f31222cea2e613caf8eeca","last_reissued_at":"2026-05-18T02:21:34.953269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:34.953269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Spreading in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DM","authors_text":"Andrea Clementi, Luca Trevisan, Riccardo Silvestri","submitted_at":"2011-11-02T17:53:30Z","abstract_excerpt":"We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process).\n  We consider arbitrary converging Markovian dynamic graph process, that is, processes in which the topology of the graph at time $t$ depends only on its topology at time $t-1$ and which have a unique stationary distribution. The most well studied models of dynamic graphs are all Markovian and converging.\n  Under general conditions, we bound the flooding time in terms of the mixing time of the dynamic gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0583","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":"1111.0583","created_at":"2026-05-18T02:21:34.953366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0583v2","created_at":"2026-05-18T02:21:34.953366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0583","created_at":"2026-05-18T02:21:34.953366+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAMDLSOZI77R","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAMDLSOZI77RIHEG","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAMDLSOZ","created_at":"2026-05-18T12:26:47.523578+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/ZAMDLSOZI77RIHEGWB3WNUOVG7","json":"https://pith.science/pith/ZAMDLSOZI77RIHEGWB3WNUOVG7.json","graph_json":"https://pith.science/api/pith-number/ZAMDLSOZI77RIHEGWB3WNUOVG7/graph.json","events_json":"https://pith.science/api/pith-number/ZAMDLSOZI77RIHEGWB3WNUOVG7/events.json","paper":"https://pith.science/paper/ZAMDLSOZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZAMDLSOZI77RIHEGWB3WNUOVG7","download_json":"https://pith.science/pith/ZAMDLSOZI77RIHEGWB3WNUOVG7.json","view_paper":"https://pith.science/paper/ZAMDLSOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0583&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAMDLSOZI77RIHEGWB3WNUOVG7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAMDLSOZI77RIHEGWB3WNUOVG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAMDLSOZI77RIHEGWB3WNUOVG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAMDLSOZI77RIHEGWB3WNUOVG7/action/storage_attestation","attest_author":"https://pith.science/pith/ZAMDLSOZI77RIHEGWB3WNUOVG7/action/author_attestation","sign_citation":"https://pith.science/pith/ZAMDLSOZI77RIHEGWB3WNUOVG7/action/citation_signature","submit_replication":"https://pith.science/pith/ZAMDLSOZI77RIHEGWB3WNUOVG7/action/replication_record"}},"created_at":"2026-05-18T02:21:34.953366+00:00","updated_at":"2026-05-18T02:21:34.953366+00:00"}