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: "overhead performance tradeoffs a resource allocation perspective"
  Abstract: A key aspect of many resource allocation problems is the need for the resource controller to compute a function, such as the max or arg max, of the competing users metrics. Information must be exchanged between the competing users and the resource controller in order for this function to be computed. In many practical resource controllers the competing users' metrics are communicated to the resource controller, which then computes the desired extremization function. However, in this paper it is shown that information rate savings can be obtained by recognizing that controller only needs to determine the result of this extremization function. If the extremization function is to be computed losslessly, the rate savings are shown in most cases to be at most 2 bits independent of the number of competing users. Motivated by the small savings in the lossless case, simple achievable schemes for both the lossy and interactive variants of this problem are considered. It is shown that both of these approaches have the potential to realize large rate savings, especially in the case where the number of competing users is large. For the lossy variant, it is shown that the proposed simple achievable schemes are in fact close to the fundamental limit given by the rate distortion function.

Connected through hyperedge HE-1 (induced by source paper "a framework for rate efficient control of distributed discrete systems"):
  with members:
    - "interactive scalar quantization for distributed resource allocation"
    - "distributed function computation over a rooted directed tree"
    - "the complexity of decentralized control of markov decision processes"
    - "maa a heuristic search algorithm for solving decentralized pomdps"
    - "anytime reliable codes for stabilizing plants over erasure channels"
    - "optimal and approximate q value functions for decentralized pomdps"
    - "rateless coding for gaussian channels"
    - "the communicative multiagent team decision problem analyzing teamwork theories and models"

Connected through hyperedge HE-2 (induced by source paper "interactive scalar quantization for distributed resource allocation"):
  with members:
    - "the non regular ceo problem"
    - "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"
    - "interaction strictly improves the wyner ziv rate distortion function"
    - "optimal feedback communication via posterior matching"

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)