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 "enumerative encoding in the grassmannian space"):
  Abstract: Codes in the Grassmannian space have found recently application in network coding. Representation of $k$-dimensional subspaces of $\F_q^n$ has generally an essential role in solving coding problems in the Grassmannian, and in particular in encoding subspaces of the Grassmannian. Different representations of subspaces in the Grassmannian are presented. We use two of these representations for enumerative encoding of the Grassmannian. One enumerative encoding is based on Ferrers diagrams representation of subspaces; and another is based on identifying vector and reduced row echelon form representation of subspaces. A third method which combine the previous two is more efficient than the other two enumerative encodings.

Includes members:
  Member "recursive code construction for random networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new constructions of subspace codes using subsets of mrd codes in several blocks")
  Member "error correcting codes in projective spaces via rank metric codes and ferrers diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a note on echelon ferrers construction")
  Member "spread codes and spread decoding in network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "symbol erasure correction capability of spread codes")
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "construction of large constant dimension codes with a prescribed minimum distance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on some automorphisms of rational functions and their applications in rank metric codes")
  Member "constant rank codes and their connection to constant dimension codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "probability of partially solving random linear systems in network coding")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "johnson type bounds on constant dimension codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the lattice structure of linear subspace 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)