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: "exploiting regional differences a spatially adaptive random access"
  Abstract: In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access (SARA) scheme in which the transmitters in the network utilize different transmit probabilities depending on the local situation. In our proposed scheme, the transmit probability is adaptively updated by the ratio of the received SINR and the target SINR. We investigate the performance of the spatially adaptive random access scheme. For the comparison, we derive an optimal transmit probability of ALOHA random access scheme in which all transmitters use the same transmit probability. We illustrate the performance of the spatially adaptive random access scheme through simulations. We show that the performance of the proposed scheme surpasses that of the optimal ALOHA random access scheme and is comparable with the CSMA/CA scheme.

Connected through hyperedge HE-1 (induced by source paper "random access with opportunity detection in wireless networks"):
  with members:
    - "sense and predict harnessing spatial interference correlation for cognitive radio networks"
    - "sense and predict harnessing spatial interference correlation for opportunistic access in cognitive radio networks"
    - "analysis of a proportionally fair and locally adaptive spatial aloha in poisson networks"

Connected through hyperedge HE-2 (induced by source paper "sense and predict opportunistic mac based on spatial interference correlation for cognitive radio networks"):
  with members:
    - "spatio temporal interference correlation and joint coverage in cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"

Connected through hyperedge HE-3 (induced by source paper "on spatial capacity of wireless ad hoc networks with threshold based scheduling"):
  with members:
    - "spatial throughput characterization in cognitive radio networks with threshold based opportunistic spectrum 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)