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: "interactive function computation with reconstruction constraints"
  Abstract: This paper investigates two-terminal interactive function computation with reconstruction constraints. Each terminal wants to compute a (possibly different) function of two correlated sources, but can only access one of the sources directly. In addition to distortion constraints at the terminals, each terminal is required to estimate the computed function value at the other terminal in a lossy fashion, leading to the constrained reconstruction constraint. A special case of constrained reconstruction is the common reconstruction constraint, in which both terminals agree on the functions computed with probability one. The terminals exchange information in multiple rate constrained communication rounds. A characterization of the multi-round rate-distortion region for the above problem with constrained reconstruction constraints is provided. To gain more insights and to highlight the value of interaction and order of communication, the rate-distortion region for computing various functions of jointly Gaussian sources according to common reconstruction constraints is studied.

Connected through hyperedge HE-1 (induced by source paper "constrained source coding with side information"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "separation of source network coding and channel coding in wireline networks"
    - "on the separation of lossy source network coding and channel coding in wireline networks"
    - "duality between channel capacity and rate distortion with two sided state information"

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)