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 "rate adaptation for secure harq protocols"):
  Abstract: This paper investigates secure transmission using HARQ protocol when the encoder only knows the statistics of the channel-state. We analyze the tradeoff between reliability and secrecy probabilistic guarantees. The conventional approach of ensuring the secrecy via introduction of dummy-message is followed. However, unlike the previous works on this subject, we design a coding strategy tailored to HARQ by splitting the dummy-message rate over several rate parameters. These additional degrees of freedom improve the matching between the dummy-message rates and the realizations of the eavesdropper channels. We evaluate the performance in terms of secrecy outage probability, connection outage probability and secrecy throughput. For Rayleigh fading channel, the splitting of the dummy-message rate provides higher secrecy throughput and lower expected duration/average delay.

Includes members:
  Member "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "keyless covert communication via channel state information")
  Member "adaptive cross packet harq":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective capacity for renewal service processes with applications to harq systems")
  Member "harq buffer management an information theoretic view":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynamic harq with guaranteed delay")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "block fading channels with delayed csit at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized harq protocols with delayed channel state information and average latency constraints")
  Member "effective secrecy reliability confusion and stealth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")

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)