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 "packing and covering properties of rank metric codes"):
  Abstract: This paper investigates packing and covering properties of codes with the rank metric. First, we investigate packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their parameters, and investigate their asymptotic covering properties.

Includes members:
  Member "constant rank codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "construction of error correcting codes for random network coding")
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "constant rank codes and their connection to constant dimension codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probability of partially solving random linear systems in network coding")
  Member "decoder error probability of mrd codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "properties of rank metric codes")
  Member "properties of codes in rank metric":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hamming and simplex codes for the sum rank metric")
  Member "properties of codes with the rank metric":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on deep holes of gabidulin codes")

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)