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: "linear codes target function classes and network computing capacity"
  Abstract: We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, injective, semi-injective, and linear target functions over finite fields. Computing capacity bounds and achievability are given with respect to these target function classes for network codes that use routing, linear coding, or nonlinear coding.

Connected through hyperedge HE-1 (induced by source paper "structured mappings and conferencing common information for multiple access channels"):
  with members:
    - "a new achievable rate region for multiple access channel with states"
    - "quasi linear codes application to point to point and multi terminal source coding"
    - "distributed simulation of continuous random variables"
    - "exact common information"
    - "on interference networks over finite fields"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-2 (induced by source paper "improved upper bound on the network function computing capacity"):
  with members:
    - "upper bound on function computation in directed acyclic networks"
    - "on network coding for sum networks"
    - "computing linear functions by linear coding over networks"
    - "network coding for computing cut set bounds"
    - "optimal function computation in directed and undirected graphs"
    - "on network functional compression"
    - "communicating the sum of sources over a network"

Connected through hyperedge HE-3 (induced by source paper "how to compute modulo prime power sums"):
  with members:
    - "on the necessity of structured codes for communications over mac with feedback"
    - "a new achievable rate region for multiple access channel with states"
    - "trade off between communication and cooperation in the interference channel"
    - "a joint typicality approach to algebraic network information theory"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-4 (induced by source paper "sum networks from incidence structures construction and capacity analysis"):
  with members:
    - "low subpacketization schemes for coded caching"
    - "sum networks from undirected graphs construction and capacity analysis"
    - "coded caching with low subpacketization levels"
    - "coded caching for networks with the resolvability property"
    - "capacity of sum networks for different message alphabets"
    - "upper bound on function computation in directed acyclic networks"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"

Connected through hyperedge HE-5 (induced by source paper "a relation between network computation and functional index coding problems"):
  with members:
    - "capacity of sum networks for different message alphabets"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "index coding with coded side information"
    - "an equivalence between network coding and index coding"
    - "optimal index codes for a class of multicast networks with receiver side information"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"

Connected through hyperedge HE-6 (induced by source paper "sum networks from undirected graphs construction and capacity analysis"):
  with members:
    - "capacity of sum networks for different message alphabets"
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "an achievable region for the double unicast problem based on a minimum cut analysis"
    - "communicating the sum of sources over a network"

Connected through hyperedge HE-7 (induced by source paper "comments on cut set bounds on network function computation"):
  with members:
    - "on network coding for sum networks"
    - "computing linear functions by linear coding over networks"
    - "network coding for computing cut set bounds"
    - "optimal function computation in directed and undirected graphs"
    - "communicating the sum of sources over a network"

Connected through hyperedge HE-8 (induced by source paper "capacity of sum networks for different message alphabets"):
  with members:
    - "sum networks from undirected graphs construction and capacity analysis"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "communicating the sum of sources over a network"

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)