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 the minimum distance of elliptic curve codes"
  Abstract: Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes. In practice, one often uses codes with additional mathematical structure, such as AG codes. For AG codes of genus $0$ (generalized Reed-Solomon codes), the minimum distance has a simple explicit formula. An interesting result of Cheng [3] says that the minimum distance problem is already \np-hard (under \rp-reduction) for general elliptic curve codes (ECAG codes, or AG codes of genus $1$). In this paper, we show that the minimum distance of ECAG codes also has a simple explicit formula if the evaluation set is suitably large (at least $2/3$ of the group order). Our method is purely combinatorial and based on a new sieving technique from the first two authors [8]. This method also proves a significantly stronger version of the MDS (maximum distance separable) conjecture for ECAG codes.

Connected through hyperedge HE-1 (induced by source paper "complementary dual algebraic geometry codes"):
  with members:
    - "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound"
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "new characterization and parametrization of lcd codes"
    - "parameters of two classes of lcd bch codes"
    - "a family of reversible bch codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

Connected through hyperedge HE-2 (induced by source paper "new constructions of mds symbol pair codes"):
  with members:
    - "stopping sets of algebraic geometry codes"
    - "maximum distance separable codes for symbol pair read channels"
    - "hard problems of algebraic geometry codes"

Connected through hyperedge HE-3 (induced by source paper "on deep holes of projective reed solomon codes"):
  with members:
    - "counting generalized reed solomon codes"
    - "deep holes and mds extensions of reed solomon codes"
    - "on deciding deep holes of reed solomon 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)