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 "connectivity of large scale networks distribution of isolated nodes"):
  Abstract: Connectivity is one of the most fundamental properties of wireless multi-hop networks. A network is said to be connected if there is a path between any pair of nodes. A convenient way to study the connectivity of a random network is by investigating the condition under which the network has no isolated node. The condition under which the network has no isolated node provides a necessary condition for a connected network. Further the condition for a network to have no isolated node and the condition for the network to be connected can often be shown to asymptotically converge to be the same as the number of nodes approaches infinity, given a suitably defined random network and connection model. Currently analytical results on the distribution of the number of isolated nodes only exist for the unit disk model. This study advances research in the area by providing the asymptotic distribution of the number of isolated nodes in random networks with nodes Poissonly distributed on a unit square under a generic random connection model. On that basis we derive a necessary condition for the above network to be asymptotically almost surely connected. These results, together with results in a companion paper on the sufficient condition for a network to be connected, expand recent results obtained for connectivity of random geometric graphs assuming a unit disk model to results assuming a more generic and more practical random connection model.

Includes members:
  Member "connectivity of large scale networks emergence of unique unbounded component":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "connectivity of confined dense networks boundary effects and scaling laws")
  Member "extremal properties of three dimensional sensor networks with applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "underwater optical wireless communications networking and localization a survey")

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)