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: "rate compatible protocol for information reconciliation an application to qkd"
  Abstract: Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rate compatible construction of Low Density Parity Check codes. Our protocol improves the efficiency of the reconciliation for the whole range of error rates in the discrete variable QKD context. Its adaptability together with its low interactivity makes it specially well suited for QKD reconciliation.

Connected through hyperedge HE-1 (induced by source paper "toward efficient quantum key distribution reconciliation"):
  with members:
    - "efficient reconciliation of correlated continuous random variables using ldpc codes"
    - "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:
    - "efficient reconciliation of correlated continuous random variables using ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "separation of reliability and secrecy in rate limited secret key generation"):
  with members:
    - "polar coding for secret key generation"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "non asymptotic analysis of privacy amplification via renyi entropy and inf spectral entropy"
    - "efficient reconciliation protocol for discrete variable quantum key distribution"
    - "the secret key private key capacity region for three terminals"
    - "reconciliation of a quantum distributed gaussian key"

Connected through hyperedge HE-4 (induced by source paper "interactive reconciliation with low density parity check codes"):
  with members:
    - "efficient reconciliation protocol for discrete variable quantum key distribution"

Connected through hyperedge HE-5 (induced by source paper "secure rate adaptive reconciliation"):
  with members:
    - "efficient reconciliation protocol for discrete variable quantum key distribution"

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)