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 "optimum linear codes with support constraints over small fields"):
  Abstract: We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a Reed-Solomon code of small field size. As a by-product of this result, we settle the GM-MDS conjecture of Dau et. al. in the affirmative.

Includes members:
  Member "generalized reed solomon codes with sparsest and balanced generator matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gabidulin codes with support constrained generator matrices")
  Member "further progress on the gm mds conjecture for reed solomon codes":
    also connected through other hyperedges:
      (none)
  Member "an algebraic combinatorial proof technique for the gm mds conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gabidulin codes with support constrained generator matrices")
  Member "balanced reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "weighted gradient coding with leverage score sampling")
  Member "on the existence of mds codes over small fields with constrained generator matrices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gabidulin codes with support constrained generator matrices")

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)