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 k user interference channel strong interference regime"
  Abstract: This paper presents a solution for one of the open problems in network information theory: “What is the generalization of the strong interference regime to the K-user interference channel?” A new approach is developed based on which one can obtain strong interference regimes not only for the multi-user interference channels but also for other interference networks with any arbitrary topology. To this development, some new lemmas are proved which have a central role in our derivations. As a result, this paper establishes the first non-trivial capacity result for the general multi-user classical interference channel (for both discrete and Gaussian channels).

Connected through hyperedge HE-1 (induced by source paper "novel outer bounds and capacity results for the interference channel with conferencing receivers"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "on the capacity region of the two user interference channel"
    - "an outer bound for the memoryless two user interference channel with general cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "interference mitigation through limited receiver cooperation"
    - "compound multiple access channels with partial cooperation"
    - "on the symmetric gaussian interference channel with partial unidirectional cooperation"

Connected through hyperedge HE-2 (induced by source paper "on the capacity region of the two user interference channel"):
  with members:
    - "on the sum capacity of the discrete memoryless interference channel with one sided weak interference and mixed interference"
    - "how much rate splitting is required for a random coding scheme a new achievable rate region for the broadcast channel with cognitive relays"
    - "fundamental limits of communications in interference networks part i basic structures"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "interference networks with general message sets a random coding scheme"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian 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)