{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YWT7P74GL6WD4R7DXXHAFBTOYN","short_pith_number":"pith:YWT7P74G","schema_version":"1.0","canonical_sha256":"c5a7f7ff865fac3e47e3bdce02866ec36a62c39ff67cfc628bc537935bf0f03b","source":{"kind":"arxiv","id":"1103.0741","version":1},"attestation_state":"computed","paper":{"title":"Information Spreading in Stationary Markovian Evolving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri","submitted_at":"2011-03-03T17:33:18Z","abstract_excerpt":"Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network scenarios.\n  We study the speed of information spreading in the \"stationary phase\" by analyzing the completion time of the \"flooding mechanism\". We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties.\n  We apply our theorem in two natural and relevant cases o"},"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":"1103.0741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-03T17:33:18Z","cross_cats_sorted":[],"title_canon_sha256":"0320322db3f9a9e16e589ed1878a8c2eb52ba4f9fc3cc08c443258e061994768","abstract_canon_sha256":"ff2756c2d18282622b5da28c4906f80bc08504dc5e379eff1a1297ec12593246"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:27.391478Z","signature_b64":"M9X+HsMI12aOJ6tlApCJZzlRfBe8L3kBr3X8bR90Uc5jimdd9dehdCOLoIT1B8QcYppByuAtt85hieOmKOrTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5a7f7ff865fac3e47e3bdce02866ec36a62c39ff67cfc628bc537935bf0f03b","last_reissued_at":"2026-05-18T04:27:27.391009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:27.391009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Spreading in Stationary Markovian Evolving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri","submitted_at":"2011-03-03T17:33:18Z","abstract_excerpt":"Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network scenarios.\n  We study the speed of information spreading in the \"stationary phase\" by analyzing the completion time of the \"flooding mechanism\". We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties.\n  We apply our theorem in two natural and relevant cases o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0741","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":"1103.0741","created_at":"2026-05-18T04:27:27.391076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0741v1","created_at":"2026-05-18T04:27:27.391076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0741","created_at":"2026-05-18T04:27:27.391076+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWT7P74GL6WD","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWT7P74GL6WD4R7D","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWT7P74G","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/YWT7P74GL6WD4R7DXXHAFBTOYN","json":"https://pith.science/pith/YWT7P74GL6WD4R7DXXHAFBTOYN.json","graph_json":"https://pith.science/api/pith-number/YWT7P74GL6WD4R7DXXHAFBTOYN/graph.json","events_json":"https://pith.science/api/pith-number/YWT7P74GL6WD4R7DXXHAFBTOYN/events.json","paper":"https://pith.science/paper/YWT7P74G"},"agent_actions":{"view_html":"https://pith.science/pith/YWT7P74GL6WD4R7DXXHAFBTOYN","download_json":"https://pith.science/pith/YWT7P74GL6WD4R7DXXHAFBTOYN.json","view_paper":"https://pith.science/paper/YWT7P74G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0741&json=true","fetch_graph":"https://pith.science/api/pith-number/YWT7P74GL6WD4R7DXXHAFBTOYN/graph.json","fetch_events":"https://pith.science/api/pith-number/YWT7P74GL6WD4R7DXXHAFBTOYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWT7P74GL6WD4R7DXXHAFBTOYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWT7P74GL6WD4R7DXXHAFBTOYN/action/storage_attestation","attest_author":"https://pith.science/pith/YWT7P74GL6WD4R7DXXHAFBTOYN/action/author_attestation","sign_citation":"https://pith.science/pith/YWT7P74GL6WD4R7DXXHAFBTOYN/action/citation_signature","submit_replication":"https://pith.science/pith/YWT7P74GL6WD4R7DXXHAFBTOYN/action/replication_record"}},"created_at":"2026-05-18T04:27:27.391076+00:00","updated_at":"2026-05-18T04:27:27.391076+00:00"}