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 3 s n t sum networks"):
  Abstract: A sum-network is a directed acyclic network where each source independently generates one symbol from a given field $\mathbb F$ and each terminal wants to receive the sum $($over $\mathbb F)$ of the source symbols. For sum-networks with two sources or two terminals, the solvability is characterized by the connection condition of each source-terminal pair [3]. A necessary and sufficient condition for the solvability of the $3$-source $3$-terminal $(3$s$/3$t$)$ sum-networks was given by Shenvi and Dey [6]. However, the general case of arbitrary sources/sinks is still open. In this paper, we investigate the sum-network with three sources and $n$ sinks using a region decomposition method. A sufficient and necessary condition is established for a class of $3$s$/n$t sum-networks. As a direct application of this result, a necessary and sufficient condition of solvability is obtained for the special case of $3$s$/3$t sum-networks.

Includes members:
  Member "on network coding for sum networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "two way function computation")
  Member "some results on communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sum networks dependency on characteristic of the finite field under linear network coding")
  Member "on distributed computation in noisy random planar networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "broadcasting in noisy radio networks")

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)