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 set matrices satisfying a column correlation constraint"
  Abstract: Motivated by the problem of reducing the peak to average power ratio (PAPR) of transmitted signals, we consider a design of complementary set matrices whose column sequences satisfy a correlation constraint. The design algorithm recursively builds a collection of $2^{t+1}$ mutually orthogonal (MO) complementary set matrices starting from a companion pair of sequences. We relate correlation properties of column sequences to that of the companion pair and illustrate how to select an appropriate companion pair to ensure that a given column correlation constraint is satisfied. For $t=0$, companion pair properties directly determine matrix column correlation properties. For $t\geq 1$, reducing correlation merits of the companion pair may lead to improved column correlation properties. However, further decrease of the maximum out-off-phase aperiodic autocorrelation of column sequences is not possible once the companion pair correlation merit is less than a threshold determined by $t$. We also reveal a design of the companion pair which leads to complementary set matrices with Golay column sequences. Exhaustive search for companion pairs satisfying a column correlation constraint is infeasible for medium and long sequences. We instead search for two shorter length sequences by minimizing a cost function in terms of their autocorrelation and crosscorrelation merits. Furthermore, an improved cost function which helps in reducing the maximum out-off-phase column correlation is derived based on the properties of the companion pair. By exploiting the well-known Welch bound, sufficient conditions for the existence of companion pairs which satisfy a set of column correlation constraints are also given.

Connected through hyperedge HE-1 (induced by source paper "new complementary sets with low papr property under spectral null constraints"):
  with members:
    - "sequence design for cognitive cdma communications under arbitrary spectrum hole constraint"
    - "a systematic framework for the construction of optimal complete complementary 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)