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 the 2 user gaussian mac interfering with a p2p link"
  Abstract: A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases. These cases are mainly when interference is strong or very strong. A sum capacity upper bound is also obtained, which is nearly tight if the interference power at the receivers is low. In this case, using Gaussian codes and treating interference as noise achieves a sum rate close to the upper bound.

Connected through hyperedge HE-1 (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 multiple access z interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "a unified theory of multiple access and interference channels via approximate capacity regions for 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"
    - "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"
    - "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 multiple access z interference channels"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "the deterministic sum capacity of a multiple access channel interfering with a point to point link"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "on interference alignment and the deterministic capacity for cellular channels with weak symmetric cross links"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (induced by source paper "interference alignment and neutralization in a cognitive 3 user mac interference channel degrees of freedom"):
  with members:
    - "on gaussian multiple access channels with interference achievable rates and upper bounds"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "aligned interference neutralization and the degrees of freedom of the 2x2x2 interference channel"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-8 (induced by source paper "on the capacity of multiple access z interference channels"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on a class of discrete memoryless broadcast interference channels"
    - "on interference alignment and the deterministic capacity for cellular channels with weak symmetric cross links"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "lattice strategies for the dirty multiple access channel"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "on polar polytopes and the recovery of sparse representations"

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)