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 "a class of non linearly solvable networks"):
  Abstract: For each positive composite integer    $ m$   , a network is constructed, which is solvable over an alphabet of size    $ m$    but is not solvable over any smaller alphabet. These networks have no linear solutions over any module alphabets and are not asymptotically linearly solvable over any finite-field alphabets. The networks’ capacities are all shown to equal one, and their linear capacities are all shown to be bounded away from one for all finite-field alphabets. In addition, if    $ m$    is a non-power-of-prime composite number, then such a network is not solvable over any prime-power-size alphabet.

Includes members:
  Member "on the message dimensions of vector linearly solvable networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "on vector linear solvability of multicast networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "vector network coding based on subspace codes outperforms scalar linear network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "multicast network coding and field sizes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "linear network coding linear index coding and representable discrete polymatroids":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "on network coding for sum networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "lexicographic products and the power of non linear network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "path gain algebraic formulation for the scalar linear network coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "linear network coding for two unicast z networks a commutative algebraic perspective and fundamental limits")

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)