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: "interference networks with general message sets a random coding scheme"
  Abstract: In this paper, the Interference Network with General Message Sets (IN-GMS) is introduced in which several transmitters send messages to several receivers: Each subset of transmitters transmit an individual message to each subset of receivers. For such a general scenario, an achievability scheme is presented using the random coding. This scheme is systematically built based on the capacity achieving scheme for the Multiple Access Channel (MAC) with common message as well as the best known achievability scheme for the Broadcast Channel (BC) with common message. A graphical illustration of the random codebook construction procedure is also provided, by using which the achievability scheme is easily understood. Some benefits of the proposed achievability scheme are described. It is also shown that the resulting rate region is optimal for a class of orthogonal INs-GMS, which yields the capacity region. Finally, it is demonstrated that how this general achievability scheme can be used to derive capacity inner bounds for interference networks with different distribution of messages; in most cases, the proposed achievability scheme leads to the best known capacity inner bound for the underlying channel. Capacity inner bounds can also be derived for new communication scenarios.

Connected through hyperedge HE-1 (induced by source paper "capacity bounds for wireless ergodic fading broadcast channels with partial csit"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "private broadcasting over independent parallel channels"
    - "the two user gaussian fading broadcast channel"
    - "ergodic fading interference channels sum capacity and separability"
    - "a note on outer bounds for broadcast channel"
    - "fading cognitive multiple access channels with confidential messages"
    - "capacity bounds for broadcast channels with confidential messages"
    - "fading broadcast channels with state information at the receivers"

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 ii information flow in degraded networks"
    - "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers"
    - "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"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "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"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "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 ii information flow in degraded networks"
    - "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers"
    - "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"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "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 ii information flow in degraded networks"):
  with members:
    - "fundamental limits of communications in interference networks part i basic structures"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "sum capacity of k user gaussian degraded interference channels"
    - "lecture notes on network information theory"

Connected through hyperedge HE-8 (induced by source paper "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers"):
  with members:
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "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)