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: "efficient reconciliation of correlated continuous random variables using ldpc codes"
  Abstract: This paper investigates an efficient and practical information reconciliation method in the case where two parties have access to correlated continuous random variables. We show that reconciliation is a special case of channel coding and that existing coded modulation techniques can be adapted for reconciliation. We describe an explicit reconciliation method based on LDPC codes in the case of correlated Gaussian variables. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on continuous-spectrum quantum states.

Connected through hyperedge HE-1 (induced by source paper "toward efficient quantum key distribution reconciliation"):
  with members:
    - "rate compatible protocol for information reconciliation an application to qkd"
    - "reconciliation of a quantum distributed gaussian key"

Connected through hyperedge HE-2 (induced by source paper "performance of a reconciliation method operating on a discreet quantum key distribution system"):
  with members:
    - "rate compatible protocol for information reconciliation an application to qkd"

Connected through hyperedge HE-3 (induced by source paper "efficient reconciliation protocol for discrete variable quantum key distribution"):
  with members:
    - "reconciliation of a quantum distributed gaussian key"

Connected through hyperedge HE-4 (induced by source paper "wireless information theoretic security part i theoretical aspects"):
  with members:
    - "secret key and private key constructions for simple multiterminal source models"
    - "secure communication over fading channels"
    - "the gaussian multiple access wire tap channel with collective secrecy constraints"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "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)