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 "network coding for computing cut set bounds"):
  Abstract: The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function f of the messages. The objective is to maximize the average number of times f can be computed per network usage, i.e., the “computing capacity”. The network coding problem for a single-receiver network is a special case of the network computing problem in which all of the source messages must be reproduced at the receiver. For network coding with a single receiver, routing is known to achieve the capacity by achieving the network min-cut upper bound. We extend the definition of min-cut to the network computing problem and show that the min-cut is still an upper bound on the maximum achievable rate and is tight for computing (using coding) any target function in multi-edge tree networks. It is also tight for computing linear target functions in any network. We also study the bound's tightness for different classes of target functions. In particular, we give a lower bound on the computing capacity in terms of the Steiner tree packing number and a different bound for symmetric functions. We also show that for certain networks and target functions, the computing capacity can be less than an arbitrarily small fraction of the min-cut bound.

Includes members:
  Member "communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two way function computation")
  Member "cascade multiterminal source coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hypothesis testing over the two hop relay network")
  Member "feasible alphabets for communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the solvability of 3s nt sum network a region decomposition and weak decentralized code method")
  Member "some bounds on the capacity of communicating the sum of sources":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the solvability of 3s nt sum network a region decomposition and weak decentralized code method")
  Member "information theoretic bounds for multiround function computation in collocated networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed function computation over a rooted directed tree")
  Member "geographic gossip efficient aggregation for sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey of distributed data aggregation algorithms")
  Member "fast distributed algorithms for computing separable functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed voting in beep model")

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)