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 "gabidulin codes with support constrained generator matrices"):
  Abstract: Gabidulin codes are the only known general construction of linear codes that are maximum rank distant (MRD). They have found applications in linear network coding when the transmitter and receiver are oblivious to the inner workings and topology of the network (the so-called incoherent regime). The reason is that Gabidulin codes map information to linear subspaces, which in the absence of errors cannot be altered by linear operations, and in the presence of errors can be corrected if the subspace is perturbed by a small rank. Furthermore, in distributed coding and distributed systems, one is led to the design of error correcting codes whose generator matrix must satisfy a given support constraint. In this paper, we give necessary and sufficient conditions on the support of the generator matrix that guarantees the existence of Gabidulin codes and general MRD codes. When the rate of the code is not very high, this is achieved with the same field size necessary for Gabidulin codes with no support constraint. When these conditions are not satisfied, we characterize the largest possible rank distance under the support constraints and show that they can be achieved by subcodes of Gabidulin codes. The necessary and sufficient conditions are identical to those that appear for MDS codes which were recently proven by Yildiz et al. and Lovett in the context of settling the GM-MDS conjecture.

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 "optimum linear codes with support constraints over small fields")
  Member "optimum linear codes with support constraints over small fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mds matrices over small fields a proof of the gm mds conjecture")
  Member "mds matrices over small fields a proof of the gm mds conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decentralized pliable index coding")
  Member "an algebraic combinatorial proof technique for the gm mds conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized reed solomon codes with sparsest and balanced generator matrices")
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "further generalisations of twisted gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "balanced reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "generalized reed solomon codes with sparsest and balanced 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)