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: "some bounds on the capacity of communicating the sum of sources"
  Abstract: We consider directed acyclic networks with multiple sources and multiple terminals where each source generates one i.i.d. random process over an abelian group and all the terminals want to recover the sum of these random processes. The different source processes are assumed to be independent. The solvability of such networks has been considered in some previous works. In this paper we investigate on the capacity of such networks, referred as {\it sum-networks}, and present some bounds in terms of min-cut, and the numbers of sources and terminals.

Connected through hyperedge HE-1 (induced by source paper "on the solvability of 3s nt sum network a region decomposition and weak decentralized code method"):
  with members:
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "communicating the sum of sources over a network"
    - "feasible alphabets for communicating the sum of sources over a network"
    - "some results on communicating the sum of sources over a network"
    - "on distributed computation in noisy random planar networks"

Connected through hyperedge HE-2 (induced by source paper "network coding for computing cut set bounds"):
  with members:
    - "communicating the sum of sources over a network"
    - "cascade multiterminal source coding"
    - "feasible alphabets for communicating the sum of sources over a network"
    - "information theoretic bounds for multiround function computation in collocated networks"
    - "geographic gossip efficient aggregation for sensor networks"
    - "fast distributed algorithms for computing separable functions"

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

Connected through hyperedge HE-4 (induced by source paper "on the solvability of 3 source 3 terminal sum networks"):
  with members:
    - "communicating the sum of sources over a network"
    - "feasible alphabets for communicating the sum of sources over a network"
    - "a simple necessary and sufficient condition for the double unicast problem"
    - "some results on communicating the sum of sources over a network"
    - "on distributed computation in noisy random planar networks"

Connected through hyperedge HE-5 (induced by source paper "linear codes target function classes and network computing capacity"):
  with members:
    - "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)