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: "optimization of a finite frequency hopping ad hoc network in nakagami fading"
  Abstract: This paper considers the analysis and optimization of a frequency-hopping ad hoc network with a finite number of mobiles and finite spatial extent. The mobiles communicate using coded continuous-phase frequency-shift keying (CPFSK) modulation. The performance of the system is a function of the number of hopping channels, the rate of the error-correction code, and the modulation index used by the CPFSK modulation. For a given channel model and density of mobiles, these parameters are jointly optimized by maximizing the (modulation-constrained) transmission capacity, which is a measure of the spatial spectral efficiency of the system. The transmission capacity of the finite network is found by using a recent expression for the spatially averaged outage probability in the presence of Nakagami fading, which is found in closed form in the absence of shadowing and can be solved using numerical integration in the presence of shadowing.

Connected through hyperedge HE-1 (induced by source paper "optimization of an adaptive frequency hopping network"):
  with members:
    - "adjacent channel interference in frequency hopping ad hoc networks"
    - "an overview of the transmission capacity of wireless networks"

Connected through hyperedge HE-2 (induced by source paper "adjacent channel interference in frequency hopping ad hoc networks"):
  with members:
    - "guard zones and the near far problem in ds cdma ad hoc networks"
    - "the outage probability of a finite ad hoc network in nakagami fading"

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)