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

Connected through hyperedge HE-1 (induced by source paper "adaptive cross packet harq"):
  with members:
    - "how to boost the throughput of harq with off the shelf codes"
    - "harq and amc friends or foes"
    - "harq buffer management an information theoretic view"
    - "delayed channel state information incremental redundancy with backtrack retransmission"
    - "block fading channels with delayed csit at finite blocklength"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "mimo arq with multi bit feedback outage analysis"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

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)