human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "interactive scalar quantization for distributed resource allocation"):
  Abstract: In many resource allocation problems, a centralized controller needs to award some resource to a user selected from a collection of distributed users with the goal of maximizing the utility the user would receive from the resource. This can be modeled as the controller computing an extremum of the distributed users’ utilities. The overhead rate necessary to enable the controller to reproduce the users’ local state can be prohibitively high. An approach to reduce this overhead is interactive communication wherein rate savings are achieved by tolerating an increase in delay. In this paper, we consider the design of a simple achievable scheme based on successive refinements of scalar quantization at each user. The optimal quantization policy is computed via a dynamic program and we demonstrate that tolerating a small increase in delay can yield significant rate savings. We then consider two simpler quantization policies to investigate the scaling properties of the rate-delay tradeoffs. Using a combination of these simpler policies, the performance of the optimal policy can be closely approximated with lower computational costs.

Includes members:
  Member "the non regular ceo problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "successive wyner ziv coding for the binary ceo problem under logarithmic loss")
  Member "overhead performance tradeoffs a resource allocation perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a framework for rate efficient control of distributed discrete systems")
  Member "distributed functional scalar quantization simplified":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on distributed quantization for classification")
  Member "distributed function computation over a rooted directed tree":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "zero error function computation on a directed acyclic network")
  Member "multiterminal source coding under logarithmic loss":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "distributed scalar quantization for computing high resolution analysis and extensions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on distributed quantization for classification")
  Member "interaction strictly improves the wyner ziv rate distortion function":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the three terminal interactive lossy source coding problem")
  Member "optimal feedback communication via posterior matching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "feedback channel communication with low precision arithmetic")

Question: Please tell me which class the source paper 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)