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: "on the capacity of multiple access z interference channels"
  Abstract: The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, we attain a line segment on the boundary of the capacity region. Moreover, the capacity region for the Gaussian channel is identified for the case when one interference link being strong, and the other being very strong. For a subclass of Gaussian channels with mixed interference, a boundary point of the capacity region is determined. Finally, for the Gaussian channel with weak interference, sum capacities are obtained under various channel coefficient and power constraint conditions.

Connected through hyperedge HE-1 (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"
    - "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"
    - "new outer bounds on the capacity region of gaussian interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "approximate capacity region of the mac ic mac"):
  with members:
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "wireless network information flow a deterministic approach"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "sub optimality of treating interference as noise in the cellular uplink with weak interference"):
  with members:
    - "on the optimality of treating interference as noise general message sets"
    - "extended generalized dof optimality regime of treating interference as noise in the x channel"
    - "on the optimality of treating interference as noise"
    - "achievable and crystallized rate regions of the interference channel with interference as noise"
    - "the deterministic sum capacity of a multiple access channel interfering with a point to point link"
    - "interference alignment and neutralization in a cognitive 3 user mac interference channel degrees of freedom"
    - "sub optimality of treating interference as noise in the cellular uplink"
    - "rate region frontiers for n user interference channel with interference as noise"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of communications in interference networks part i basic structures"):
  with members:
    - "on the sum capacity of the discrete memoryless interference channel with one sided weak interference and mixed interference"
    - "on marton s inner bound for broadcast channels"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "interference networks with general message sets a random coding scheme"
    - "a new capacity result for the z gaussian cognitive interference channel"

Connected through hyperedge HE-5 (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"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region"
    - "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)