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 "sum networks from undirected graphs construction and capacity analysis"):
  Abstract: We consider a directed acyclic network with multiple sources and multiple terminals where each terminal is interested in decoding the sum of independent sources generated at the source nodes. We describe a procedure whereby a simple undirected graph can be used to construct such a sum-network and demonstrate an upper bound on its computation rate. Furthermore, we show sufficient conditions for the construction of a linear network code that achieves this upper bound. Our procedure allows us to construct sum-networks that have any arbitrary computation rate $\frac{p}{q}$ (where $p,q$ are non-negative integers). Our work significantly generalizes a previous approach for constructing sum-networks with arbitrary capacities. Specifically, we answer an open question in prior work by demonstrating sum-networks with significantly fewer number of sources and terminals.

Includes members:
  Member "capacity of sum networks for different message alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coded caching schemes with reduced subpacketization from linear block codes")
  Member "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "expand and randomize an algebraic approach to secure computation")
  Member "an achievable region for the double unicast problem based on a minimum cut analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "zero error function computation on a directed acyclic network")
  Member "linear codes target function classes and network computing capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "structured mappings and conferencing common information for multiple access channels")
  Member "communicating the sum of sources over a network":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "two way function computation")

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)