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 some automorphisms of rational functions and their applications in rank metric codes"):
  Abstract: Recently, there is a growing interest in the study of rank metric codes. These codes have applications in network coding and cryptography. In this paper, we investigate some automorpshisms on polynomial rings over finite fields. We show how the linear operators from these automorphisms can be used to construct some maximum rank distance (MRD) codes. First we work on rank metric codes over arbitrary extension and then we reduce these to finite fields extension. Some particular constructions give MRD codes which are not equivalent to the twisted Gabidulin codes. Another application is to use these linear operators to construct some optimal rank metric codes for some Ferrers diagrams. In fact we give some examples of Ferrers diagrams for which there was no known construction of optimal rank metric codes.

Includes members:
  Member "low rank parity check codes new decoding algorithms and applications to cryptography":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low rank parity check codes over the ring of integers modulo a prime power")
  Member "reliable and secure multishot network coding using linearized reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "locally repairable convolutional codes with sliding window repair")
  Member "maximal ferrers diagram codes constructions and genericity considerations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the sparseness of certain mrd codes")
  Member "on the genericity of maximum rank distance and gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval from locally repairable databases with colluding servers")
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "a singleton bound for generalized ferrers diagram rank metric codes":
    also connected through other hyperedges:
      (none)
  Member "convolutional codes with maximum column sum rank for network streaming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "locally repairable convolutional codes with sliding window repair")

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)