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: "finite state markov wiretap channel with delayed feedback"
  Abstract: The mobile wireless communication channel is often modeled as a finite state Markov channel (FSMC). In this paper, we study the security issue in the mobile wireless communication systems by considering the FSMC with an eavesdropper, which we call the finite state Markov wiretap channel (FSM-WC). More specifically, the FSM-WC is a channel with one input (the transmitter) and two outputs (the legitimate receiver and the eavesdropper). The transition probability of the FSM-WC is controlled by a channel state which takes values in a finite set, and it undergoes a Markov process. We assume that the state is perfectly known by the legitimate receiver and the eavesdropper, and through a noiseless feedback channel, the legitimate receiver sends its output and the state back to the transmitter after some time delay. The main contribution of this paper is as follows. First, we provide inner and outer bounds on the capacity-equivocation region of the FSM-WC with only delayed state feedback, and we show that these bounds meet for the degraded case (the channel output for the eavesdropper is a degraded version of that for the legitimate receiver). Second, inner and outer bounds on the capacity-equivocation region of the FSM-WC with delayed state and legitimate receiver's output feedback are provided, and we also show that these bounds meet for the degraded case. Third, Unlike the fact that the receiver's delayed output feedback does not increase the capacity of the FSMC with only delayed state feedback, we find that for the degraded case, the legitimate receiver's delayed output feedback enhances the capacity-equivocation region of the FSM-WC with only delayed state feedback. The above results are further explained via degraded Gaussian and Gaussian fading examples.

Connected through hyperedge HE-1 (induced by source paper "secure polar coding with delayed wiretapping information"):
  with members:
    - "secure polar coding for the two way wiretap channel"
    - "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 the general wiretap channel"
    - "secrecy results for compound wiretap channels"
    - "polar coding for secret key generation"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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"
    - "multiple access relay wiretap channel"
    - "wiretap channel with causal state information and secure rate limited feedback"
    - "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 "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver"):
  with members:
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy results for compound wiretap channels"
    - "capacity results for arbitrarily varying wiretap channels"

Connected through hyperedge HE-4 (induced by source paper "an improved feedback coding scheme for the wire tap channel"):
  with members:
    - "wiretap channel with causal state information and secure rate limited feedback"
    - "secrecy results for compound wiretap channels"
    - "degraded compound multi receiver wiretap channels"

Connected through hyperedge HE-5 (induced by source paper "finite state multiple access wiretap channel with delayed feedback"):
  with members:
    - "secret key agreement with channel state information at the transmitter"
    - "the gaussian multiple access wire tap channel"

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)