{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BWVWQT4YGYIWNYGVQDOXPVATCP","short_pith_number":"pith:BWVWQT4Y","schema_version":"1.0","canonical_sha256":"0dab684f98361166e0d580dd77d41313df3d34ee1ace98ec05eff47f8bd7012e","source":{"kind":"arxiv","id":"1909.10021","version":2},"attestation_state":"computed","paper":{"title":"Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Doina Bucur, Petter Holme","submitted_at":"2019-09-22T15:04:05Z","abstract_excerpt":"Identifying important nodes for disease spreading is a central topic in network epidemiology. We investigate how well the position of a node, characterized by standard network measures, can predict its epidemiological importance in any graph of a given number of nodes. This is in contrast to other studies that deal with the easier prediction problem of ranking nodes by their epidemic importance in given graphs. As a benchmark for epidemic importance, we calculate the exact expected outbreak size given a node as the source. We study exhaustively all graphs of a given size, so do not restrict ou"},"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":"1909.10021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2019-09-22T15:04:05Z","cross_cats_sorted":[],"title_canon_sha256":"e5b42a4e7d790730d6eddfb4f16d8dd234de3700b376765a32896a950fefd9f7","abstract_canon_sha256":"ef4cc19a5887f0650d7410abe022ab8f7e6242663ed263143e5f07816cfe307e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:59.483958Z","signature_b64":"R8UH3/A4Z1PZJ0U0SRxvOWK0a4a97jDvGgs3dILQmswD5lYyY5du7rN0wiLnUPidZs6Jiuz5rFMf6bPm3EhWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dab684f98361166e0d580dd77d41313df3d34ee1ace98ec05eff47f8bd7012e","last_reissued_at":"2026-07-05T01:21:59.483539Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:59.483539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Doina Bucur, Petter Holme","submitted_at":"2019-09-22T15:04:05Z","abstract_excerpt":"Identifying important nodes for disease spreading is a central topic in network epidemiology. We investigate how well the position of a node, characterized by standard network measures, can predict its epidemiological importance in any graph of a given number of nodes. This is in contrast to other studies that deal with the easier prediction problem of ranking nodes by their epidemic importance in given graphs. As a benchmark for epidemic importance, we calculate the exact expected outbreak size given a node as the source. We study exhaustively all graphs of a given size, so do not restrict ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.10021","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.10021/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.10021","created_at":"2026-07-05T01:21:59.483601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.10021v2","created_at":"2026-07-05T01:21:59.483601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.10021","created_at":"2026-07-05T01:21:59.483601+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWVWQT4YGYIW","created_at":"2026-07-05T01:21:59.483601+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWVWQT4YGYIWNYGV","created_at":"2026-07-05T01:21:59.483601+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWVWQT4Y","created_at":"2026-07-05T01:21:59.483601+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":226,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP","json":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP.json","graph_json":"https://pith.science/api/pith-number/BWVWQT4YGYIWNYGVQDOXPVATCP/graph.json","events_json":"https://pith.science/api/pith-number/BWVWQT4YGYIWNYGVQDOXPVATCP/events.json","paper":"https://pith.science/paper/BWVWQT4Y"},"agent_actions":{"view_html":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP","download_json":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP.json","view_paper":"https://pith.science/paper/BWVWQT4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.10021&json=true","fetch_graph":"https://pith.science/api/pith-number/BWVWQT4YGYIWNYGVQDOXPVATCP/graph.json","fetch_events":"https://pith.science/api/pith-number/BWVWQT4YGYIWNYGVQDOXPVATCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP/action/storage_attestation","attest_author":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP/action/author_attestation","sign_citation":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP/action/citation_signature","submit_replication":"https://pith.science/pith/BWVWQT4YGYIWNYGVQDOXPVATCP/action/replication_record"}},"created_at":"2026-07-05T01:21:59.483601+00:00","updated_at":"2026-07-05T01:21:59.483601+00:00"}