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 lattice coding scheme for secret key generation from gaussian markov tree sources"
  Abstract: In this article, we study the problem of secret key generation in the multiterminal source model, where the terminals have access to correlated Gaussian sources. We assume that the sources form a Markov chain on a tree. We give a nested lattice-based key generation scheme whose computational complexity is polynomial in the number, N , of independent and identically distributed samples observed by each source. We also compute the achievable secret key rate and give a class of examples where our scheme is optimal in the fine quantization limit. However, we also give examples that show that our scheme is not always optimal in the limit of fine quantization.

Connected through hyperedge HE-1 (induced by source paper "compressed secret key agreement maximizing multivariate mutual information per bit"):
  with members:
    - "secret key agreement under discussion rate constraints"
    - "opening the black box of deep neural networks via information"
    - "on the optimality of secret key agreement via omniscience"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
    - "duality between feature selection and data clustering"
    - "common randomness and key generation with limited interaction"
    - "info clustering a mathematical theory for data clustering"
    - "incremental and decremental secret key agreement"

Connected through hyperedge HE-2 (induced by source paper "a capacity achieving coding scheme for the awgn channel with polynomial encoding and decoding complexity"):
  with members:
    - "secure compute and forward in a bidirectional relay"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "construction of capacity achieving lattice codes polar lattices"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"
    - "low density lattice codes"

Connected through hyperedge HE-3 (induced by source paper "improving the performance of nested lattice codes using concatenation"):
  with members:
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"
    - "low density lattice codes"

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)