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: "characteristic dependent linear rank inequalities with applications to network coding"
  Abstract: Two characteristic-dependent linear rank inequalities are given for eight variables. Specifically, the first inequality holds for all finite fields whose characteristic is not three and does not in general hold over characteristic three. The second inequality holds for all finite fields whose characteristic is three and does not in general hold over characteristics other than three. Applications of these inequalities to the computation of capacity upper bounds in network coding are demonstrated.

Connected through hyperedge HE-1 (induced by source paper "characteristic dependent linear rank inequalities via complementary vector spaces"):
  with members:
    - "achievable rate regions for network coding"
    - "lexicographic products and the power of non linear network coding"
    - "graph theoretical constructions for graph entropy and network coding based communications"
    - "linear rank inequalities on five or more variables"
    - "broadcasting with side information"

Connected through hyperedge HE-2 (induced by source paper "how to find new characteristic dependent linear rank inequalities using binary matrices as a guide"):
  with members:
    - "characteristic dependent linear rank inequalities via complementary vector spaces"
    - "achievable rate regions for network coding"
    - "lexicographic products and the power of non linear network coding"
    - "linear rank inequalities on five or more variables"

Connected through hyperedge HE-3 (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"
    - "a class of non linearly solvable networks"
    - "on vector linear solvability of multicast networks"
    - "on achievability of an r l fractional linear network code"
    - "the two unicast problem"
    - "achievable rate regions for network coding"
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"

Connected through hyperedge HE-4 (induced by source paper "on the dependence of linear coding rates on the characteristic of the finite field"):
  with members:
    - "linear network coding over rings part i scalar codes and commutative alphabets"
    - "capacity and achievable rate regions for linear network coding over ring alphabets"
    - "multicast network coding and field sizes"
    - "achievable rate regions for network coding"
    - "on network coding for sum 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)