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: "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
  Abstract: A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this paper. Specifically, it is shown that if the channel crosstalk coefficient magnitudes lie below thresholds defined by the power constraints then single-user detection at each receiver is sum-rate optimal, i.e., treating the interference as noise incurs no loss in performance. This is the first capacity result for the Gaussian interference channel with weak to moderate interference. Furthermore, for certain mixed (weak and strong) interference scenarios, the new outer bounds give a corner point of the capacity region.

Connected through hyperedge HE-1 (induced by source paper "vector gaussian successive refinement with degraded side information"):
  with members:
    - "the sum rate of vector gaussian multiple description coding with tree structured covariance distortion constraints"
    - "vector gaussian rate distortion with variable side information"
    - "broadcasting correlated vector gaussians"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "private broadcasting over independent parallel channels"
    - "information theoretic proofs of entropy power inequalities"
    - "secure lossy transmission of vector gaussian sources"
    - "capacity equivocation region of the gaussian mimo wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "noma an information theoretic perspective"):
  with members:
    - "rate splitting multiple access for downlink communication systems bridging generalizing and outperforming sdma and noma"
    - "power domain non orthogonal multiple access noma in 5g systems potentials and challenges"
    - "optimal beamforming for gaussian mimo wiretap channels with two transmit antennas"
    - "approximate capacity region of the mac ic mac"
    - "gsvd based precoding in mimo systems with integrated services"
    - "non orthogonal multiple access in multi cell networks theory performance and practical challenges"
    - "the application of mimo to non orthogonal multiple access"
    - "fairness for non orthogonal multiple access in 5g systems"

Connected through hyperedge HE-3 (induced by source paper "on the optimality of treating inter cell interference as noise in uplink cellular networks"):
  with members:
    - "on multi cell uplink downlink duality with treating inter cell interference as noise"
    - "on the optimality of treating interference as noise for interfering multiple access channels"
    - "opportunistic treating interference as noise"
    - "interference as noise friend or foe"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "on the optimality of treating interference as noise compound interference networks"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise for k user parallel gaussian interference networks"

Connected through hyperedge HE-4 (induced by source paper "strong interference alignment"):
  with members:
    - "channel aided interference alignment"
    - "opportunistic interference alignment for mimo interfering multiple access channels"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "ergodic fading interference channels sum capacity and separability"
    - "ergodic interference alignment"
    - "capacity bounds for the gaussian interference channel"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-5 (induced by source paper "stable throughput region of the two user interference channel"):
  with members:
    - "stable throughput and delay analysis of a random access network with queue aware transmission"
    - "stable throughput region of the two user broadcast channel"
    - "effect of energy harvesting on stable throughput in cooperative relay systems"
    - "multi user cognitive interference channels a survey and new capacity results"
    - "achievable outage rate regions for the miso interference channel"
    - "the stability region of the two user interference channel"
    - "relay assisted multiple access with multi packet reception capability and simultaneous transmission and reception"

Connected through hyperedge HE-6 (induced by source paper "on the optimality of treating interference as noise for interfering multiple access channels"):
  with members:
    - "optimality of treating interference as noise a combinatorial perspective"
    - "on the optimality of treating interference as noise compound interference networks"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise for k user parallel gaussian interference networks"
    - "achievable and crystallized rate regions of the interference channel with interference as noise"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (induced by source paper "state dependent interference channel with correlated states"):
  with members:
    - "state dependent z channel"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-8 (induced by source paper "on continuous time gaussian channels"):
  with members:
    - "upper and lower bounds on the capacity of amplitude constrained mimo channels"
    - "recent results in continuous time network information theory"
    - "wireless network information flow a deterministic approach"
    - "limit theorems in hidden markov models"
    - "directed information causal estimation and communication in continuous time"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "on the gaussian mac with imperfect feedback"
    - "capacity bounds for the gaussian interference channel"

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)