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 dual algebraic geometry codes"
  Abstract: Linear complementary dual (LCD) codes is a class of linear codes introduced by Massey in 1964. LCD codes have been extensively studied in literature recently. In addition to their applications in data storage, communications systems, and consumer electronics, LCD codes have been employed in cryptography. More specifically, it has been shown that LCD codes can also help improve the security of the information processed by sensitive devices, especially against so-called side-channel attacks (SCA) and fault non-invasive attacks. In this paper, we are interested in the construction of particular algebraic geometry (AG) LCD codes which could be good candidates to be resistant against SCA. We firstly provide a construction scheme for obtaining LCD codes from elliptic curves. Then, some explicit LCD codes from elliptic curve are presented. MDS codes are of the most importance in coding theory due to their theoretical significance and practical interests. In this paper, all the constructed LCD codes from elliptic curves are MDS or almost MDS. Some infinite classes of LCD codes from elliptic curves are optimal due to the Griesmer bound. Finally, we introduce a construction mechanism for obtaining LCD codes from any algebraic curve and derive some explicit LCD codes from hyperelliptic curves and Hermitian curves.

Connected through hyperedge HE-1 (induced by source paper "minimal linear codes from characteristic functions"):
  with members:
    - "minimal linear codes arising from blocking sets"
    - "minimal linear codes over finite fields"
    - "euclidean and hermitian lcd mds codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "towards secure two party computation from the wire tap channel"

Connected through hyperedge HE-2 (induced by source paper "linear complementary dual maximum distance separable codes"):
  with members:
    - "coding theory the unit derived methodology"
    - "linear codes over fq which are equivalent to lcd codes"
    - "new characterization and parametrization of lcd codes"
    - "systems of mds codes from units and idempotents"
    - "codes from zero divisors and units in group rings"

Connected through hyperedge HE-3 (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"
    - "on sigma lcd codes"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "affine cartesian codes with complementary duals"):
  with members:
    - "new constructions of mds codes with complementary duals"
    - "lcd cyclic codes over finite fields"
    - "on the second hamming weight of some reed muller type codes"
    - "weighted reed muller codes revisited"

Connected through hyperedge HE-5 (induced by source paper "euclidean and hermitian lcd mds codes"):
  with members:
    - "on mds negacyclic lcd codes"
    - "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking"
    - "structure and performance of generalized quasi cyclic codes"
    - "some bounds on binary lcd codes"
    - "new constructions of mds codes with complementary duals"
    - "complementary dual subfield linear codes over finite fields"
    - "parameters of two classes of lcd bch codes"
    - "matrix product complementary dual codes"

Connected through hyperedge HE-6 (induced by source paper "on sigma lcd codes"):
  with members:
    - "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking"
    - "structure and performance of generalized quasi cyclic codes"
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "new characterization and parametrization of lcd codes"
    - "galois lcd codes over finite fields"
    - "complementary dual subfield linear codes over finite fields"
    - "parameters of two classes of lcd bch codes"

Connected through hyperedge HE-7 (induced by source paper "linear codes over fq which are equivalent to lcd codes"):
  with members:
    - "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound"
    - "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking"
    - "structure and performance of generalized quasi cyclic codes"
    - "some bounds on binary lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "complementary dual subfield linear codes over finite fields"
    - "parameters of two classes of lcd bch codes"
    - "matrix product complementary dual codes"

Connected through hyperedge HE-8 (induced by source paper "rank metric lcd codes"):
  with members:
    - "on mds negacyclic lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "new constructions of mds codes with complementary duals"
    - "complementary dual subfield linear codes over finite fields"
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "parameters of two classes of lcd bch codes"
    - "the reversible negacyclic codes over finite fields"
    - "a family of reversible bch 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)