human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "identification of source of rumors in social networks with incomplete information"
  Abstract: Rumor source identification in large social networks has received significant attention lately. Most recent works deal with the scale of the problem by observing a subset of the nodes in the network, called sensors, to estimate the source. This paper addresses the problem of locating the source of a rumor in large social networks where some of these sensor nodes have failed. We estimate the missing information about the sensors using doubly non-negative (DN) matrix completion and compressed sensing techniques. This is then used to identify the actual source by using a maximum likelihood estimator we developed earlier, on a large data set from Sina Weibo. Results indicate that the estimation techniques result in almost as good a performance of the ML estimator as for the network for which complete information is available. To the best of our knowledge, this is the first research work on source identification with incomplete information in social networks.

Connected through hyperedge HE-1 (induced by source paper "back to the source an online approach for sensor placement and source localization"):
  with members:
    - "observer placement for source localization the effect of budgets and transmission variance"
    - "back to the past source identification in diffusion networks from partially observed cascades"
    - "approximability of the minimum weighted doubly resolving set problem"
    - "how to identify an infection source with limited observations"
    - "a robust information source estimator with sparse observations"
    - "rooting out the rumor culprit from suspects"
    - "information source detection in the sir model a sample path based approach"
    - "locating the source of diffusion in large scale networks"

Connected through hyperedge HE-2 (induced by source paper "observer placement for source localization the effect of budgets and transmission variance"):
  with members:
    - "the behavior of epidemics under bounded susceptibility"
    - "approximability of the minimum weighted doubly resolving set problem"
    - "how to identify an infection source with limited observations"
    - "spy vs spy rumor source obfuscation"
    - "rooting out the rumor culprit from suspects"
    - "information source detection in the sir model a sample path based approach"
    - "locating the source of diffusion in large scale networks"

Question: Please tell me which class the center node 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.SI(Social and Information Networks)