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 "zero error function computation on a directed acyclic network"):
  Abstract: We study the rate region of variable-length source-network codes that are used to compute a function of messages observed over a network. The particular network considered here is the simplest instance of a directed acyclic graph (DAG) that is not a tree. Existing work on zero-error function computation in DAG networks provides bounds on the \textit{computation capacity}, which is a measure of the amount of communication required per edge in the worst case. This work focuses on the average case: an achievable rate tuple describes the expected amount of communication required on each edge, where the expectation is over the probability mass function of the source messages. #R##N#We describe a systematic procedure to obtain outer bounds to the rate region for computing an arbitrary demand function at the terminal. Our bounding technique works by lower bounding the entropy of the descriptions observed by the terminal conditioned on the function value and by utilizing the Schur-concave property of the entropy function. We evaluate these bounds for certain example demand functions.

Includes members:
  Member "improved upper bound on the network function computing capacity":
    also connected through other hyperedges:
      (none)
  Member "on computation rates for arithmetic sum":
    also connected through other hyperedges:
      (none)
  Member "sum networks from incidence structures construction and capacity analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "leveraging coding techniques for speeding up distributed computing")
  Member "upper bound on function computation in directed acyclic networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing and communicating functions in disorganized wireless networks")
  Member "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity and achievable rate regions for linear network coding over ring alphabets")
  Member "distributed function computation over a rooted directed tree":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a framework for rate efficient control of distributed discrete systems")
  Member "on network coding for sum networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "expand and randomize an algebraic approach to secure 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)