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 "wiretap channel with causal state information and secure rate limited feedback"):
  Abstract: In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the legitimate transmitter and legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf . We shown that the secrecy capacity is bounded. Moreover, when the channel to the legitimate receiver is less noisy than the channel to the eavesdropper, the bound is shown to be tight. The capacity achieving scheme is based on both the Wyner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. Finally, we consider several special cases. When state information is available only at the legitimate receiver, the analysis suggests that unlike previous results involving feedback, it is better to use the feedback to send the state information to the transmitter (when possible), rather than send a random key.

Includes members:
  Member "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure degrees of freedom of one hop wireless networks with no eavesdropper csit")
  Member "physical layer security in downlink multi antenna cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "on secure communication with constrained randomization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "publicness privacy and confidentiality in the single serving quantum broadcast channel")
  Member "cognitive interference channels with confidential messages under randomness constraint":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar coding for the cognitive interference channel with confidential messages")
  Member "broadcast channels with confidential messages by randomness constrained stochastic encoder":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "secret key agreement with channel state information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "key and message semantic security over state dependent channels")
  Member "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ldpc codes over gaussian multiple access wiretap channel")
  Member "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

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)