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 "generalized reed solomon codes with sparsest and balanced generator matrices"):
  Abstract: We prove that for any positive integers $n$ and $k$ such that $n\!\geq\! k\!\geq\! 1$, there exists an $[n,k]$ generalized Reed-Solomon (GRS) code that has a sparsest and balanced generator matrix (SBGM) over any finite field of size $q\!\geq\! n\!+\!\lceil\frac{k(k-1)}{n}\rceil$, where sparsest means that each row of the generator matrix has the least possible number of nonzeros, while balanced means that the number of nonzeros in any two columns differ by at most one. Previous work by Dau et al (ISIT'13) showed that there always exists an MDS code that has an SBGM over any finite field of size $q\geq {n-1\choose k-1}$, and Halbawi et al (ISIT'16, ITW'16) showed that there exists a cyclic Reed-Solomon code (i.e., $n=q-1$) with an SBGM for any prime power $q$. Hence, this work extends both of the previous results.

Includes members:
  Member "an algebraic combinatorial proof technique for the gm mds conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gabidulin codes with support constrained generator matrices")
  Member "cooperative data exchange based on mds codes":
    also connected through other hyperedges:
      (none)
  Member "balanced reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weighted gradient coding with leverage score sampling")
  Member "coding with constraints minimum distance bounds and systematic constructions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an algebraic combinatorial proof technique for the gm mds conjecture")
  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")
  Member "balanced sparsest generator matrices for mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mds matrices over small fields a proof of the gm mds conjecture")

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)