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 "on the genericity of maximum rank distance and gabidulin codes"):
  Abstract: We consider linear rank-metric codes in #N#                  #N#                    #N#                  #N#                  $${\mathbb {F}}_{q^m}^n$$#N#                  #N#                    #N#                  #N#                . We show that the properties of being maximum rank distance (MRD) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability. Moreover, we give upper bounds on the respective probabilities in dependence on the extension degree m.

Includes members:
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "algebraic structures of mrd codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "partitions of matrix spaces with an application to q rook polynomials")
  Member "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")

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)