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: "optimal z complementary code set from generalized reed muller codes"
  Abstract: Z-complementary code set (ZCCS), an extension of perfect complementary codes (CCs), refers to a set of two-dimensional matrices having zero correlation zone properties. ZCCS can be used in various multi-channel systems to support, for example, quasi-synchronous interference-free multicarrier code-division multiple access communication and optimal channel estimation in multiple-input multiple-output systems. Traditional constructions of ZCCS heavily rely on a series of sequence operations which may not be feasible for rapid hardware generation particularly for long ZCCSs. In this paper, we propose a direct construction of ZCCS using second-order Reed-Muller codes with efficient graphical representation. Our proposed construction, valid for any number of isolated vertices present in the graph, is capable of generating optimal ZCCS meeting the set size upper bound.

Connected through hyperedge HE-1 (induced by source paper "generalized constructions of complementary sets of sequences of lengths non power of two"):
  with members:
    - "new sets of optimal odd length binary z complementary pairs"
    - "complementary sets generalized reed muller codes and power control for ofdm"

Connected through hyperedge HE-2 (induced by source paper "new optimal z complementary code sets from matrices of polynomials"):
  with members:
    - "a radix m construction for complementary sets"
    - "a systematic framework for the construction of optimal complete complementary codes"

Connected through hyperedge HE-3 (induced by source paper "a direct construction of optimal zccs with maximum column sequence pmepr two for mc cdma system"):
  with members:
    - "complementary sets generalized reed muller codes and power control for ofdm"

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

Connected through hyperedge HE-5 (induced by source paper "a generalised construction of multiple complete complementary codes and asymptotically optimal aperiodic quasi complementary sequence sets"):
  with members:
    - "asymptotically locally optimal weight vector design for a tighter correlation lower bound of quasi complementary sequence sets"

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)