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 "communicating the sum of sources over a network"):
  Abstract: We consider a network (that is capable of network coding) with a set of sources and terminals, where each terminal is interested in recovering the sum of the sources. Considering directed acyclic graphs with unit capacity edges and independent, unit-entropy sources, we show the rate region when (a) there are two sources and $n$ terminals, and (b) $n$ sources and two terminals. In these cases as long as there exists at least one path from each source to each terminal we demonstrate that there exists a valid assignment of coding vectors to the edges such that the terminals can recover the sum of the sources.

Includes members:
  Member "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "zero error function computation on a directed acyclic network")
  Member "on network coding for sum networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear network coding effects of varying the message dimension on the set of characteristics")
  Member "a note on the multiple unicast capacity of directed acyclic networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the two unicast problem")
  Member "on the solvability of 3 source 3 terminal sum networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on network coding for sum networks")
  Member "feasible alphabets for communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the solvability of 3s nt sum network a region decomposition and weak decentralized code method")
  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")

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)