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: "throughput scaling of wireless networks with random connections"
  Abstract: This paper studies the throughput scaling of wireless networks over channels with random connections, in which the channel connections are independent and identically distributed (i.i.d.) according to a common distribution. The channel distribution is quite general, with the only limitations being that the mean and variance are finite. Previous works have shown that, when channel state information (CSI) of the entire network is known a priori to all the nodes, wireless networks are degrees-of-freedom limited rather than interference limited. In this work, we show that this is not the case with a less demanding CSI assumption. Specifically, we quantify the throughput scaling for different communication protocols under the assumption of perfect receiver CSI and partial transmitter CSI (via feedback). It is shown that the throughput of single-hop and two-hop schemes are upper-bounded by respectively, O(n1/3) and O(n1/2), where n is the total number of source-to-destination pairs. In addition, multihop schemes cannot do better than the two-hop relaying scheme. Furthermore, the achievability of the Θ(n1/2) scaling for the two-hop scheme is demonstrated by a constructive example.

Connected through hyperedge HE-1 (induced by source paper "caching gain in wireless networks with fading a multi user diversity perspective"):
  with members:
    - "optimal throughput outage trade off in wireless one hop caching networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "wireless device to device communications with distributed caching"
    - "one hop throughput of wireless networks with random connections"
    - "opportunistic relaying in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "opportunistic relaying in wireless networks"):
  with members:
    - "crystallization in large wireless networks"
    - "a simple cooperative diversity method based on network path selection"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc 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.IT(Information Theory)