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: "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"
  Abstract: We consider the 3-user Gaussian interference channel and provide an outer bound on its capacity region. Under some conditions, which we call the mixed strong-very strong interference conditions, this outer bound is achievable. These conditions correspond to the case where at each receiver, one transmitter is causing strong interference and the other is causing very strong interference. Therefore, we characterize the capacity region of the 3-user interference channel with mixed strong-very strong interference.

Connected through hyperedge HE-1 (induced by source paper "three user cognitive interference channel capacity region with strong interference"):
  with members:
    - "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-2 (induced by source paper "a new sum rate outer bound for interference channels with three source destination pairs"):
  with members:
    - "on achievability of gaussian interference channel capacity to within one bit"
    - "interference channels with source cooperation"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "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"
    - "interference channel with generalized feedback a k a with source cooperation part i achievable region"
    - "lecture notes on network information theory"

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:
    - "a new sum rate outer bound for interference channels with three source destination pairs"
    - "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"
    - "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 "capacity region of k user discrete memoryless interference channels with a mixed strong very strong interference"):
  with members:
    - "two user gaussian interference channel with finite constellation input and fdma"
    - "achievable rates in two user interference channels with finite inputs and very strong interference"
    - "lecture notes on network information theory"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (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"
    - "a new sum rate outer bound for interference channels with three source destination pairs"
    - "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"
    - "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)