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: "fundamental limits of communications in interference networks part iii information flow in strong interference regime"
  Abstract: This third part of the paper is related to the study of information flow in networks with strong interference. First, the two-receiver networks are considered. A unified outer bound for the capacity region of these networks is established. It is shown that this outer bound can be systematically translated into simple capacity outer bounds for special cases such as the two-user Classical Interference Channel (CIC) and the Broadcast Channel with Cognitive Relays (BCCR) with common information. For these channels, special cases are presented where our outer bounds are tight, which yield the exact capacity. More importantly, by using the derived outer bounds, a strong interference regime is identified for the general two-receiver interference networks with any arbitrary topology. This strong interference regime, which is represented by only two conditions, includes all previously known results for simple topologies such as the two-user CIC, the cognitive radio channel, and many others. Then, networks with arbitrary number of receivers are considered. Finding non-trivial strong interference regime for such networks, specifically for the CICs with more than two users, has been one of the open problems in network information theory. In this paper, we will give a solution to this problem. Specifically, a new approach is developed based on which one can obtain strong interference regimes not only for the multi-user CICs but also for any interference network of arbitrary large sizes. For this development, some new technical lemmas are proved which have a central role in the derivations. As a result, this paper establishes the first non-trivial capacity result for the multi-user classical interference channel. A general formula is also presented to derive strong interference conditions for any given network topology.

Connected through hyperedge HE-1 (induced by source paper "the k user interference channel strong interference regime"):
  with members:
    - "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"
    - "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers"
    - "interference networks with general message sets a random coding scheme"
    - "lecture notes on network information theory"
    - "capacity of symmetric k user gaussian very strong interference channels"

Connected through hyperedge HE-2 (induced by source paper "interference alignment with diversity for the 2 times 2 x network with four antennas"):
  with members:
    - "maximum rate transmission with improved diversity gain for interference networks"
    - "a nonlinear approach to interference alignment"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "how much rate splitting is required for a random coding scheme a new achievable rate region for the broadcast channel with cognitive relays"):
  with members:
    - "capacity theorems for the cognitive radio channel with confidential messages"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "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"
    - "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers"
    - "interference networks with general message sets a random coding scheme"
    - "capacity bounds and exact results for the cognitive z interference channel"
    - "on the capacity of a class of cognitive z interference channels"

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)