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: "a direct construction of optimal zccs with maximum column sequence pmepr two for mc cdma system"
  Abstract: Multicarrier code-division multiple-access (MC-CDMA) combines an orthogonal frequency division multiplexing (OFDM) modulation and a code-division multiple-access (CDMA) scheme to exploits the benefits of both the technologies. The high peak-to-mean envelope power ratio (PMEPR) is a considerable problem in MC-CDMA system. However, the problem can be addressed by utilizing complete complementary codes (CCCs) in MC-CDMA system. But the set size upper bound of CCC does not allow the system to support large number of users for a given number of subcarriers in the system. In a CCC and Z-complementary code set (ZCCS) based asynchronous MC-CDMA system, the PMEPR is determined by column sequence PMEPR of the codes. In order to support a large number of users with low column sequence PMEPR, in this paper, we have proposed a new optimal ZCCS with larger set size. The code is constructed using Boolean function approach, i.e., by a direct construction method. The number of constituent sequences in ZCCS is the same as the number of subcarriers in MC-CDMA. So, large size ZCCS for large number of users in MC-CDMA can be constructed through a rapid hardware generation. The proposed ZCCS has maximum column sequence PMEPR of 2 and it achieves the theoretical upper bound of optimality. Our proposed construction can also generate inter-group complementary (IGC) code set for MC-CDMA with the same PMEPR. This work also establishes a link from ZCCS and IGC code set to higher-order ($\geq 2$) Reed-Muller (RM) code.

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)