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: "on the capacity region of the two user interference channel"
  Abstract: One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime is given for the general IC where the sum-rate capacity is achieved by treating interference as noise at the receivers. To obtain this result, a single-letter outer bound in terms of some auxiliary random variables is first established for the sum-rate capacity of the general IC and then those conditions under which this outer bound is reduced to the achievable sum-rate given by the simple treating interference as noise strategy are specified. The main benefit of this approach is that it is applicable for any two-user IC (potentially non-Gaussian). For the special case of Gaussian channel, our result is reduced to the noisy interference regime that was previously obtained. Next, some results are given on the Han-Kobayashi (HK) achievable rate region. The evaluation of this rate region is in general difficult. In this paper, a simple characterization of the HK rate region is derived for some special cases, specifically, for a novel very weak interference regime. As a remarkable characteristic, it is shown that for this very weak interference regime, the achievable sum-rate due to the HK region is identical to the one given by the simple treating interference as noise strategy.

Connected through hyperedge HE-1 (induced by source paper "novel outer bounds and capacity results for the interference channel with conferencing receivers"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "the k user interference channel strong interference regime"
    - "an outer bound for the memoryless two user interference channel with general cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "interference mitigation through limited receiver cooperation"
    - "compound multiple access channels with partial cooperation"
    - "on the symmetric gaussian interference channel with partial unidirectional cooperation"

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)