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: "on cosets of the generalized first order reed muller code with low pmepr"
  Abstract: Golay sequences are well suited for the use as codewords in orthogonal frequency-division multiplexing (OFDM), since their peak-to-mean envelope power ratio (PMEPR) in q-ary phase-shift keying (PSK) modulation is at most 2. It is known that a family of polyphase Golay sequences of length 2^m organizes in m!/2 cosets of a q-ary generalization of the first-order Reed-Muller code, RM_q(1,m). In this paper a more general construction technique for cosets of RM_q(1,m) with low PMEPR is established. These cosets contain so-called near-complementary sequences. The application of this theory is then illustrated by providing some construction examples. First, it is shown that the m!/2 cosets of RM_q(1,m) comprised of Golay sequences just arise as a special case. Second, further families of cosets of RM_q(1,m) with maximum PMEPR between 2 and 4 are presented, showing that some previously unexplained phenomena can now be understood within a unified framework. A lower bound on the PMEPR of cosets of RM_q(1,m) is proved as well, and it is demonstrated that the upper bound on the PMEPR is tight in many cases. Finally it is shown that all upper bounds on the PMEPR of cosets of RM_q(1,m) also hold for the peak-to-average power ratio (PAPR) under the Walsh-Hadamard transform.

Connected through hyperedge HE-1 (induced by source paper "low pmepr preamble sequence design for dynamic spectrum allocation in ofdma systems"):
  with members:
    - "complementary sets generalized reed muller codes and power control for ofdm"

Connected through hyperedge HE-2 (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"
    - "complementary sets generalized reed muller codes and power control for ofdm"

Connected through hyperedge HE-3 (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"
    - "complementary sets generalized reed muller codes and power control for ofdm"

Connected through hyperedge HE-4 (induced by source paper "the papr problem in ofdm transmission new directions for a long lasting problem"):
  with members:
    - "peak reduction and clipping mitigation in ofdm by augmented compressive sensing"
    - "expected supremum of a random linear combination of shifted kernels"
    - "on the peak to average power ratio reduction problem for orthogonal transmission schemes"
    - "analysis of alternative metrics for the papr problem in ofdm transmission"
    - "on the concentration of the crest factor for ofdm signals"
    - "clipping noise cancellation for ofdm and ofdma systems using compressed sensing"
    - "subspace pursuit for compressive sensing signal reconstruction"

Connected through hyperedge HE-5 (induced by source paper "a complementary construction using mutually unbiased bases"):
  with members:
    - "complementary sets generalized reed muller codes and power control for ofdm"

Connected through hyperedge HE-6 (induced by source paper "on the peak to mean envelope power ratio of phase shifted binary codes"):
  with members:
    - "complementary sets generalized reed muller codes and power control for ofdm"

Connected through hyperedge HE-7 (induced by source paper "quaternary constant amplitude codes for multicode cdma"):
  with members:
    - "complementary sets generalized reed muller codes and power control for ofdm"

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)