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: "new outer bounds on the capacity of the two user gaussian interference channel"
  Abstract: The best outer bound on the capacity region of the two-user Gaussian interference channel (GIC) is known to be the intersection of regions of various bounds including genie-aided outer bounds, in which a genie provides noisy input signals to the intended receiver. In this paper, we propose a new upper-bounding technique that utilizes noisy observation of interfering signals as auxiliary random variables. In order to derive new capacity bounds, we also introduce a conditional version of the worst additive noise lemma. The resulting outer bounds are shown to be tighter than the existing bounds for a certain range of channel parameters in the weak interference regime. We show that the rate gap between the time division lower bound (or inner bound) and the upper bounds (or outer bounds) is fairly small for practical medium-to-high values of signal-to-noise ratio (SNR) in the weak interference regime of the symmetric real GIC. This result leaves a somewhat marginal performance benefit to interference management schemes, compared to the simple time division scheme in the symmetric real case. On a positive side, we further investigate the impact of phase offset of direct-channel and cross-channel coefficients on the capacity of the asymmetric complex GIC. It turns out that sophisticated interference management schemes still have a meaningful opportunity to noticeably improve the sum-rate performance in this general case.

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)