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: "keys through arq theory and practice"
  Abstract: This paper develops a novel framework for sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying information theoretic limits, under different assumptions on the channel spatial and temporal correlation function. Our analysis reveals a novel role of “dumb antennas” in overcoming the negative impact of spatial correlation on the achievable secrecy rates. We further develop an adaptive rate allocation policy, which achieves higher secrecy rates in temporally correlated channels, and explicit constructions for ARQ secrecy coding that enjoy low implementation complexity. Building on this theoretical foundation, we propose a unified framework for ARQ-based secrecy in Wi-Fi networks. By exploiting the existing ARQ mechanism in the IEEE 802.11 standard, we develop security overlays that offer strong security guarantees at the expense of only minor modifications in the medium access layer. Our numerical results establish the achievability of nonzero secrecy rates even when the eavesdropper channel is less noisy, on the average, than the legitimate channel, while our Linux-based prototype demonstrates the efficiency of our ARQ overlays in mitigating all known, passive and active, Wi-Fi attacks at the expense of a minimal increase in the link setup time and a small loss in throughput.

Connected through hyperedge HE-1 (induced by source paper "a survey on wireless security technical challenges recent advances and future trends"):
  with members:
    - "relay selection for wireless communications against eavesdropping a security reliability trade off perspective"
    - "improving physical layer security in wireless communications using diversity techniques"
    - "securing physical layer communications for cognitive radio networks"
    - "secrecy outage and diversity analysis of cognitive radio systems"
    - "security versus reliability analysis of opportunistic relaying"
    - "what will 5g be"
    - "intercept probability analysis of cooperative wireless networks with best relay selection in the presence of eavesdropping attack"
    - "optimal relay selection for physical layer security in cooperative wireless networks"

Connected through hyperedge HE-2 (induced by source paper "optimization of code rates in sisome wiretap channels"):
  with members:
    - "physical layer security in downlink multi antenna cellular networks"
    - "physical layer security in cellular networks a stochastic geometry approach"
    - "on the design of artificial noise aided secure multi antenna transmission in slow fading channels"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "secret communication over broadcast erasure channels with state feedback"):
  with members:
    - "group secret key agreement over state dependent wireless broadcast channels"
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "exchanging secrets without using cryptography"
    - "completely stale transmitter channel state information is still very useful"
    - "the wiretap channel with feedback encryption over the channel"

Connected through hyperedge HE-4 (induced by source paper "practical provably secure multi node communication"):
  with members:
    - "opportunistic secrecy with a strict delay constraint"
    - "arq security in wi fi and rfid networks"
    - "arq secrecy from theory to practice"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-5 (induced by source paper "secret message transmission by harq with multiple encoding"):
  with members:
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "wireless network control with privacy using hybrid arq"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"

Connected through hyperedge HE-6 (induced by source paper "on noisy arq in block fading channels"):
  with members:
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-7 (induced by source paper "to obtain or not to obtain csi in the presence of hybrid adversary"):
  with members:
    - "jamming games in the mimo wiretap channel with an active eavesdropper"
    - "half duplex active eavesdropping in fast fading channels a block markov wyner secrecy encoding scheme"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "secure communication over fading channels"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-8 (induced by source paper "a physical layer secured key distribution technique for ieee 802 11g wireless networks"):
  with members:
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "increasing physical layer security through scrambled codes and arq"
    - "non systematic codes for physical layer security"

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)