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: "hard problems of algebraic geometry codes"
  Abstract: The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for general linear codes, the techniques used to prove their hardness often rely on the construction of artificial codes. In general, much less is known about the hardness of the specific classes of natural linear codes. In this paper, we show that both problems are #R##N#NP-hard for algebraic geometry codes. We achieve this by reducing a well-known NP-complete problem to these problems using a randomized algorithm. The family of codes in the reductions are based on elliptic curves. They have positive rates, but the alphabet sizes are exponential in the block lengths.

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:
    - "on the minimum distance of elliptic curve codes"
    - "stopping sets of algebraic geometry codes"
    - "maximum distance separable codes for symbol pair read channels"

Connected through hyperedge HE-3 (induced by source paper "np hardness of reed solomon decoding and the prouhet tarry escott problem"):
  with members:
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"
    - "maximum likelihood decoding of reed solomon codes is np hard"

Connected through hyperedge HE-4 (induced by source paper "on the minimum distance of elliptic curve codes"):
  with members:
    - "stopping sets of algebraic geometry codes"

Connected through hyperedge HE-5 (induced by source paper "stopping sets of algebraic geometry codes"):
  with members:
    - "on generic erasure correcting sets and related problems"
    - "stopping set distributions of some linear codes"
    - "single exclusion number and the stopping redundancy of mds codes"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

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)