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 region of gaussian interference channels"
  Abstract: Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for Gaussian interference channels with low powers and crosstalk coefficients. The capacity is achieved by using single-user detection at each receiver, i.e., treating the interference as noise incurs no loss in performance.

Connected through hyperedge HE-1 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels"):
  with members:
    - "on the sum capacity of many to one and one to many gaussian interference channels"
    - "on the gaussian many to one x channel"
    - "capacity bounds for the k user gaussian interference channel"
    - "on the sum capacity of k user cascade gaussian z interference channel"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "on the sum capacity of many to one and one to many gaussian interference channels"):
  with members:
    - "on the gaussian many to one x channel"
    - "lattice codes for many to one interference channels with and without cognitive messages"
    - "capacity bounds for the k user gaussian interference channel"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on the capacity of the k user cyclic gaussian interference channel"
    - "interference alignment and a noisy interference regime for many to one interference channels"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-3 (induced by source paper "on the gaussian many to one x channel"):
  with members:
    - "on the optimality of treating interference as noise general message sets"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on the capacity of multiple access z interference channels"
    - "interference alignment and a noisy interference regime for many to one interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "capacity bounds for the k user gaussian interference channel"):
  with members:
    - "on the high snr capacity of the gaussian interference channel and new capacity bounds"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "a new sum rate outer bound for interference channels with three source destination pairs"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"

Connected through hyperedge HE-5 (induced by source paper "new outer bounds on the capacity of the two user gaussian interference channel"):
  with members:
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-6 (induced by source paper "capacity and rate regions of a class of broadcast interference channels"):
  with members:
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (induced by source paper "noisy interference sum rate capacity for vector gaussian interference channels"):
  with members:
    - "capacity region of vector gaussian interference channels with generally strong interference"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "cooperative interference management with miso beamforming"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "the capacity region of a class of discrete degraded interference channels"

Connected through hyperedge HE-8 (induced by source paper "on the sum capacity of k user cascade gaussian z interference channel"):
  with members:
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on the capacity of the k user cyclic gaussian interference channel"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

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)