human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "a local perspective on the edge removal problem"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "network coding capacity regions via entropy functions"
    - "network coding is zero error always possible"
    - "lexicographic products and the power of non linear network coding"
    - "dualities between entropy functions and network codes"

Connected through hyperedge HE-2 (induced by source paper "circular shift linear network codes with arbitrary odd block lengths"):
  with members:
    - "circular shift linear network coding"
    - "linear network coding over rings part ii vector codes and non commutative alphabets"
    - "on the message dimensions of vector linearly solvable networks"
    - "on vector linear solvability of multicast networks"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"

Connected through hyperedge HE-3 (induced by source paper "circular shift linear network coding"):
  with members:
    - "linear network coding over rings part ii vector codes and non commutative alphabets"
    - "on vector linear solvability of multicast networks"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "multicast network coding and field sizes"

Connected through hyperedge HE-4 (induced by source paper "linear network coding over rings part i scalar codes and commutative alphabets"):
  with members:
    - "linear network coding over rings part ii vector codes and non commutative alphabets"
    - "on base field of linear network coding"
    - "on vector linear solvability of multicast networks"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "multicast network coding and field sizes"
    - "an equivalence between network coding and index coding"

Connected through hyperedge HE-5 (induced by source paper "multicast networks solvable over every finite field"):
  with members:
    - "on base field of linear network coding"
    - "multicast network coding and field sizes"
    - "scalar linear solvability of matroidal networks associated with representable matroids"

Connected through hyperedge HE-6 (induced by source paper "capacity and achievable rate regions for linear network coding over ring alphabets"):
  with members:
    - "linear network coding over rings part ii vector codes and non commutative alphabets"
    - "linear network coding over rings part i scalar codes and commutative alphabets"
    - "on vector linear solvability of multicast networks"
    - "on achievability of an r l fractional linear network code"
    - "the two unicast problem"
    - "characteristic dependent linear rank inequalities with applications to network coding"
    - "achievable rate regions for network coding"
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"

Question: Please tell me which class the center node 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)