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 sum rate of a 2 x 2 interference network"
  Abstract: In an M x N interference network, there are M transmitters and N receivers with each transmitter having independent messages for each of the 2^N -1 possible non-empty subsets of the receivers. We consider the 2 x 2 interference network with 6 possible messages, of which the 2 x 2 interference channel and X channel are special cases obtained by using only 2 and 4 messages respectively. Starting from an achievable rate region similar to the Han-Kobayashi region, we obtain an achievable sum rate. For the Gaussian interference network, we determine which of the 6 messages are sufficient for maximizing the sum rate within this rate region for the low, mixed, and strong interference conditions. It is observed that 2 messages are sufficient in several cases. Finally, we show that sum capacity is achieved using only 2 messages for a subset of the mixed interference conditions.

Connected through hyperedge HE-1 (induced by source paper "on the sum capacity of the gaussian x channel in the mixed interference regime"):
  with members:
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-2 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective"):
  with members:
    - "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "interference channels with one cognitive transmitter"
    - "on the capacity of a class of mimo cognitive radios"
    - "the gaussian mac with conferencing encoders"
    - "on the capacity of interference channels with one cooperating transmitter"

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)