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: "arq secrecy from theory to practice"
  Abstract: Inspired by our earlier work on Automatic Repeat reQuest (ARQ) secrecy, we propose a simple, yet efficient, security overlay protocol to existing 802.11 networks. Our work targets networks secured by the Wired Equivalent Privacy (WEP) protocol because of its widespread use and vulnerability to a multitude of security threats. By exploiting the existing ARQ protocol in the 802.11 standard, our proposed opportunistic secrecy scheme is shown to defend against all known passive WEP attacks. Moreover, our implementation on the madwifi-ng driver is used to establish the achievability of a vanishing secrecy outage probability in several realistic scenarios.

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

Connected through hyperedge HE-2 (induced by source paper "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"):
  with members:
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "increasing physical layer security through scrambled codes and arq"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "non systematic codes for physical layer security"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "the wiretap channel with feedback encryption over the channel"

Connected through hyperedge HE-3 (induced by source paper "keys through arq theory and practice"):
  with members:
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "on the secrecy capacity of fading channels"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "increasing physical layer security through scrambled codes and arq"):
  with members:
    - "non systematic codes for physical layer security"
    - "the wiretap channel with feedback encryption over the channel"

Connected through hyperedge HE-5 (induced by source paper "arq security in wi fi and rfid networks"):
  with members:
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "on the secrecy capacity of fading 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)