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: "spatial throughput characterization in cognitive radio networks with threshold based opportunistic spectrum access"
  Abstract: This paper studies the opportunistic spectrum access (OSA) of the secondary users in a large-scale overlay cognitive radio (CR) network. Two threshold-based OSA schemes, namely the primary receiver assisted (PRA) protocol and the primary transmitter assisted (PTA) protocol, are investigated. Under the PRA/PTA protocols, a secondary transmitter (ST) is allowed to access the spectrum only when the maximum signal power of the received beacons/pilots sent from the active primary receivers/transmitters (PRs/PTs) is lower than a certain threshold. To measure the resulting transmission opportunity for the secondary users by the proposed OSA protocols, the concept of spatial opportunity, which is defined as the probability that an arbitrary location in the primary network is detected as a spatial spectrum hole, is introduced and then evaluated by applying tools from stochastic geometry. Based on spatial opportunity, the coverage (non-outage transmission) performance in the overlay CR network is analyzed. With the obtained results of spatial opportunity and coverage probability, we finally characterize the spatial throughput, which is defined as the average spatial density of successful transmissions in the primary/secondary network, under the PRA and PTA protocols, respectively.

Connected through hyperedge HE-1 (induced by source paper "information exchange in randomly deployed dense wsns with wireless energy harvesting capabilities"):
  with members:
    - "simultaneous information and energy transfer in large scale networks with without relaying"
    - "energy cooperation in energy harvesting communications"
    - "wireless information and power transfer a dynamic power splitting approach"
    - "medium access control protocols for wireless sensor networks with energy harvesting"
    - "wireless information transfer with opportunistic energy harvesting"
    - "mimo broadcasting for simultaneous wireless information and power transfer"
    - "a tractable approach to coverage and rate in cellular networks"
    - "optimum transmission policies for battery limited energy harvesting nodes"

Connected through hyperedge HE-2 (induced by source paper "on spatial capacity of wireless ad hoc networks with threshold based scheduling"):
  with members:
    - "exploiting regional differences a spatially adaptive random access"
    - "adaptive spatial aloha fairness and stochastic geometry"
    - "analytical modeling of uplink cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "an overview of the transmission capacity of wireless networks"
    - "on a game theoretic approach to capacity maximization in wireless networks"
    - "fractional power control for decentralized wireless networks"
    - "the effect of fading channel inversion and threshold scheduling on 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)