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 "efficient interpolation based decoding of interleaved subspace and gabidulin codes"):
  Abstract: An interpolation-based decoding scheme for interleaved subspace codes is presented. The scheme can be used as a (not necessarily polynomial-time) list decoder as well as a probabilistic unique decoder. Both interpretations allow to decode interleaved subspace codes beyond half the minimum subspace distance. Further, an efficient interpolation procedure for the required linearized multivariate polynomials is presented and a computationally- and memory-efficient root-finding algorithm for the probabilistic unique decoder is proposed. These two efficient algorithms can also be applied for accelerating the decoding of interleaved Gabidulin codes.

Includes members:
  Member "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "bounds for projective codes from semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semidefinite programming bounds for error correcting codes")
  Member "bounds on list decoding of rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "list decoding of lifted gabidulin codes via the plucker embedding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "list and probabilistic unique decoding of folded subspace codes")
  Member "list decoding of subspace codes and rank metric codes up to singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "list and probabilistic unique decoding of folded subspace codes")
  Member "general linearized polynomial interpolation and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "list and probabilistic unique decoding of folded subspace codes")
  Member "recursive code construction for random networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "a note on echelon ferrers construction")

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)