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: "a physical layer secured key distribution technique for ieee 802 11g wireless networks"
  Abstract: Key distribution and renewing in wireless local area networks is a crucial issue to guarantee that unauthorized users are prevented from accessing the network. In this paper, we propose a technique for allowing an automatic bootstrap and periodic renewing of the network key by exploiting physical layer security principles, that is, the inherent differences among transmission channels. The proposed technique is based on scrambling of groups of consecutive packets and does not need the use of an initial authentication nor automatic repeat request protocols. We present a modification of the scrambling circuits included in the IEEE 802.11g standard which allows for a suitable error propagation at the unauthorized receiver, thus achieving physical layer security.

Connected through hyperedge HE-1 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages"):
  with members:
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "broadcast channels with confidential messages by randomness constrained stochastic encoder"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "increasing physical layer security through scrambled codes and arq"
    - "secure broadcasting over fading channels with statistical qos constraints"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "non systematic codes for physical layer security"

Connected through hyperedge HE-2 (induced by source paper "secrecy transmission on block fading channels theoretical limits and performance of practical codes"):
  with members:
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "increasing physical layer security through scrambled codes and arq"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "coding for cryptographic security enhancement using stopping sets"

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)