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: "analysis of uncoordinated opportunistic two hop wireless ad hoc systems"
  Abstract: We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may connect to multiple relays in the first hop. In the presence of interference and without tight coordination of the relays, it is not clear which relays should transmit the packet. We propose four decentralized methods of relay selection, some based on location information and others based on the received signal strength (RSS). We provide a complete analytical characterization of these methods using tools from stochastic geometry. We use simulation results to compare these methods in terms of end-to-end success probability.

Connected through hyperedge HE-1 (induced by source paper "a stochastic geometry based approach to modeling interference correlation in cooperative relay networks"):
  with members:
    - "managing interference correlation through random medium access"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"
    - "diversity loss due to interference correlation"
    - "a tractable approach to coverage and rate in cellular networks"
    - "noisy network coding"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-2 (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"

Connected through hyperedge HE-3 (induced by source paper "an upper bound on multihop transmission capacity with dynamic routing selection"):
  with members:
    - "multicast outage probability and transmission capacity of multihop wireless networks"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"
    - "an overview of the transmission capacity of wireless networks"
    - "random access transport capacity"
    - "transmission capacities for overlaid wireless ad hoc networks with outage constraints"
    - "transmission capacity of ad hoc networks with multiple antennas using transmit stream adaptation and interference cancelation"
    - "spectrum sharing between cellular and mobile ad hoc networks transmission capacity trade off"
    - "information theoretic operating regimes of large wireless networks"

Connected through hyperedge HE-4 (induced by source paper "outage probability of wireless ad hoc networks with cooperative relaying"):
  with members:
    - "an overview of the transmission capacity of wireless networks"
    - "a selection region based routing protocol for random mobile ad hoc networks with directional antennas"
    - "performance of optimum combining in a poisson field of interferers and rayleigh fading channels"
    - "a simple cooperative diversity method based on network path selection"

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)