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: "novel 16 qam and 64 qam near complementary sequences with low pmepr in ofdm systems"
  Abstract: In this paper, we first propose a novel construction of 16-quadrature amplitude modulation (QAM) near-complementary sequences with low peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM) systems. The proposed 16-QAM near-complementary sequences can be constructed by utilizing novel nonlinear offsets, where the length of the sequences is    $n=2^{m}$   . The family size of the newly constructed 16-QAM near-complementary sequences is    $8\times ({m!}/{2})\times 4^{m+1}$   , and the PMEPR of these sequences is proven to satisfy PMEPR ≤ 2.4. Thus, the proposed construction can generate a number of 16-QAM near-complementary sequences with low PMEPR, resulting in the improvement of the code rate in OFDM systems. Furthermore, we also propose a novel construction of 64-QAM near-complementary sequences with low PMEPR, which is the first proven construction of 64-QAM near-complementary sequences. The PMEPRs of two types of the proposed 64-QAM near-complementary sequences are proven to satisfy that PMEPR ≤ 3.62 or PMEPR ≤ 2.48, respectively. The family size of the newly constructed 64-QAM near-complementary sequences is    $64\times ({m!}/{2})\times 4^{m+1}$   .

Connected through hyperedge HE-1 (induced by source paper "a generic complementary sequence encoder"):
  with members:
    - "the papr problem in ofdm transmission new directions for a long lasting problem"

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)