Pith. sign in

REVIEW 3 major objections 7 minor 32 references

Source Detection in Hypergraph Epidemic Dynamics using a Higher-Order Dynamic Message Passing Algorithm

T0 review · 3 major / 7 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims that adding a neighbor-infection heuristic to dynamic message passing consistently improves source detection for SI outbreaks on hypergraphs over plain likelihood maximization and three baselines.

desk verdict Useful incremental DMP for hypergraph source detection, but a definition/text mismatch in the key heuristic makes the headline gain uninterpretable until fixed. read the letter →

arxiv 2507.02523 v1 pith:VQOCPBJ6 submitted 2025-07-03 physics.soc-ph cs.SI

Qiao Ke , Naoki Masuda , Zhen Jin , Chuang Liu , Xiu-Xiu Zhan This is my paper · ORCID
classification physics.soc-phcs.SI
keywords HypergraphSourcedetectionEpidemicprocessesDynamicmessagepassingHigher-orderinteractionsMaximumlikelihoodestimationSusceptible-infectiousmodel
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Source detection—finding which node started an outbreak from a snapshot of who is infected—has mostly been solved for ordinary pairwise networks, but real contact often happens in groups captured by hypergraphs. This paper claims that for a stochastic susceptible-infectious process on a hypergraph, a message-passing estimate of each node's source likelihood can be improved by multiplying it by a local heuristic factor $\rho_i$, defined in Eq. (3) as the fraction of the candidate node's neighbours that are still susceptible at the observation time. The resulting algorithm, HDMPN, is tested against the unmodified likelihood method (HDMP), two hypergraph centrality scores, and a Monte Carlo baseline; the paper's central numerical claim is that HDMPN consistently identifies the true source more often and ranks it higher on synthetic and empirical hypergraphs. A sympathetic reader would care because group-based transmission changes epidemic dynamics, and a cheap multiplier that sharpens likelihood-based source inference is a directly usable priority-ranking tool for outbreak containment.

What carries the argument

The carrying object is the 'neighbor infection probability' $\rho_i$, defined in Eq. (3) as $|\Gamma_S(i)| / (|\Gamma_I(i)| + |\Gamma_S(i)|)$, the fraction of a node's neighbours that are still susceptible at time $T$, multiplied onto the dynamic-message-passing likelihood in Eq. (4) (though the text calls $\rho_i$ the fraction of infectious neighbours). The likelihood itself is computed through a recursion over $\theta_{k \to i}(t)$ and $\varphi_{k \to i}(t)$, the probabilities that an infection has not passed from $k$ to $i$ by time $t$, optionally with $k$ infectious, conditioned on $i$ staying susceptible; Lemma 1 and Eq. (11) close the recursion by writing $\mathrm{Prob}(q_i(t) = S \mid D_j)$ as the product of $\theta$ messages over neighbours, which is what makes the computation tractable but also assumes the hypergraph is locally tree-like. The heuristic does the work: it reweights candidates by their local snapshot context before the likelihood is compared.

What would settle it

Run the identical $R = 10^3$ comparisons with $\rho_i$ computed two ways—susceptible-neighbour fraction as in Eq. (3) and infectious-neighbour fraction as described in the text—and also on a hypergraph with a planted short loop through the true source; if the two definitions give materially different accuracy and the infectious-fraction version does not beat HDMP, the paper's stated mechanism is wrong, and if HDMPN's edge disappears on the looped hypergraph, the locally tree-like approximation is the load-bearing part.

Watch

Extended reading notes

Core claim

The paper's central claim is that the source of a hypergraph SI epidemic can be found more reliably by augmenting maximum-likelihood source inference with a per-node structural heuristic. Conditioned on a candidate source $v_i$, HDMP computes $\mathrm{Prob}(V_I \mid H, i)$ by recursive message-passing variables $\theta_{k \to i}(t)$ and $\varphi_{k \to i}(t)$, under a locally tree-like independence approximation; HDMPN then scores each infectious candidate by $\rho_i$ times that likelihood and selects $\arg\max_{v_i \in V_I}$, hoping the factor $\rho_i$ captures whether the candidate's local neighbourhood looks like a plausible infection frontier. In simulations on three synthetic hypergraph models (ERH, SFH, HCL) and three empirical hypergraphs (Algebra, Restaurant-Rev, NDC-classes), the paper reports that HDMPN consistently beats HDMP, HCC, HBC, and HMCSM in accuracy and ranking, with gains especially visible at smaller sizes, and it notes one exception: HBC ranks the true source slightly better on NDC-classes. An unresolved textual inconsistency is that Eq. (3) defines $\rho_i$ as the fraction of susceptible neighbours, whereas the abstract and conclusion describe the modulating factor as the fraction of infectious neighbours.

Load-bearing premise

The whole method leans on a heuristic score $\rho_i$ that must carry real information about who the source is, and on the approximation that the hypergraph has few short loops so that infection routes around a node can be treated independently; Eq. (3) defines $\rho_i$ as the fraction of susceptible neighbours while the text describes it as the fraction of infectious neighbours, so the mechanism is not yet pinned down.

Editorial extensions

If this is right

  • If the numerical claim holds, HDMPN gives a drop-in replacement for HDMP: the same $O(N^2 T)$ runtime plus an $O(N)$ precomputation, so the accuracy gain costs almost nothing in scaling.
  • The consistent advantage over three baselines means likelihood-based inference, not centrality, is the right backbone for hypergraph source detection in the tested regime, and a local multiplier can be a useful correction to it.
  • The improvement is largest on smaller hypergraphs (accuracy above 0.2 at $N=100$ and above 0.1 at $N=400$), so the method is best suited to early-warning or moderate-size contact systems rather than very large populations.
  • Because the algorithm assumes one source, complete final states, and a single homogeneous $\lambda$, a correct claim leaves multi-source and partial-observation variants open rather than solved.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The text's description of $\rho_i$ as the fraction of infectious neighbours conflicts with Eq. (3)'s susceptible-neighbour fraction; a direct next experiment is to implement both definitions and compare accuracy, which would either fix the mechanism or show which local signal the improvement actually comes from.
  • I would expect the multiplier's value to depend on the infection probability $\lambda$ and the stopping threshold: near the epidemic threshold, susceptible-neighbour counts may be the most informative, whereas in a large outbreak the likelihood alone may dominate, an implication the paper does not test explicitly.
  • The same modulation idea could be carried to SIR/SEIR dynamics or simplicial contagion models by replacing $\rho_i$ with an analogue computed from recovered or exposed states; the paper mentions these models as future work but does not claim the transfer.
  • If the locally tree-like approximation fails in clustered empirical hypergraphs yet HDMPN still wins, the heuristic may be acting as a robustness correction rather than as part of an exact likelihood, which would be a different and interesting explanation.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 7 minor

Summary. The manuscript proposes HDMPN, a dynamic-message-passing algorithm for source detection in SI epidemics on hypergraphs. The method multiplies the likelihood Prob(V_I|H,i) by a heuristic neighbor-infection probability rho_i, derives message-passing recursions for the hypergraph SI model, and compares against HDMP, HCC, HBC, and HMCSM on synthetic (ERH, SFH, HCL) and empirical hypergraphs using accuracy and ranking metrics.

Significance. The problem is timely and relevant: source detection in higher-order interaction structures is underexplored, and an efficient DMP-based method would be a useful tool. The paper contributes a DMP formulation for hypergraph SI dynamics, a detailed numerical protocol, and a comparison on multiple synthetic and empirical hypergraphs. If the rho_i factor is correctly specified and the numerical advantage is statistically reliable, the method offers a practical improvement for source detection in hypergraphs.

major comments (3)
  1. [Section 3, Eq. (3)] Equation (3) defines rho_i as |Gamma_S(i)|/(|Gamma_I(i)|+|Gamma_S(i)|), the fraction of susceptible neighbors, while the abstract, the motivation in Section 3, and the concluding Section 5 all describe rho_i as the fraction of infectious neighbors. Because rho_i is the only novel mechanism distinguishing HDMPN from HDMP, this contradiction is load-bearing: if the printed formula was used, the factor penalizes nodes with many infected neighbors, and the reported improvement cannot be attributed to the stated mechanism; if the infectious fraction was used, the paper does not specify the actual algorithm evaluated. The authors must correct the definition or the text, report which variant was run, and re-evaluate the comparisons.
  2. [Section 4.4, Figs. 2-4] The claim that 'HDMPN consistently outperforms all baseline methods on all hypergraphs and for all N values' is not supported by the displayed evidence: no error bars or confidence intervals are provided, and the HDMPN-HDMP differences appear small; additionally, the same section reports that on the NDC-classes hypergraph HBC is slightly superior to HDMPN, contradicting the 'all hypergraphs' statement. The authors should report standard errors or significance tests (e.g., binomial confidence intervals for accuracy), and qualify the claim to match the NDC-classes exception.
  3. [Equation (14)] Equation (14) states Prob(q_k(t)=S|D_i) = P_i^S(0) prod_{v_j in partial_i\k} theta_{j->i}(t); by Lemma 1 (Eq. (7)) the correct expression should be P_k^S(0) prod_{v_j in partial_k\i} theta_{j->k}(t). The printed version swaps the roles of i and k; as written, the recursion cannot be reproduced. Please correct the equation and check the subsequent steps for the same index swap.
minor comments (7)
  1. [Section 4.4] Tuning alpha for HCC/HBC on the same test data (alpha chosen to maximize accuracy for each dataset) should be explicitly labeled as an in-sample optimization; this is favorable to the paper's claims but should be stated for methodological clarity.
  2. [Fig. 4 caption] The caption entry '(l) HCL, (N, Theta) = (40, 2.0)' appears to be a typo for (400, 2.0); please check all N values in the captions.
  3. [Figures 3 and 4 / text] The HCL power-law exponent is denoted by both Theta (in figure captions) and gamma (in the text); please use a single notation throughout.
  4. [Abstract and Introduction] The abstract says 'in most cases' while the introduction says 'consistently outperforms'; align the strength of the claims with the actual results, including the NDC-classes exception.
  5. [General] No code or data repository is linked; since the numerical protocol is detailed, providing code would strengthen reproducibility.
  6. [Eq. (8)] Equation (8) writes Prob(sum ... | D_j) without specifying that the quantity is the probability that the sum equals zero; please clarify this notation.
  7. [Section 1 and Section 3] The phrase 'higher-order neighbor infection probability' in Section 1 differs from 'neighbor infection probability' used in Section 3; unify the terminology.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the DMP likelihood computation is self-contained; the Eq. (3) susceptible/infectious mismatch is a correctness issue, not a circular one.

full rationale

The central derivation of Prob(V_I|H,i) is a self-contained dynamic message-passing computation: Eqs. (5)-(17) recursively define the probabilities P_k^S and P_k^I from the hypergraph structure, the SI dynamics parameters, and the assumed source, and Eq. (2) assembles them into a likelihood. This computation does not assume the source it is trying to find. The multiplicative factor rho_i in Eq. (3) is a fixed heuristic function of the observed final states, not a fitted parameter tuned to test outcomes, and the algorithm is evaluated on source identities that are not used to fit rho_i; thus the performance comparison is not forced by construction. Self-citations (Xie et al. 2023; Feng et al. 2024; Nakajima et al. 2021) are used only to define synthetic hypergraph generators and are not load-bearing for the source-detection claim. The manuscript does contain an internal inconsistency: Eq. (3) defines rho_i as the susceptible-neighbor fraction while the abstract, Sec. 3, and Sec. 5 describe it as the infectious-neighbor fraction, and Eq. (14) appears to have a swapped index; these are correctness and interpretability concerns that should be fixed, but they are not cases where a prediction reduces to its own input.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The central algorithm uses no fitted parameters; lambda, T, and the hypergraph are inputs. The heuristic factor rho_i is the only ad hoc element. The derivation relies on a tree-like independence assumption that is likely violated in empirical hypergraphs.

free parameters (1)
  • alpha (tuning parameter for HCC/HBC baselines) = grid-selected per hypergraph from {0.1, 0.101, ..., 3.0} with increment 0.001
    Used to give centrality baselines their best possible accuracy and ranking; it is not part of HDMPN but affects the comparison.
assumptions (4)
  • domain assumption The hypergraph is locally tree-like, so states of neighbors of a node are independent conditioned on that node.
    Invoked in Lemma 1 and Eq. (11); the paper states this implicitly requires short loops to be rare, but it is applied to empirical hypergraphs.
  • domain assumption The SI dynamics follow the exact protocol: each infectious node selects one incident hyperedge uniformly and infects each susceptible node in it with probability lambda.
    Section 2.2; the message-passing equations, especially eta_ki, assume this precise mechanism.
  • domain assumption The source node is in V_I and the full infection state at time T is observed.
    Eqs. (1)-(2) restrict candidates to infectious nodes and use the complete final snapshot; partial observability is listed as future work.
  • ad hoc to paper rho_i as defined in Eq. (3) is a valid source-likelihood modulation.
    The factor is introduced by intuition, with no derivation, and the text misdescribes it as the fraction of infectious neighbors.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Source Detection in Hypergraph Epidemic Dynamics using a Higher-Order Dynamic Message Passing Algorithm." pith.science (2026). https://pith.science/paper/VQOCPBJ6

@misc{pith2026250702523,
  author       = {Pith},
  title        = {Pith review of: Source Detection in Hypergraph Epidemic Dynamics using a Higher-Order Dynamic Message Passing Algorithm},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VQOCPBJ6}},
  note         = {Machine review of arXiv:2507.02523}
}
read the original abstract

Source detection is crucial for capturing the dynamics of real-world infectious diseases and informing effective containment strategies. Most existing approaches to source detection focus on conventional pairwise networks, whereas recent efforts on both mathematical modeling and analysis of contact data suggest that higher-order (e.g., group) interactions among individuals may both account for a large fraction of infection events and change our understanding of how epidemic spreading proceeds in empirical populations. In the present study, we propose a message-passing algorithm, called the HDMPN, for source detection for a stochastic susceptible-infectious dynamics on hypergraphs. By modulating the likelihood maximization method by the fraction of infectious neighbors, HDMPN aims to capture the influence of higher-order structures and do better than the conventional likelihood maximization. We numerically show that, in most cases, HDMPN outperforms benchmarks including the likelihood maximization method without modification.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

32 extracted references · 19 canonical work pages

  1. [1]

    Physical Review Letters 114(24), 248701 (2015) https://doi.org/10.1103/PhysRevLett.114.248701

    Antulov-Fantulin, N., Lanˇ ci´ c, A., ˇSmuc, T., ˇStefanˇ ci´ c, H., ˇSiki´ c, M.: Identification of patient zero in static and temporal networks: Ro bust- ness and limitations. Physical Review Letters 114(24), 248701 (2015) https://doi.org/10.1103/PhysRevLett.114.248701

    work page doi:10.1103/physrevlett.114.248701 2015

  2. [2]

    EPJ Data Science 9(1), 16 (2020) https://doi.org/10.1140/epjds/s13688-020-00231-0

    Aksoy, S.G., Joslyn, C., Marrero, C.O., Praggastis, B., Purvine, E.: Hy pernet- work science via high-order hypergraph walks. EPJ Data Science 9(1), 16 (2020) https://doi.org/10.1140/epjds/s13688-020-00231-0

    work page doi:10.1140/epjds/s13688-020-00231-0 2020

  3. [3]

    arXiv:2006.05645 (2020)

    Amburg, I., Veldt, N., Benson, A.R.: Fair clustering for diverse and ex perienced groups. arXiv:2006.05645 (2020). https://doi.org/10.48550/arXiv.2006.05645

    arXiv doi:10.48550/arxiv.2006.05645 2020

  4. [4]

    Proceedings of the Nation al Academy of Sciences of the United States of America 115(48), 11221–11230 (2018) https://doi.org/10.1073/pnas.1800683115

    Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Sim plicial closure and higher-order link prediction. Proceedings of the Nation al Academy of Sciences of the United States of America 115(48), 11221–11230 (2018) https://doi.org/10.1073/pnas.1800683115

    doi:10.1073/pnas.1800683115 2018

  5. [5]

    Physics Reports 874, 1–92 (2020) https://doi.org/10.1016/j.physrep.2020.05.004

    Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Pata nia, A., Young, J.-G., Petri, G.: Networks beyond pairwise interactions: Structure and dynamics. Physics Reports 874, 1–92 (2020) https://doi.org/10.1016/j.physrep.2020.05.004

    doi:10.1016/j.physrep.2020.05.004 2020

  6. [6]

    Physical Review Letters 132(7), 077401 (2024) https://doi.org/10.1103/PhysRevLett.132.077401

    Burgio, G., G´ omez, S., Arenas, A.: Triadic approximation reveals the role of interaction overlap on the spread of complex contagions on higher-order networks. Physical Review Letters 132(7), 077401 (2024) https://doi.org/10.1103/PhysRevLett.132.077401

    doi:10.1103/physrevlett.132.077401 2024

  7. [7]

    Cambridge University Press, Cambridge (2021)

    Bianconi, G.: Higher-order Networks. Cambridge University Press, Cambridge (2021)

    work page 2021

  8. [8]

    Nature Physics 20(7), 1204–1210 (2024) https://doi.org/10.1038/s41567-024-02471-7 17

    Birello, P., Re Fiorentin, M., Wang, B., Colizza, V., Valdano, E.: Esti- mates of the reproduction ratio from epidemic surveillance may be bia sed in spatially structured populations. Nature Physics 20(7), 1204–1210 (2024) https://doi.org/10.1038/s41567-024-02471-7 17

    doi:10.1038/s41567-024-02471-7 2024

Show all 32 references
  1. [9]

    In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing , pp

    Brightwell, G., Winkler, P.: Counting linear extensions is #p-complete. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing , pp. 175–181 (1991). https://doi.org/10.1145/103418.103441

    1991

  2. [10]

    Physical Review E 84(5), 056105 (2011) https://doi.org/10.1103/PhysRevE.84.056105

    Comin, C.H., Fontoura Costa, L.: Identifying the starting point of a s pread- ing process in complex networks. Physical Review E 84(5), 056105 (2011) https://doi.org/10.1103/PhysRevE.84.056105

    2011 doi

  3. [11]

    I n: Proceed- ings of the AAAI Conference on Artificial Intelligence, vol

    Cheng, L., Zhu, P., Tang, K., Gao, C., Wang, Z.: GIN-SD: source dete ction in graphs with incomplete nodes via positional encoding and attentive fusion. I n: Proceed- ings of the AAAI Conference on Artificial Intelligence, vol. 38, pp. 5 5–63 (2024). https://doi.org/10.1609/aaa...

    2024 doi

  4. [12]

    Chaos 34(8), 083120 (2024) https://doi.org/10.1063/5.0221267

    Feng, R., Xu, T., Xie, X., Zhang, Z.-K., Liu, C., Zhan, X.-X.: A hyper- distance-based method for hypernetwork comparison. Chaos 34(8), 083120 (2024) https://doi.org/10.1063/5.0221267

    2024 doi

  5. [13]

    Nature Communications 10(1), 2485 (2019) https://doi.org/10.1038/s41467-019-10431-6

    Iacopini, I., Petri, G., Barrat, A., Latora, V.: Simplicial models of social contagion. Nature Communications 10(1), 2485 (2019) https://doi.org/10.1038/s41467-019-10431-6

    2019 doi

  6. [14]

    IEEE Tran s- actions on Information Forensics and Security 10(12), 2616–2626 (2015) https://doi.org/10.1109/TIFS.2015.2469256

    Jiang, J., Wen, S., Yu, S., Xiang, Y., Zhou, W.: K-center: An approach on the multi-source identification of information diffusion. IEEE Tran s- actions on Information Forensics and Security 10(12), 2616–2626 (2015) https://doi.org/10.1109/TIFS.2015.2469256

    2015

  7. [15]

    Na ture Physics 6(11), 888–893 (2010) https://doi.org/10.1038/nphys1746

    Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Na ture Physics 6(11), 888–893 (2010) https://doi.org/10.1038/nphys1746

    2010 doi

  8. [16]

    Journal of Complex Networks 11(6), 044 (2023) https://doi.org/10.1093/comnet/cnad044

    Kiss, I.Z., Iacopini, I., Simon, P.L., Georgiou, N.: Insights from exact s ocial contagion dynamics on networks with higher-order structures. Journal of Complex Networks 11(6), 044 (2023) https://doi.org/10.1093/comnet/cnad044

    2023 doi

  9. [17]

    Princeton University Press, Princeton, NJ (2008)

    Keeling, M.J., Rohani, P.: Modeling Infectious Diseases in Humans and An imals. Princeton University Press, Princeton, NJ (2008)

    2008

  10. [18]

    MedRxiv, 2021–0 3 (2021) https://doi.org/10.1101/2021.03.19.21253974

    Lu, D., Aleta, A., Ajelli, M., Pastor-Satorras, R., Vespignani, A., More no, Y.: Data-driven estimate of SARS-CoV-2 herd immunity threshold in p opu- lations with individual contact pattern variations. MedRxiv, 2021–0 3 (2021) https://doi.org/10.1101/2021.03.19.21253974

    2021 doi

  11. [19]

    Chaos, Solitons & Frac tals 173, 18 113657 (2023) https://doi.org/10.1016/j.chaos.2023.113657

    Liu, L., Feng, M., Xia, C., Zhao, D., Perc, M.: Epidemic trajectories and awareness diffusion among unequals in simplicial complexes. Chaos, Solitons & Frac tals 173, 18 113657 (2023) https://doi.org/10.1016/j.chaos.2023.113657

    2023

  12. [20]

    Chaos 30(10), 103117 (2020) https://doi.org/10.1063/5.0020034

    Landry, N.W., Restrepo, J.G.: The effect of heterogeneity on hyper graph contagion models. Chaos 30(10), 103117 (2020) https://doi.org/10.1063/5.0020034

    2020 doi

  13. [21]

    Nature Physics 15(4), 313–320 (2019) https://doi.org/10.1038/s41567-019-0459-y

    Lambiotte, R., Rosvall, M., Scholtes, I.: From networks to optimal hig her- order models of complex systems. Nature Physics 15(4), 313–320 (2019) https://doi.org/10.1038/s41567-019-0459-y

    2019 doi

  14. [23]

    Physical Review Letters 109(6), 068702 (2012) https://doi.org/10.1103/PhysRevLett.109.068702

    Pinto, P.C., Thiran, P., Vetterli, M.: Locating the source of diffusion in large-scale networks. Physical Review Letters 109(6), 068702 (2012) https://doi.org/10.1103/PhysRevLett.109.068702

    2012 doi

  15. [24]

    Chaos 33(8), 083125 (2023) https://doi.org/10.1063/5.0152859

    Peng, S.-L., Wang, H.-J., Peng, H., Zhu, X.-B., Li, X., Han, J., Zhao, D., H u, Z.-L.: NLSI: An innovative method to locate epidemic sources on the SEIR p ropagation model. Chaos 33(8), 083125 (2023) https://doi.org/10.1063/5.0152859

    2023 doi

  16. [25]

    IEEE Transactions on Network Science and Engineering 10(2), 658–674 (2022) https://doi.org/10.1109/TNSE.2022.3217185

    Surana, A., Chen, C., Rajapakse, I.: Hypergraph similarity measure s. IEEE Transactions on Network Science and Engineering 10(2), 658–674 (2022) https://doi.org/10.1109/TNSE.2022.3217185

    2022

  17. [26]

    Physica A 495, 475–487 (2018) https://doi.org/10.1016/j.physa.2017.12.108

    Suo, Q., Guo, J.-L., Shen, A.-Z.: Information spreading dynamics in hy pernetworks. Physica A 495, 475–487 (2018) https://doi.org/10.1016/j.physa.2017.12.108

    2018 doi

  18. [27]

    SI AM Journal on Computing 8(3), 410–421 (1979) https://doi.org/10.1137/0208032

    Valiant, L.G.: The complexity of enumeration and reliability problems. SI AM Journal on Computing 8(3), 410–421 (1979) https://doi.org/10.1137/0208032

    1979 doi

  19. [28]

    Journa l of Medical Internet Research 22(6), 20021 (2020) https://doi.org/10.2196/20021

    Wang, P.-W., Lu, W.-H., Ko, N.-Y., Chen, Y.-L., Li, D.-J., Chang, Y.-P., Yen , C.-F.: COVID-19-related information sources and the relationship with co nfidence in peo- ple coping with COVID-19: Facebook survey study in Taiwan. Journa l of Medical Internet Research 22(6), 20021...

    2020 doi

  20. [29]

    Knowledge-Ba sed Systems 226, 106613 (2021) https://doi.org/10.1016/j.knosys.2020.106613

    Wang, Z., Sun, C., Rui, X., Philip, S.Y., Sun, L.: Localization of multiple diffus ion sources based on overlapping community detection. Knowledge-Ba sed Systems 226, 106613 (2021) https://doi.org/10.1016/j.knosys.2020.106613

    2021

  21. [30]

    Reports on Progress in Physics 80(3), 036603 (2017) https://doi.org/10.1088/1361-6633/aa5398

    Wang, W., Tang, M., Stanley, H.E., Braunstein, L.A.: Unification of theo retical approaches for epidemic spreading on complex networks. Reports on Progress in Physics 80(3), 036603 (2017) https://doi.org/10.1088/1361-6633/aa5398

    2017 doi

  22. [31]

    Information Processing & Management 60(2), 103161 (2023) https://doi.org/10.1016/j.ipm.2022.103161 19

    Xie, M., Zhan, X.-X., Liu, C., Zhang, Z.-K.: An efficient adaptive degree- based heuris- tic algorithm for influence maximization in hypergraphs. Information Processing & Management 60(2), 103161 (2023) https://doi.org/10.1016/j.ipm.2022.103161 19

    2023

  23. [32]

    Chaos, Solitons & Fractals 187, 115457 (2024) https://doi.org/10.1016/j.chaos.2024.115457

    Yu, X., Nie, Y., Li, W., Luo, G., Lin, T., Wang, W.: Source inference for mis infor- mation spreading on hypergraphs. Chaos, Solitons & Fractals 187, 115457 (2024) https://doi.org/10.1016/j.chaos.2024.115457

    2024

  24. [33]

    Computational Social Networks 1(3), 1–21 (2014) https://doi.org/10.1109/TNSE.2021.3133380 20

    Zhu, K., Ying, L.: A robust information source estimator with sparse observations. Computational Social Networks 1(3), 1–21 (2014) https://doi.org/10.1109/TNSE.2021.3133380 20

    2014

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.