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: "asymptotically locally optimal weight vector design for a tighter correlation lower bound of quasi complementary sequence sets"
  Abstract: A quasi-complementary sequence set (QCSS) refers to a set of two-dimensional matrices with low nontrivial aperiodic auto- and cross-correlation sums. For multicarrier code-division multiple-access applications, the availability of large QCSSs with low correlation sums is desirable. The generalized Levenshtein bound (GLB) is a lower bound on the maximum aperiodic correlation sum of QCSSs. The bounding expression of GLB is a fractional quadratic function of a weight vector   $\mathbf {w}$   and is expressed in terms of three additional parameters associated with QCSS: the set size   $K$   , the number of channels   $M$   , and the sequence length   $N$  . It is known that a tighter GLB (compared to the Welch bound) is possible only if the condition    $M\geq 2$   and   $K\geq \overline{K}+1$  , where   $\overline{K}$    is a certain function of   $M$   and   $N$  , is satisfied. A challenging research problem is to determine if there exists a weight vector that gives rise to a tighter GLB for  all  (not just  some )   $K\geq \overline{K}+1$    and   $M\geq 2$  , especially for large   $N$  , i.e., the condition is asymptotically both necessary and sufficient. To achieve this, we  analytically  optimize the GLB which is (in general) nonconvex as the numerator term is an indefinite quadratic function of the weight vector. Our key idea is to apply the frequency domain decomposition of the circulant matrix (in the numerator term) to convert the nonconvex problem into a convex one. Following this optimization approach, we derive a new weight vector meeting the aforementioned objective and prove that it is a local minimizer of the GLB under certain conditions.

Connected through hyperedge HE-1 (induced by source paper "a generalised construction of multiple complete complementary codes and asymptotically optimal aperiodic quasi complementary sequence sets"):
  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)