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: "performance of lattice coset codes on a usrp testbed"
  Abstract: We consider an experimental setup of three USRPs that implement a wiretap channel, two USRPs are the legitimate players Alice and Bob, while the third USRP is the eavesdropper, whose position we vary to evaluate information leakage. The experimented channels are close to slow fading channels, and coset coding of lattice constellations is used for transmission, allowing to introduce controlled randomness at the transmitter. Simulation and measurement results show to which extent coset coding can provide confidentiality, as a function of Eve's position, and the amount of randomness used.

Connected through hyperedge HE-1 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels"):
  with members:
    - "on analytical and geometric lattice design criteria for wiretap coset codes"
    - "well rounded lattices for coset coding in mimo wiretap channels"
    - "information bounds and flatness factor approximation for fading wiretap mimo channels"
    - "theta series approximation with applications to compute and forward relaying"
    - "well rounded lattices for reliability and security in rayleigh fading siso channels"
    - "decoding in compute and forward relaying real lattices and the flatness of lattice sums"
    - "almost universal codes for fading wiretap channels"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"

Connected through hyperedge HE-2 (induced by source paper "on analytical and geometric lattice design criteria for wiretap coset codes"):
  with members:
    - "well rounded lattices for reliability and security in rayleigh fading siso channels"
    - "decoding in compute and forward relaying real lattices and the flatness of lattice sums"
    - "almost universal codes for fading wiretap channels"
    - "locally diverse constellations from the special orthogonal group"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "inverse determinant sums and connections between fading channel information theory and algebra"

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)