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: "outage probability of wireless ad hoc networks with cooperative relaying"
  Abstract: In this paper, we analyze the performance of cooperative transmissions in wireless ad hoc networks with random node locations. According to a contention probability for message transmission, each source node can either transmits its own message signal or acts as a potential relay for others. Hence, each destination node can potentially receive two copies of the message signal, one from the direct link and the other from the relay link. Taking the random node locations and interference into account, we derive closed-form expressions for the outage probability with different combining schemes at the destination nodes. In particular, the outage performance of optimal combining, maximum ratio combining, and selection combining strategies are studied and quantified.

Connected through hyperedge HE-1 (induced by source paper "simultaneous information and energy transfer in large scale networks with without relaying"):
  with members:
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "outage probability in arbitrarily shaped finite wireless networks"
    - "spatial throughput of mobile ad hoc networks powered by energy harvesting"
    - "throughput maximization in wireless powered communication networks"
    - "cooperative energy harvesting networks with spatially random users"
    - "opportunistic wireless energy harvesting in cognitive radio networks"
    - "a learning theoretic approach to energy harvesting communication system optimization"
    - "relaying protocols for wireless energy harvesting and information processing"

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)