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 "on the solvability of 3s nt sum network a region decomposition and weak decentralized code method"):
  Abstract: We study the network coding problem of sum-networks with 3 sources and n terminals (3s/nt sum-network), for an arbitrary positive integer n, and derive a sufficient and necessary condition for the solvability of a family of so-called terminal-separable sum-network. Both the condition of terminal-separable and the solvability of a terminal-separable sum-network can be decided in polynomial time. Consequently, we give another necessary and sufficient condition, which yields a faster (O(|E|) time) algorithm than that of Shenvi and Dey ([18], (O(|E|^3) time), to determine the solvability of the 3s/3t sum-network. To obtain the results, we further develop the region decomposition method in [22], [23] and generalize the decentralized coding method in [21]. Our methods provide new efficient tools for multiple source multiple sink network coding problems.

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 "network coding for computing cut set bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "expand and randomize an algebraic approach to secure computation")
  Member "communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "two way function computation")
  Member "feasible alphabets for communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "network coding for computing cut set bounds")
  Member "some bounds on the capacity of communicating the sum of sources":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "network coding for computing cut set bounds")
  Member "some results on communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)