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 sigma lcd codes"
  Abstract: Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear complementary dual (LCD) codes. In this paper, we first introduce the concept of linear codes with $\sigma$ complementary dual ($\sigma$-LCD), which includes known Euclidean LCD codes, Hermitian LCD codes, and Galois LCD codes. #R##N#As Euclidean LCD codes, $\sigma$-LCD codes can also be used to construct LCP of codes. We show that, for $q > 2$, all q-ary linear codes are $\sigma$-LCD and that, for every binary linear code $\mathcal C$, the code $\{0\}\times \mathcal C$ is $\sigma$-LCD. Further, we study deeply $\sigma$-LCD generalized quasi-cyclic (GQC) codes. In particular, we provide characterizations of $\sigma$-LCD GQC codes, self-orthogonal GQC codes and self-dual GQC codes, respectively. Moreover, we provide constructions of asymptotically good $\sigma$-LCD GQC codes. Finally, we focus on $\sigma$-LCD Abelian codes and prove that all Abelian codes in a semi-simple group algebra are $\sigma$-LCD. #R##N#The results derived in this paper extend those on the classical LCD codes and show that $\sigma$-LCD codes allow the construction of LCP of codes more easily and with more flexibility.

Connected through hyperedge HE-1 (induced by source paper "some new bounds on lcd codes over finite fields"):
  with members:
    - "on mds negacyclic lcd codes"
    - "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound"
    - "some bounds on binary lcd codes"
    - "linear codes over fq which are equivalent to lcd codes"
    - "constructions of optimal lcd codes over large finite fields"
    - "euclidean and hermitian lcd mds codes"
    - "new characterization and parametrization of lcd codes"
    - "galois lcd codes over finite fields"

Connected through hyperedge HE-2 (induced by source paper "galois hulls of linear codes over finite fields"):
  with members:
    - "constructions of optimal lcd codes over large finite fields"
    - "euclidean and hermitian lcd mds codes"
    - "galois lcd codes over finite fields"
    - "new constructions of mds codes with complementary duals"
    - "complementary dual subfield linear codes over finite fields"
    - "matrix product codes over finite commutative frobenius rings"
    - "decoding of matrix product codes"
    - "linearity and complements in projective space"

Connected through hyperedge HE-3 (induced by source paper "new characterization and parametrization of lcd codes"):
  with members:
    - "some bounds on binary lcd codes"
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "complementary dual algebraic geometry codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

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)