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: "one hop throughput of wireless networks with random connections"
  Abstract: We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. In a wireless network with n nodes, a simple one-hop scheme achieving the throughput scaling of order n1/3-δ, for any arbitrarily small δ>;0, is proposed. This scheme is based on maximizing the number of successful concurrent transmissions. Such achievable throughput, along with the order n1/3 upper bound derived by Cui et al., characterizes the throughput of one-hop schemes for the class of connection models with distribution having finite mean and variance.

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"
    - "throughput scaling of wireless networks with random connections"
    - "opportunistic relaying in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "throughput of one hop wireless networks with noisy feedback channel"):
  with members:
    - "throughput of large one hop wireless networks with general fading"
    - "throughput scaling laws for wireless networks with fading channels"
    - "rate constrained wireless networks with fading channels interference limited and noise limited regimes"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-3 (induced by source paper "throughput of large one hop wireless networks with general fading"):
  with members:
    - "opportunistic relaying in wireless networks"
    - "throughput scaling laws for wireless networks with fading channels"
    - "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)