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 "construction of codes for network coding"):
  Abstract: Abstract—Based on ideas of Kotter and Kschischang [6] we useconstant dimension subspaces as codewords in a network. Weshow a connection to the theory of q-analogues of a combinatorialdesigns, which has been studied in [1] as a purely combinatorialobject. For the construction of network codes we successfullymodiﬁed methods (construction with prescribed automorphi sms)originally developed for the q-analogues of a combinatorialdesigns. We then give a special case of that method which allo wsthe construction of network codes with a very large ambientspace and we also show how to decode such codes with a verysmall number of operations. network coding, q-analogue of Steiner systems, subspacecodes, constant dimension subspace codes, decoding, SingercycleI. I NTRODUCTION A. Subspace CodesIn [6] R. Kotter and F. R. Kschischang developed the theoryof subspace codes for applications in network coding. Wewill modify their presentation in some way. We denote byL(GF(q) v )the lattice of all subspaces of the ambient space,which is a vector space of dimension v over the ﬁnite ﬁeldwith q elements. The partial order of L(GF(q)

Includes members:
  Member "a new construction for constant weight codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "construction of q ary constant weight sequences using a knuth like approach")
  Member "spread codes and spread decoding in network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "symbol erasure correction capability of spread codes")
  Member "construction of large constant dimension codes with a prescribed minimum distance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on some automorphisms of rational functions and their applications in rank metric codes")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)