human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "upper bound on function computation in directed acyclic networks"
  Abstract: Function computation in directed acyclic networks is considered, where a sink node wants to compute a target function with the inputs generated at multiple source nodes. The network links are error-free but capacity-limited, and the intermediate network nodes perform network coding. The target function is required to be computed with zero error. The computing rate of a network code is measured by the average number of times that the target function can be computed for one use of the network. We propose a cut-set bound on the computing rate using an equivalence relation associated with the inputs of the target function. Our bound holds for general target functions and network topologies. We also show that our bound is tight for some special cases where the computing capacity can be characterized.

Connected through hyperedge HE-1 (induced by source paper "computing and communicating functions in disorganized wireless networks"):
  with members:
    - "over the air function computation in sensor networks"
    - "nomographic functions efficient computation in clustered gaussian sensor networks"
    - "computation over gaussian networks with orthogonal components"
    - "computing linear functions by linear coding over networks"
    - "duty cycle aware minimum energy multicasting in wireless sensor networks"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-2 (induced by source paper "zero error function computation on a directed acyclic network"):
  with members:
    - "improved upper bound on the network function computing capacity"
    - "on computation rates for arithmetic sum"
    - "sum networks from incidence structures construction and capacity analysis"
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"
    - "distributed function computation over a rooted directed tree"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "optimal function computation in directed and undirected graphs"

Connected through hyperedge HE-3 (induced by source paper "improved upper bound on the network function computing capacity"):
  with members:
    - "on network coding for sum networks"
    - "computing linear functions by linear coding over networks"
    - "network coding for computing cut set bounds"
    - "optimal function computation in directed and undirected graphs"
    - "linear codes target function classes and network computing capacity"
    - "on network functional compression"
    - "communicating the sum of sources over a network"

Connected through hyperedge HE-4 (induced by source paper "sum networks from incidence structures construction and capacity analysis"):
  with members:
    - "low subpacketization schemes for coded caching"
    - "sum networks from undirected graphs construction and capacity analysis"
    - "coded caching with low subpacketization levels"
    - "coded caching for networks with the resolvability property"
    - "capacity of sum networks for different message alphabets"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"
    - "on network coding for sum networks"

Connected through hyperedge HE-5 (induced by source paper "on computation rates for arithmetic sum"):
  with members:
    - "sum networks from undirected graphs construction and capacity analysis"
    - "capacity of sum networks for different message alphabets"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "optimal function computation in directed and undirected graphs"
    - "communicating the sum of sources over a network"

Question: Please tell me which class the center node 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)