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 ii information flow in degraded networks"
  Abstract: In this second part of our multi-part papers, the information flow in degraded interference networks is studied. A full characterization of the sum-rate capacity for the degraded networks with any possible configuration is established. It is shown that a successive decoding scheme is sum-rate optimal for these networks. Also, it is proved that the transmission of only a certain subset of messages is sufficient to achieve the sum-rate capacity in such networks. Algorithms are presented to determine this subset of messages explicitly. According to these algorithms, the optimal strategy to achieve the sum-rate capacity in degraded networks is that the transmitters try to send information for the stronger receivers and, if possible, avoid sending the messages with respect to the weaker receivers. The algorithms are easily understood using our graphical illustrations for the achievability schemes based on directed graphs. The sum-rate expression for the degraded networks is then used to derive a unified outer bound on the sum-rate capacity of arbitrary non-degraded networks. Several variations of the degraded networks are identified for which the derived outer bound is sum-rate optimal. Specifically, noisy interference regimes are derived for certain classes of multi-user/multi-message interference networks. Also, for the first time, network scenarios are identified where the incorporation of both successive decoding and treating interference as noise achieves their sum-rate capacity. Finally, by taking insight from our results for degraded networks, we establish a unified outer bound on the entire capacity region of the general interference networks. These outer bounds for a broad range of network scenarios are tighter than the existing cut-set bound.

Connected through hyperedge HE-1 (induced by source paper "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"):
  with members:
    - "capacity bounds for wireless ergodic fading broadcast channels with partial csit"
    - "fundamental limits of communications in interference networks part i basic structures"
    - "ergodic fading interference channels sum capacity and separability"
    - "interference mitigation through limited transmitter cooperation"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "a general coding scheme for two user fading interference channels"
    - "interference mitigation through limited receiver cooperation"
    - "outage analysis of block fading gaussian interference channels"

Connected through hyperedge HE-2 (induced by source paper "the k user interference channel strong interference regime"):
  with members:
    - "fundamental limits of communications in interference networks part iii information flow in strong interference regime"
    - "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 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-3 (induced by source paper "on the capacity region of the two user interference channel"):
  with members:
    - "the k user interference channel strong interference regime"
    - "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"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of communications in interference networks part i basic structures"):
  with members:
    - "on the sum capacity of the discrete memoryless interference channel with one sided weak interference and mixed interference"
    - "on marton s inner bound for broadcast channels"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "interference networks with general message sets a random coding scheme"
    - "a new capacity result for the z gaussian cognitive interference channel"
    - "an achievable rate region for cognitive radio channel with common message"

Connected through hyperedge HE-5 (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:
    - "fundamental limits of communications in interference networks part iii information flow in strong interference regime"
    - "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 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"

Connected through hyperedge HE-6 (induced by source paper "capacity theorems for the cognitive radio channel with confidential messages"):
  with members:
    - "cognitive interference channels with confidential messages under randomness constraint"
    - "interference networks with general message sets a random coding scheme"
    - "interference channels with one cognitive transmitter"
    - "capacity bounds for broadcast channels with confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-7 (induced by source paper "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers"):
  with members:
    - "interference networks with general message sets a random coding scheme"
    - "lecture notes on network information theory"

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)