REVIEW 4 cited by
Finding Patient Zero: Learning Contagion Source with Graph Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Locating the source of an epidemic, or patient zero (P0), can provide critical insights into the infection's transmission course and allow efficient resource allocation. Existing methods use graph-theoretic centrality measures and expensive message-passing algorithms, requiring knowledge of the underlying dynamics and its parameters. In this paper, we revisit this problem using graph neural networks (GNNs) to learn P0. We establish a theoretical limit for the identification of P0 in a class of epidemic models. We evaluate our method against different epidemic models on both synthetic and a real-world contact network considering a disease with history and characteristics of COVID-19. % We observe that GNNs can identify P0 close to the theoretical bound on accuracy, without explicit input of dynamics or its parameters. In addition, GNN is over 100 times faster than classic methods for inference on arbitrary graph topologies. Our theoretical bound also shows that the epidemic is like a ticking clock, emphasizing the importance of early contact-tracing. We find a maximum time after which accurate recovery of the source becomes impossible, regardless of the algorithm used.
Forward citations
Cited by 4 Pith papers
-
SourceDetMamba: A Graph-aware State Space Model for Source Detection in Sequential Hypergraphs
SourceDetMamba detects rumor sources by feeding reverse-ordered hypergraph snapshots through a Mamba state-space model with a graph-aware state update, and reports large accuracy gains over baselines on eight datasets.
-
HyperDet: Source Detection in Hypergraphs via Interactive Relationship Construction and Feature-rich Attention Fusion
HyperDet detects rumor sources in hypergraphs by combining static topology, dynamic interaction hyperedges, autoencoder feature enrichment, and multi-head attention, outperforming pairwise baselines on eight simulated...
-
Learning and Testing Inverse Statistical Problems For Interacting Systems Undergoing Phase Transition
A reproducible pedagogical comparison showing pseudo-likelihood inference matches or beats mean-field inversion across phase-transitioning Ising, Potts, and Blume-Capel models.
-
Accelerating Sparse Graph Neural Networks with Tensor Core Optimization
FTC-GNN is a TC-GNN-style framework that combines Tensor Cores and CUDA Cores for sparse GNN kernels, but its claimed AGNN speedup over DGL is contradicted by its own tables.
Discussion (0). Continue with ORCID to comment.