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 gaussian multiple access channels with interference achievable rates and upper bounds"
  Abstract: We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the sum capacity is derived under a less restricting definition of very strong interference. Finally, a general upper bound on the sum capacity is provided, which is nearly tight for weak cross links.

Connected through hyperedge HE-1 (induced by source paper "degrees of freedom and achievable rate of wide band multi cell multiple access channels with no csit"):
  with members:
    - "interference free ofdm rethinking ofdm for interference networks with inter symbol interference"
    - "spectral efficiency of dynamic coordinated beamforming a stochastic geometry approach"
    - "topological interference management through index coding"
    - "a practical cooperative multicell mimo ofdma network based on rank coordination"
    - "opportunistic interference alignment for mimo interfering multiple access channels"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "not too delayed csit achieves the optimal degrees of freedom"
    - "a new outer bound via interference localization and the degrees of freedom regions of mimo interference networks with no csit"

Connected through hyperedge HE-2 (induced by source paper "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"):
  with members:
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "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"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (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-4 (induced by source paper "sub optimality of treating interference as noise in the cellular uplink"):
  with members:
    - "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"
    - "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-5 (induced by source paper "interference alignment and neutralization in a cognitive 3 user mac interference channel degrees of freedom"):
  with members:
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "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"

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)