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: "a new sum rate outer bound for interference channels with three source destination pairs"
  Abstract: This paper derives a novel sum-rate outer bound for the general memoryless interference channel with three users. The derivation is a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel. For the three-user Gaussian channel the proposed sum-rate outer bound outperforms known bounds for certain channel parameters.

Connected through hyperedge HE-1 (induced by source paper "capacity bounds for the k user gaussian interference channel"):
  with members:
    - "on the high snr capacity of the gaussian interference channel and new capacity bounds"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "the wideband slope of interference channels the large bandwidth case"

Connected through hyperedge HE-2 (induced by source paper "an outer bound for the memoryless two user interference channel with general cooperation"):
  with members:
    - "two way interference channels"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "on the symmetric feedback capacity of the k user cyclic interference channel"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with source cooperation"
    - "interference channels with rate limited feedback"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"

Connected through hyperedge HE-3 (induced by source paper "k user interference channels general outer bound and sum capacity for certain gaussian channels"):
  with members:
    - "interference channels with source cooperation"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "sum capacity of k user gaussian degraded interference channels"
    - "outer bounds for the interference channel with a cognitive relay"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "on the sum capacity of a class of cyclically symmetric deterministic interference channels"

Connected through hyperedge HE-4 (induced by source paper "on the capacity of the k user cyclic gaussian interference channel"):
  with members:
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "on the symmetric feedback capacity of the k user cyclic interference channel"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"
    - "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"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

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)