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: "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.

Connected through hyperedge HE-1 (induced by source paper "secure adaptive group testing"):
  with members:
    - "data aggregation over multiple access wireless sensors network"
    - "secure group testing"
    - "information theoretic bounds for adaptive sparse recovery"
    - "the capacity of non identical adaptive group testing"
    - "near optimal adaptive compressed sensing"
    - "the capacity of adaptive group testing"
    - "adaptive group testing as channel coding with feedback"
    - "boolean compressed sensing and noisy group testing"

Connected through hyperedge HE-2 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement"):
  with members:
    - "secure broadcasting using independent secret keys"
    - "finite state markov wiretap channel with delayed feedback"
    - "multiple access relay wiretap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "the secrecy rate region of the broadcast channel"
    - "source coding for a simple network with receiver side information"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-3 (induced by source paper "an improved feedback coding scheme for the wire tap channel"):
  with members:
    - "finite state markov wiretap channel with delayed feedback"
    - "secrecy results for compound wiretap channels"
    - "degraded compound multi receiver wiretap channels"

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)