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 "secrecy capacity of a class of orthogonal relay eavesdropper channels"):
  Abstract: The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multiantenna point-to-point channel with a multiantenna eavesdropper. The outer bounds are shown to be tight for two subclasses of channels. The first subclass is one in which the source and relay are clustered, and the eavesdropper receives signals only on the channel from the source and the relay to the destination, for which the PDF strategy is optimal. The second is a subclass in which the source does not transmit to the relay, for which a noise-forwarding strategy is optimal.

Includes members:
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi antenna jamming in covert communication")
  Member "secure communication over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")
  Member "a note on the secrecy capacity of the multi antenna wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the secrecy rate region of a fading multiple antenna gaussian broadcast channel with confidential messages and partial csit")
  Member "the mimome channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "strongly secure communications over the two way wiretap channel")
  Member "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "the general gaussian multiple access and two way wire tap channels achievable rates and cooperative jamming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure transmission on the two hop relay channel with scaled compute and forward")
  Member "the relay eavesdropper channel cooperation for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint relay and jammer selection for secure two way relay networks")
  Member "relay channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the security analysis of a cooperative incremental relaying protocol in the presence of an active eavesdropper")

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)