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 strategies for computing symmetric boolean functions in collocated networks"
  Abstract: We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we wish to compute a given Boolean function of these measurements with zero error. We allow for block computation to enhance data fusion efficiency, and determine the minimum worst-case total bits to be communicated to perform the desired computation. We restrict attention to the class of symmetric Boolean functions, which only depend on the number of 1s among the n measurements. #R##N#We define three classes of functions, namely threshold functions, delta functions and interval functions. We provide exactly optimal strategies for the first two classes, and an order-optimal strategy with optimal preconstant for interval functions. Using these results, we can characterize the complexity of computing percentile type functions, which is of great interest. In our analysis, we use lower bounds from communication complexity theory, and provide an achievable scheme using information theoretic tools.

Connected through hyperedge HE-1 (induced by source paper "networked computing in wireless sensor networks for structural health monitoring"):
  with members:
    - "model based event detection in wireless sensor networks"
    - "overlapping multihop clustering for wireless sensor networks"

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

Connected through hyperedge HE-3 (induced by source paper "fundamentals of large sensor networks connectivity capacity clocks and computation"):
  with members:
    - "information theoretic bounds for multiround function computation in collocated networks"
    - "distributed source coding for interactive function computation"
    - "on information theoretic scaling laws for wireless networks"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"
    - "a deterministic approach to wireless relay networks"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-4 (induced by source paper "optimal computation of symmetric boolean functions in tree networks"):
  with members:
    - "information theoretic bounds for multiround function computation in collocated networks"
    - "distributed source coding for interactive function computation"

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)