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: "the effect of eavesdropper s statistics in experimental wireless secret key generation"
  Abstract: This paper investigates the role of the eavesdropper's statistics in the implementation of a practical secret-key generation system. We carefully conduct the information-theoretic analysis of a secret-key generation system from wireless channel gains measured with software-defined radios. In particular, we show that it is inaccurate to assume that the eavesdropper gets no information because of decorrelation with distance. We also provide a bound for the achievable secret-key rate in the finite key-length regime that takes into account the presence of correlated eavesdropper's observations. We evaluate this bound with our experimental gain measurements to show that operating with a finite number of samples incurs a loss in secret-key rate on the order of 20%.

Connected through hyperedge HE-1 (induced by source paper "group secret key generation using algebraic rings in three user wireless networks"):
  with members:
    - "insider attacks on physical layer group secret key generation in wireless networks"
    - "secret key generation from gaussian sources using lattice hashing"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "information theoretically secret key generation for fading wireless channels"
    - "two hop secure communication using an untrusted relay"
    - "group secret key generation algorithms"

Connected through hyperedge HE-2 (induced by source paper "the passive eavesdropper affects my channel secret key rates under real world conditions extended version"):
  with members:
    - "exploiting channel diversity in secret key generation from multipath fading randomness"

Connected through hyperedge HE-3 (induced by source paper "performance of lattice coset codes on universal software radio peripherals"):
  with members:
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap 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)