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 novel error performance analysis methodology for ofdm im"
  Abstract: Orthogonal frequency-division multiplexing with index modulation (OFDM-IM) has become a high-profile candidate for the modulation scheme in next generation networks, and many works have been published to analyze it in recent years. Error performance is one of the most important and interesting aspects of OFDM-IM, which has been analyzed in most works. However, most of them employ two key approximations to derive the closed-form expressions of block error rate (BLER) and/or average bit error rate (BER). The first one is to utilize the union bound assisted by the pairwise error probability analysis, and the second one is to employ an exponential approximation of    ${Q}$   -function. In this letter, we apply Craig’s formula to analyze the error performance for OFDM-IM in place of the exponential approximation. Because Craig’s formula is the exact expression of    ${Q}$   -function, the accuracy of analytical results regarding error performance for OFDM-IM can be improved. We examine the proposed error performance analysis methodology based on Craig’s formula by investigating both average BLER and BER.

Connected through hyperedge HE-1 (induced by source paper "enhanced huffman coded ofdm with index modulation"):
  with members:
    - "binary tree encoding for uniform binary sources in index modulation systems"
    - "power allocation for adaptive ofdm index modulation in cooperative networks"
    - "index modulation for 5g striving to do more with less"

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)