human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "capacity theorems for the cognitive radio channel with confidential messages"):
  Abstract: As a brain inspired wireless communication scheme, cognitive radio is a novel approach to promote the efficient use of the scarce radio spectrum by allowing some users called cognitive users to access the under-utilized spectrum licensed out to the primary users. Besides highly reliable communication and efficient utilization of the radio spectrum, the security of information transmission against eavesdropping is critical in the cognitive radios for many potential applications. In this paper, this problem is investigated from an information theoretic viewpoint. Capacity limits are explored for the Cognitive Radio Channel (CRC) with confidential messages. As an idealized information theoretic model for the cognitive radio, this channel includes two transmitters which send independent messages to their corresponding receivers such that one transmitter, i.e., the cognitive transmitter, has access non-causally to the message of the other transmitter, i.e., the primary transmitter. The message designated to each receiver is required to be kept confidential with respect to the other receiver. The secrecy level for each message is evaluated using the equivocation rate. Novel inner and outer bounds for the capacity-equivocation region are established. It is shown that these bounds coincide for some special cases. Specifically, the capacity-equivocation region is derived for a class of less-noisy CRCs and also a class of semi-deterministic CRCs. For the case where only the message of the cognitive transmitter is required to be kept confidential, the capacity-equivocation region is also established for the Gaussian CRC with weak interference.

Includes members:
  Member "cognitive interference channels with confidential messages under randomness constraint":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar coding for the cognitive interference channel with confidential messages")
  Member "fundamental limits of communications in interference networks part ii information flow in degraded networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit")
  Member "interference networks with general message sets a random coding scheme":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity bounds for wireless ergodic fading broadcast channels with partial csit")
  Member "interference channels with one cognitive transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective")
  Member "capacity bounds for broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "on the capacity of interference channels with one cooperating transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "cognitive radio an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cognitive radio networks an information theoretic perspective")

Question: Please tell me which class the source paper 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)