{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:YJLN55TGWHCV2FGZKB6ST6LONM","short_pith_number":"pith:YJLN55TG","schema_version":"1.0","canonical_sha256":"c256def666b1c55d14d9507d29f96e6b2bf21e94ab9f42b6ca6e10b90ab25cad","source":{"kind":"arxiv","id":"0909.4370","version":2},"attestation_state":"computed","paper":{"title":"Rumors in a Network: Who's the Culprit?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ML","authors_text":"Devavrat Shah, Tauhid Zaman","submitted_at":"2009-09-24T17:45:29Z","abstract_excerpt":"We provide a systematic study of the problem of finding the source of a rumor in a network. We model rumor spreading in a network with a variant of the popular SIR model and then construct an estimator for the rumor source. This estimator is based upon a novel topological quantity which we term \\textbf{rumor centrality}. We establish that this is an ML estimator for a class of graphs. We find the following surprising threshold phenomenon: on trees which grow faster than a line, the estimator always has non-trivial detection probability, whereas on trees that grow like a line, the detection pro"},"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":"0909.4370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2009-09-24T17:45:29Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"a07a3f0f8b7e6845029f483fd45ae75deb0e1ebd0b240df85911d9b78497205d","abstract_canon_sha256":"0d8fa747931fc3bac121888ed911135d1b2c1b7564f98ee5833a1e5f4606130c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:22.266335Z","signature_b64":"VtES6o5wr+Eivejcc9Ts5YfHb/zvE+fNogB5csX+BcoAWcl+IAdw/CF6tiGHwt9qpZhvWgkgMvJ+aWfpBbFLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c256def666b1c55d14d9507d29f96e6b2bf21e94ab9f42b6ca6e10b90ab25cad","last_reissued_at":"2026-05-18T04:37:22.265716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:22.265716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rumors in a Network: Who's the Culprit?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ML","authors_text":"Devavrat Shah, Tauhid Zaman","submitted_at":"2009-09-24T17:45:29Z","abstract_excerpt":"We provide a systematic study of the problem of finding the source of a rumor in a network. We model rumor spreading in a network with a variant of the popular SIR model and then construct an estimator for the rumor source. This estimator is based upon a novel topological quantity which we term \\textbf{rumor centrality}. We establish that this is an ML estimator for a class of graphs. We find the following surprising threshold phenomenon: on trees which grow faster than a line, the estimator always has non-trivial detection probability, whereas on trees that grow like a line, the detection pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4370","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":"0909.4370","created_at":"2026-05-18T04:37:22.265827+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.4370v2","created_at":"2026-05-18T04:37:22.265827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4370","created_at":"2026-05-18T04:37:22.265827+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJLN55TGWHCV","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJLN55TGWHCV2FGZ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJLN55TG","created_at":"2026-05-18T12:26:02.257875+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/YJLN55TGWHCV2FGZKB6ST6LONM","json":"https://pith.science/pith/YJLN55TGWHCV2FGZKB6ST6LONM.json","graph_json":"https://pith.science/api/pith-number/YJLN55TGWHCV2FGZKB6ST6LONM/graph.json","events_json":"https://pith.science/api/pith-number/YJLN55TGWHCV2FGZKB6ST6LONM/events.json","paper":"https://pith.science/paper/YJLN55TG"},"agent_actions":{"view_html":"https://pith.science/pith/YJLN55TGWHCV2FGZKB6ST6LONM","download_json":"https://pith.science/pith/YJLN55TGWHCV2FGZKB6ST6LONM.json","view_paper":"https://pith.science/paper/YJLN55TG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.4370&json=true","fetch_graph":"https://pith.science/api/pith-number/YJLN55TGWHCV2FGZKB6ST6LONM/graph.json","fetch_events":"https://pith.science/api/pith-number/YJLN55TGWHCV2FGZKB6ST6LONM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJLN55TGWHCV2FGZKB6ST6LONM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJLN55TGWHCV2FGZKB6ST6LONM/action/storage_attestation","attest_author":"https://pith.science/pith/YJLN55TGWHCV2FGZKB6ST6LONM/action/author_attestation","sign_citation":"https://pith.science/pith/YJLN55TGWHCV2FGZKB6ST6LONM/action/citation_signature","submit_replication":"https://pith.science/pith/YJLN55TGWHCV2FGZKB6ST6LONM/action/replication_record"}},"created_at":"2026-05-18T04:37:22.265827+00:00","updated_at":"2026-05-18T04:37:22.265827+00:00"}