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: "interaction strictly improves the wyner ziv rate distortion function"
  Abstract: In 1985 Kaspi provided a single-letter characterization of the sum-rate-distortion function for a two-way lossy source coding problem in which two terminals send multiple messages back and forth with the goal of reproducing each other's sources. Yet, the question remained whether more messages can strictly improve the sum-rate-distortion function. Viewing the sum-rate as a functional of the distortions and the joint source distribution and leveraging its convex-geometric properties, we construct an example which shows that two messages can strictly improve the one-message (Wyner-Ziv) rate-distortion function. The example also shows that the ratio of the one-message rate to the two-message sum-rate can be arbitrarily large and simultaneously the ratio of the backward rate to the forward rate in the two-message sum-rate can be arbitrarily small.

Connected through hyperedge HE-1 (induced by source paper "interactive scalar quantization for distributed resource allocation"):
  with members:
    - "the non regular ceo problem"
    - "overhead performance tradeoffs a resource allocation perspective"
    - "distributed functional scalar quantization simplified"
    - "distributed function computation over a rooted directed tree"
    - "multiterminal source coding under logarithmic loss"
    - "distributed scalar quantization for computing high resolution analysis and extensions"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-2 (induced by source paper "the three terminal interactive lossy source coding problem"):
  with members:
    - "diffusion lms over multitask networks"
    - "distributed estimation in multi agent networks"
    - "rate distortion with side information at many decoders"
    - "two way source coding with a helper"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-3 (induced by source paper "interactive scalar quantization for distributed extremization"):
  with members:
    - "distributed functional scalar quantization simplified"
    - "distributed function computation over a rooted directed tree"
    - "distributed scalar quantization for computing high resolution analysis and extensions"

Connected through hyperedge HE-4 (induced by source paper "overhead performance tradeoffs a resource allocation perspective"):
  with members:
    - "distributed function computation over a rooted directed tree"
    - "distributed scalar quantization for computing high resolution analysis and extensions"
    - "rateless coding for gaussian channels"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-5 (induced by source paper "broadcast approach and oblivious cooperative strategies for the wireless relay channel part i sequential decode and forward sdf"):
  with members:
    - "broadcast cooperation strategies for two colocated users"

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)