human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "learning network structures from contagion"):
  Abstract: In 2014, Amin, Heidari, and Kearns proved that tree networks can be learned by observing only the infected set of vertices of the contagion process under the independent cascade model, in both the active and passive query models. They also showed empirically that simple extensions of their algorithms work on sparse networks. In this work, we focus on the active model. We prove that a simple modification of Amin et al.'s algorithm works on more general classes of networks, namely (i) networks with large girth and low path growth rate, and (ii) networks with bounded degree. This also provides partial theoretical explanation for Amin et al.'s experiments on sparse networks. This work considers the contagion process under the independent cascading model.The focus is on networks with large girth and low path growth rate.If the seed sets can be chosen with queries, this type of networks can be learned.This generalizes the result of Amin, Heidari and Kearns (2014) on tree networks.Under the same model, networks with bounded degree can also be learned.

Includes members:
  Member "trace complexity of network inference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning mixtures of graphs from epidemic cascades")
  Member "submodular inference of diffusion networks from multiple trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "when less is more systematic analysis of cascade based community detection")
  Member "inferring networks of diffusion and influence":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep collaborative embedding for information cascade prediction")
  Member "on the convexity of latent social network inference":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep collaborative embedding for information cascade prediction")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LG(Machine Learning)