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: "information theoretic bounds for multiround function computation in collocated networks"
  Abstract: We study the limits of communication efficiency for function computation in collocated networks within the framework of multi-terminal block source coding theory. With the goal of computing a desired function of sources at a sink, nodes interact with each other through a sequence of error-free, network-wide broadcasts of finite-rate messages. For any function of independent sources, we derive a computable characterization of the set of all feasible message coding rates - the rate region -in terms of single-letter information measures. We show that when computing symmetric functions of binary sources, the sink will inevitably learn certain additional information which is not demanded in computing the function. This conceptual understanding leads to new improved bounds for the minimum sum-rate. The new bounds are shown to be orderwise better than those based on cut-sets as the network scales. The scaling law of the minimum sum-rate is explored for different classes of symmetric functions and source parameters.

Connected through hyperedge HE-1 (induced by source paper "distributed function computation over a rooted directed tree"):
  with members:
    - "on cooperation in multi terminal computation and rate distortion"
    - "network coding for computing cut set bounds"
    - "optimal function computation in directed and undirected graphs"
    - "linear codes target function classes and network computing capacity"
    - "cascade multiterminal source coding"

Connected through hyperedge HE-2 (induced by source paper "distributed function computation with confidentiality"):
  with members:
    - "when is a function securely computable"
    - "information inequalities for joint distributions with interpretations and applications"

Connected through hyperedge HE-3 (induced by source paper "network coding for computing cut set bounds"):
  with members:
    - "communicating the sum of sources over a network"
    - "cascade multiterminal source coding"
    - "feasible alphabets for communicating the sum of sources over a network"
    - "some bounds on the capacity of communicating the sum of sources"
    - "geographic gossip efficient aggregation for sensor networks"
    - "fast distributed algorithms for computing separable functions"

Connected through hyperedge HE-4 (induced by source paper "computing linear functions by linear coding over networks"):
  with members:
    - "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"
    - "some bounds on the capacity of communicating the sum of sources"

Connected through hyperedge HE-5 (induced by source paper "towards a queueing based framework for in network function computation"):
  with members:
    - "network coding for computing cut set bounds"
    - "optimal computation of symmetric boolean functions in tree networks"
    - "distributed random access algorithm scheduling and congesion control"
    - "novel architectures and algorithms for delay reduction in back pressure scheduling and routing"

Connected through hyperedge HE-6 (induced by source paper "optimal computation of symmetric boolean functions in collocated networks"):
  with members:
    - "optimal computation of symmetric boolean functions in tree networks"
    - "optimal strategies for computing symmetric boolean functions in collocated networks"

Connected through hyperedge HE-7 (induced by source paper "computing a function of correlated sources"):
  with members:
    - "network coding for computing cut set bounds"
    - "cascade multiterminal source coding"

Connected through hyperedge HE-8 (induced by source paper "optimal function computation in directed and undirected graphs"):
  with members:
    - "network coding for computing cut set bounds"

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)