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 "geometric decoding of subspace codes with explicit schubert calculus applied to spread codes"):
  Abstract: This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann. The decoding algorithm requires the code to be defined as the intersection of the Pl\"ucker embedding of the Grassmannian and an algebraic variety. We call such codes \emph{geometric subspace codes}. Complexity is substantially improved compared to the algorithm by Rosenthal, Silberstein and Trautmann and connections to finite geometry are given. The decoding algorithm is applied to Desarguesian spread codes, which are known to be defined as the intersection of the Pl\"ucker embedding of the Grassmannian with a linear space.

Includes members:
  Member "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some gabidulin codes cannot be list decoded efficiently at any radius")
  Member "partial spreads in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hamming and simplex codes for the sum rank metric")
  Member "an algebraic approach for decoding spread codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "construction of subspace codes through linkage")
  Member "spread decoding in extension fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "message encoding and retrieval for spread and cyclic orbit codes")
  Member "spread codes and spread decoding in network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  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")

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)