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: "lattice codes for physical layer communications"
  Abstract: Lattices are deceptively simple mathematical structures that have become indispensable for code design for physical layer communications. While lattice-related problems are interesting in their own right, the usefulness of these discrete structures in wireless communications provides additional motivation for their study and enables a multidisciplinary line of research. #R##N#This thesis is devoted to the study of lattice code design for physical layer communications. Modern wireless communication networks are required to accommodate significantly varied types of mobile devices, differing in available computational power or number of equipped antennas. Additionally, the density of the networks increases rapidly, and many communication protocols diverge from the classical direct point-to-point transmission in favor of allowing for intermediate relays to process and forward data. An important consequence of this shift towards more sophisticated transmission protocols is that traditional well-performing codes become futile for modern communications, thus the study and development of novel codes is called for. #R##N#Yet, however involved a transmission protocol may be, the characteristics of the physical medium, i.e., the wireless channel, stay unaffected. It is thus natural that an underlying lattice structure for code design remains crucial. This thesis consists of several articles considering lattice code design for four different communication settings relevant in modern wireless communications.

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)