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: "distributed function computation over a rooted directed tree"
  Abstract: This paper establishes the rate region for a class of source coding function computation setups where sources of information are available at the nodes of a tree and where a function of these sources must be computed at the root. The rate region holds for any function as long as the sources' joint distribution satisfies a certain Markov criterion. This criterion is met, in particular, when the sources are independent. #R##N#This result recovers the rate regions of several function computation setups. These include the point-to-point communication setting with arbitrary sources, the noiseless multiple access network with "conditionally independent sources," and the cascade network with Markovian sources.

Connected through hyperedge HE-1 (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"
    - "upper bound on function computation in directed acyclic networks"
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"
    - "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-2 (induced by source paper "a framework for rate efficient control of distributed discrete systems"):
  with members:
    - "interactive scalar quantization for distributed resource allocation"
    - "overhead performance tradeoffs a resource allocation perspective"
    - "the complexity of decentralized control of markov decision processes"
    - "maa a heuristic search algorithm for solving decentralized pomdps"
    - "anytime reliable codes for stabilizing plants over erasure channels"
    - "optimal and approximate q value functions for decentralized pomdps"
    - "rateless coding for gaussian channels"
    - "the communicative multiagent team decision problem analyzing teamwork theories and models"

Connected through hyperedge HE-3 (induced by source paper "a classification of functions in multiterminal distributed computing"):
  with members:
    - "on distributed computing for functions with certain structures"
    - "optimal function computation in directed and undirected graphs"
    - "many help one problem for gaussian sources with a tree structure on their correlation"
    - "the gaussian many help one distributed source coding problem"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-4 (induced by source paper "condense a reconfigurable knowledge acquisition architecture for future 5g iot"):
  with members:
    - "network coding as a service"
    - "photonic delay systems as machine learning implementations"
    - "software defined networking a comprehensive survey"
    - "communication efficient distributed optimization using an approximate newton type method"
    - "linear coding schemes for the distributed computation of subspaces"
    - "internet of things iot a vision architectural elements and future directions"
    - "on network coding for sum networks"
    - "optoelectronic reservoir computing"

Connected through hyperedge HE-5 (induced by source paper "in network compression for multiterminal cascade mimo systems"):
  with members:
    - "lossy compression for compute and forward in limited backhaul uplink multicell processing"
    - "optimized backhaul compression for uplink cloud radio access network"
    - "multihop backhaul compression for the uplink of cloud radio access networks"
    - "robust and efficient distributed compression for cloud radio access networks"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "cascade and triangular source coding with side information at the first two nodes"
    - "cascade multiterminal source coding"

Connected through hyperedge HE-6 (induced by source paper "interactive scalar quantization for distributed resource allocation"):
  with members:
    - "the non regular ceo problem"
    - "overhead performance tradeoffs a resource allocation perspective"
    - "distributed functional scalar quantization simplified"
    - "multiterminal source coding under logarithmic loss"
    - "distributed scalar quantization for computing high resolution analysis and extensions"
    - "interaction strictly improves the wyner ziv rate distortion function"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-7 (induced by source paper "interactive scalar quantization for distributed extremization"):
  with members:
    - "distributed functional scalar quantization simplified"
    - "distributed scalar quantization for computing high resolution analysis and extensions"
    - "interaction strictly improves the wyner ziv rate distortion function"

Connected through hyperedge HE-8 (induced by source paper "overhead performance tradeoffs a resource allocation perspective"):
  with members:
    - "distributed scalar quantization for computing high resolution analysis and extensions"
    - "interaction strictly improves the wyner ziv rate distortion function"
    - "rateless coding for gaussian channels"
    - "rate region of the quadratic gaussian two encoder source coding problem"

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)