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: "complementary sets generalized reed muller codes and power control for ofdm"
  Abstract: The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considered in this correspondence. By generalizing a result by Paterson, it is shown that each q-phase (q is even) sequence of length 2m lies in a complementary set of size 2k+1, where k is a nonnegative integer that can be easily determined from the generalized Boolean function associated with the sequence. For small k this result provides a reasonably tight bound for the PMEPR of q-phase sequences of length 2 m. A new 2h-ary generalization of the classical Reed-Muller code is then used together with the result on complementary sets to derive flexible OFDM coding schemes with low PMEPR. These codes include the codes developed by Davis and Jedwab as a special case. In certain situations the codes in the present correspondence are similar to Paterson's code constructions and often outperform them

Connected through hyperedge HE-1 (induced by source paper "new constructions of cross z complementary pairs"):
  with members:
    - "new sets of optimal odd length binary z complementary pairs"
    - "cross complementary pairs for optimal training in spatial modulation over frequency selective channels"
    - "a survey on spatial modulation in emerging wireless systems research progresses and applications"

Connected through hyperedge HE-2 (induced by source paper "generalized constructions of complementary sets of sequences of lengths non power of two"):
  with members:
    - "optimal z complementary code set from generalized reed muller codes"
    - "new sets of optimal odd length binary z complementary pairs"

Connected through hyperedge HE-3 (induced by source paper "low pmepr preamble sequence design for dynamic spectrum allocation in ofdma systems"):
  with members:
    - "on cosets of the generalized first order reed muller code with low pmepr"

Connected through hyperedge HE-4 (induced by source paper "how to construct mutually orthogonal complementary sets with non power of two lengths"):
  with members:
    - "a systematic framework for the construction of optimal complete complementary codes"

Connected through hyperedge HE-5 (induced by source paper "new construction of complementary sequence or array sets and complete complementary codes"):
  with members:
    - "a radix m construction for complementary sets"
    - "complementary lattice arrays for coded aperture imaging"
    - "new constructions of zero correlation zone sequences"
    - "a generalized construction of ofdm m qam sequences with low peak to average power ratio"
    - "on cosets of the generalized first order reed muller code with low pmepr"

Connected through hyperedge HE-6 (induced by source paper "a new method to construct gloay complementary set by paraunitary matrices and hadamard matrices"):
  with members:
    - "a generalized construction of ofdm m qam sequences with low peak to average power ratio"
    - "on cosets of the generalized first order reed muller code with low pmepr"

Connected through hyperedge HE-7 (induced by source paper "a direct construction of optimal zccs with maximum column sequence pmepr two for mc cdma system"):
  with members:
    - "optimal z complementary code set from generalized reed muller codes"

Connected through hyperedge HE-8 (induced by source paper "a direct and generalized construction of polyphase complementary set with low pmepr and high code rate for ofdm system"):
  with members:
    - "optimal z complementary code set from generalized reed muller codes"

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)