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: "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region"
  Abstract: Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two user Gaussian interference channel within one bit. In this paper, we develop new, improved outer bounds on the capacity region. Using these bounds, we show that treating interference as noise achieves the sum capacity of the two user Gaussian interference channel in a low interference regime, where the interference parameters are below certain thresholds. We then generalize our techniques and results to Gaussian interference networks with more than two users. In particular, we demonstrate that the total interference threshold, below which treating interference as noise achieves the sum capacity, increases with the number of users.

Connected through hyperedge HE-1 (induced by source paper "extended generalized dof optimality regime of treating interference as noise in the x channel"):
  with members:
    - "sub optimality of treating interference as noise in the cellular uplink with weak interference"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise"
    - "sub optimality of treating interference as noise in the cellular uplink"
    - "rate region frontiers for n user interference channel with interference as noise"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"):
  with members:
    - "capacity bounds for wireless ergodic fading broadcast channels with partial csit"
    - "fundamental limits of communications in interference networks part i basic structures"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "ergodic fading interference channels sum capacity and separability"
    - "interference mitigation through limited transmitter cooperation"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "a general coding scheme for two user fading interference channels"
    - "interference mitigation through limited receiver cooperation"

Connected through hyperedge HE-3 (induced by source paper "on precoding for constant k user mimo gaussian interference channel with finite constellation inputs"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "linear precoder design for mimo interference channels with finite alphabet signaling"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "two user gaussian interference channel with finite constellation input and fdma"
    - "achievable rates in two user interference channels with finite inputs and very strong interference"
    - "interference alignment for the k user mimo interference channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "linear transceiver design for interference alignment complexity and computation"

Connected through hyperedge HE-4 (induced by source paper "on the sum capacity of the discrete memoryless interference channel with one sided weak interference and mixed interference"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "the capacity region of a class of discrete degraded interference channels"

Connected through hyperedge HE-5 (induced by source paper "a new sum rate outer bound for interference channels with three source destination pairs"):
  with members:
    - "on achievability of gaussian interference channel capacity to within one bit"
    - "interference channels with source cooperation"
    - "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"
    - "sum capacity of k user gaussian degraded interference channels"
    - "outer bounds for the interference channel with a cognitive relay"
    - "interference channel with generalized feedback a k a with source cooperation part i achievable region"
    - "lecture notes on network information theory"

Connected through hyperedge HE-6 (induced by source paper "sub optimality of treating interference as noise in the cellular uplink"):
  with members:
    - "on gaussian multiple access channels with interference achievable rates and upper bounds"
    - "rate region frontiers for n user interference channel with interference as noise"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "on the capacity of multiple access z 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-7 (induced by source paper "aligned interference neutralization and the degrees of freedom of the 2x2x2 interference channel"):
  with members:
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "sum capacity and the unique separability of the parallel gaussian mac z bc network"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "capacity bounds for two hop interference networks"
    - "real interference alignment with real numbers"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "on the sum capacity of a class of cyclically symmetric deterministic interference channels"

Connected through hyperedge HE-8 (induced by source paper "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"):
  with members:
    - "rate region frontiers for n user interference channel with interference as noise"
    - "on the sum capacity of a class of cyclically symmetric deterministic interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user 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)