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: "sum capacity of the gaussian interference channel in the low interference regime"
  Abstract: New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain thresholds.

Connected through hyperedge HE-1 (induced by source paper "real interference alignment exploiting the potential of single antenna systems"):
  with members:
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "interference alignment for secrecy"
    - "the degrees of freedom of compute and forward"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "interference alignment for the k user mimo interference channel"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on the degrees of freedom of the compound mimo broadcast channels with finite states"

Connected through hyperedge HE-2 (induced by source paper "achievable and crystallized rate regions of the interference channel with interference as noise"):
  with members:
    - "rate region frontiers for n user interference channel with interference as noise"
    - "crystallized rates region of the interference channel via correlated equilibrium with interference as noise"
    - "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-3 (induced by source paper "interference assisted secret communication"):
  with members:
    - "interference alignment for secrecy"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "gaussian interference channel capacity to within one bit"
    - "cognitive interference channels with confidential messages"
    - "multiple access channels with generalized feedback and confidential messages"

Connected through hyperedge HE-4 (induced by source paper "interference channel with an out of band relay"):
  with members:
    - "ergodic fading interference channels sum capacity and separability"
    - "the multi way relay channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "noisy network coding"
    - "the mimo wireless switch relaying can increase the multiplexing gain"
    - "noisy interference sum rate capacity of parallel gaussian interference channels"
    - "multiple multicasts with the help of a relay"

Connected through hyperedge HE-5 (induced by source paper "degrees of freedom regions of two user mimo z and full interference channels the benefit of reconfigurable antennas"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "the degrees of freedom of mimo interference channels without state information at transmitters"
    - "mimo z interference channels capacity under strong and noisy interference"
    - "ergodic fading one sided interference channels without state information at transmitters"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"

Connected through hyperedge HE-6 (induced by source paper "on the degrees of freedom regions of two user mimo z and full interference channels with reconfigurable antennas"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "aiming perfectly in the dark blind interference alignment through staggered antenna switching"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "mimo z interference channels capacity under strong and noisy interference"
    - "ergodic fading one sided interference channels without state information at transmitters"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"

Connected through hyperedge HE-7 (induced by source paper "the wideband slope of interference channels the large bandwidth case"):
  with members:
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "interference alignment for the k user mimo interference channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "real interference alignment with real numbers"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"
    - "capacity bounds for the gaussian interference channel"
    - "approaching the capacity of wireless networks through distributed interference alignment"

Connected through hyperedge HE-8 (induced by source paper "improvement of the han kobayashi rate region for general interference channel v2"):
  with members:
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the capacity region of a class of discrete degraded interference channels"
    - "interference channels with common information"

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)