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 source coding for interactive function computation"
  Abstract: A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in terms of single-letter information measures. While interaction is useless in terms of the minimum sum-rate for lossless source reproduction at one or both locations, the gains can be arbitrarily large for function computation even when the sources are independent. For a class of sources and functions, interaction is shown to be useless, even with infinite messages, when a function has to be computed at only one location, but is shown to be useful, if functions have to be computed at both locations. For computing the Boolean AND function of two independent Bernoulli sources at both locations, an achievable infinite-message sum-rate with infinitesimal-rate messages is derived in terms of a two-dimensional definite integral and a rate-allocation curve. A general framework for multiterminal interactive function computation based on an information exchange protocol which successively switches among different distributed source coding configurations is developed. For networks with a star topology, multiple rounds of interactive coding is shown to decrease the scaling law of the total network rate by an order of magnitude as the network grows.

Connected through hyperedge HE-1 (induced by source paper "round complexity of common randomness generation the amortized setting"):
  with members:
    - "communication rounds tradeoffs for common randomness and secret key generation"
    - "resource efficient common randomness and secret key schemes"
    - "the power of shared randomness in uncertain communication"
    - "secret key generation with limited interaction"
    - "on the role of shared randomness in simultaneous communication"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "communication complexity of permutation invariant functions"
    - "communication with imperfectly shared randomness"

Connected through hyperedge HE-2 (induced by source paper "on network functional compression"):
  with members:
    - "network coding for computing cut set bounds"
    - "network flows for functions"
    - "optimal computation of symmetric boolean functions in tree networks"
    - "on zero error source coding with feedback"
    - "information theoretic bounds for multiround function computation in collocated networks"
    - "on distributed function computation in structure free random networks"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-3 (induced by source paper "fundamentals of large sensor networks connectivity capacity clocks and computation"):
  with members:
    - "optimal strategies for computing symmetric boolean functions in collocated networks"
    - "information theoretic bounds for multiround function computation in collocated networks"
    - "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:
    - "optimal strategies for computing symmetric boolean functions in collocated networks"
    - "information theoretic bounds for multiround function computation in collocated networks"

Connected through hyperedge HE-5 (induced by source paper "interaction strictly improves the wyner ziv rate distortion function"):
  with members:
    - "the infinite message limit of two terminal interactive source coding"

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

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)