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 "k connectivity of random graphs and random geometric graphs in node fault model"):
  Abstract: k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes, which is known as the node fault model. In this paper, we investigate k-connectivity of random graphs in the node fault model by evaluating the network breakdown probability, i.e., the disconnectivity probability of random graphs after stochastic node removals. Using the notion of a strongly typical set, we obtain universal asymptotic upper and lower bounds of the network breakdown probability. The bounds are applicable both to random graphs and to random geometric graphs. We then consider three representative random graph ensembles: the Erdos-Renyi random graph as the simplest case, the random intersection graph for WSNs with random key predistribution schemes, and the random geometric graph as a model of WSNs generated by random sensor node deployment. The bounds unveil the existence of the phase transition of the network breakdown probability for those ensembles.

Includes members:
  Member "analysis of breakdown probability of wireless sensor networks with unreliable relay nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "connectivity of ad hoc wireless networks with node faults")
  Member "on the strengths of connectivity and robustness in general random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "k connectivity in random key graphs with unreliable links")
  Member "component evolution in general random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on connectivity and robustness in random intersection graphs")

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.IT(Information Theory)