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 channels with common information"
  Abstract: In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an achievable rate region for such a channel by exploiting a random coding strategy, namely cascaded superposition coding. We reveal that the derived achievable rate region generalizes some important existing results for the interference channels with or without common information. Furthermore, we specialize to a class of deterministic interference channels with common information, and show that the derived achievable rate region is indeed the capacity region for this class of channels.

Connected through hyperedge HE-1 (induced by source paper "caching in heterogeneous networks with per file rate constraints"):
  with members:
    - "ultra reliable uav communication using altitude and cooperation diversity"
    - "degrees of freedom of cache aided wireless interference networks"
    - "caching in the sky proactive deployment of cache enabled unmanned aerial vehicles for optimized quality of experience"
    - "cache aided interference channels"
    - "living on the edge the role of proactive caching in 5g wireless networks"

Connected through hyperedge HE-2 (induced by source paper "polar coding for the cognitive interference channel with confidential messages"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "secure polar coding for the two way wiretap channel"
    - "polar codes for broadcast channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for secret key generation"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "universal polar codes"

Connected through hyperedge HE-3 (induced by source paper "degrees of freedom of the mimo 2x2 interference network with general message sets"):
  with members:
    - "degrees of freedom region of the mimo x channel with an arbitrary number of antennas"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "degrees of freedom of the mimo interference channel with cooperation and cognition"

Connected through hyperedge HE-4 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective"):
  with members:
    - "on the sum rate of a 2 x 2 interference network"
    - "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "interference channels with one cognitive transmitter"
    - "on the capacity of a class of mimo cognitive radios"
    - "the gaussian mac with conferencing encoders"

Connected through hyperedge HE-5 (induced by source paper "asymptotic scheduling gains in point to multipoint cognitive networks"):
  with members:
    - "rate of channel hardening of antenna selection diversity schemes and its implication on scheduling"
    - "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors"
    - "cognitive medium access exploration exploitation and competition"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-6 (induced by source paper "independent signaling achieves the capacity region of the gaussian interference channel with common information to within one bit"):
  with members:
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "improvement of the han kobayashi rate region for general interference channel v2"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (induced by source paper "bounds and capacity theorems for cognitive interference channels with state"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-8 (induced by source paper "cognitive interference channels with confidential messages under randomness constraint"):
  with members:
    - "broadcast channels with confidential messages by randomness constrained stochastic encoder"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strong secrecy from channel resolvability"
    - "capacity results for relay channels with confidential messages"
    - "cognitive radio an information theoretic perspective"

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)