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: "the capacity of wireless channels a physical approach"
  Abstract: In this paper, the capacity of wireless channels is characterized based on electromagnetic and antenna theories with only minimal assumptions. We assume the transmitter can generate an arbitrary current distribution inside a spherical region and the receive antennas are uniformly distributed on a bigger sphere surrounding the transmitter. The capacity is shown to be (αP/N0) log e [bits/sec] in the limit of large number of receive antennas, where P is the transmit power constraint, a is the normalized density of the receive antennas and N0 is the noise power spectral density. Although this result may look trivial, it is surprising in two ways. First, this result holds regardless of the bandwidth (bandwith can even be negligibly small). Second, this result shows that the capacity is irrespective of the size of the region containing the transmitter. This is against some previous results that claimed the maximum degrees of freedom is proportional to the surface area containing the transmitter normalized by the square of the wavelength. Our result has important practical implications since it shows that even a compact antenna array with negligible bandwidth and antenna spacing well below the wavelength can provide a huge throughput as if the array was big enough so that the antenna spacing is on the order of the wavelength.

Connected through hyperedge HE-1 (induced by source paper "on landau s eigenvalue theorem and information cut sets"):
  with members:
    - "capacity scaling of wireless ad hoc networks shannon meets maxwell"

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)