human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "the second generalized hamming weight of some evaluation codes arising from a projective torus"):
  Abstract: In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete bipartite graph. Also, at the beginning, we obtain some results about the generalized Hamming weights of some evaluation codes arising from a complete intersection when the minimum distance is known and they are non--degenerate codes. Finally we give an example where we use these results to determine the complete weight hierarchy of some codes.

Includes members:
  Member "new lower bounds on the generalized hamming weights of ag codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "generalized hamming weights for almost affine codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear codes over signed graphs")
  Member "generalized hamming weights of irreducible cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "on the second hamming weight of some reed muller type codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar decreasing monomial cartesian codes")

Question: Please tell me which class the source paper 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)