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: "optimal computation of symmetric boolean functions in tree networks"
  Abstract: In this paper, we address the scenario where nodes with sensor data are connected in a tree network, and every node wants to compute a given symmetric Boolean function of the sensor data. We first consider the problem of computing a function of two nodes with integer measurements. We allow for block computation to enhance data fusion efficiency, and determine the minimum worst-case total number of bits to be exchanged to perform the desired computation. We establish lower bounds using fooling sets, and provide a novel scheme which attains the lower bounds, using information theoretic tools. For a class of functions called sum-threshold functions, this scheme is shown to be optimal. We then turn to tree networks and derive a lower bound for the number of bits exchanged on each link by viewing it as a two node problem. We show that the protocol of recursive innetwork aggregation achieves this lower bound in the case of sumthreshold functions. Thus we have provided a communication and in-network computation strategy that is optimal for each link. All the results can be extended to the case of non-binary alphabets. In the case of general graphs, we present a cut-set lower bound, and an achievable scheme based on aggregation along trees. For complete graphs, the complexity of this scheme is no more than twice that of the optimal scheme.

Connected through hyperedge HE-1 (induced by source paper "how to distribute computation in networks"):
  with members:
    - "on the derivative imbalance and ambiguity of functions"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "on heterogeneous coded distributed computing"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "comments on cut set bounds on network function computation"
    - "computing linear functions by linear coding over networks"

Connected through hyperedge HE-2 (induced by source paper "towards a queueing based framework for in network function computation"):
  with members:
    - "network coding for computing cut set bounds"
    - "distributed random access algorithm scheduling and congesion control"
    - "information theoretic bounds for multiround function computation in collocated networks"
    - "novel architectures and algorithms for delay reduction in back pressure scheduling and routing"

Connected through hyperedge HE-3 (induced by source paper "optimal computation of symmetric boolean functions in collocated networks"):
  with members:
    - "optimal strategies for computing symmetric boolean functions in collocated networks"
    - "information theoretic bounds for multiround function computation in collocated networks"

Connected through hyperedge HE-4 (induced by source paper "on network functional compression"):
  with members:
    - "network coding for computing cut set bounds"
    - "network flows for functions"
    - "on zero error source coding with feedback"
    - "information theoretic bounds for multiround function computation in collocated networks"
    - "distributed source coding for interactive function computation"
    - "on distributed function computation in structure free random networks"
    - "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)