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: "side information coding with turbo codes and its application to quantum key distribution"
  Abstract: Turbo coding is a powerful class of forward error correcting codes, which can achieve performances close to the Shannon limit. The turbo principle can be applied to the problem of side-information source coding, and we investigate here its application to the reconciliation problem occurring in a continuous-variable quantum key distribution protocol.

Connected through hyperedge HE-1 (induced by source paper "nonreciprocity compensation combined with turbo codes for secret key generation in vehicular ad hoc social iot networks"):
  with members:
    - "toward efficient quantum key distribution reconciliation"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "secure key generation in sensor networks based on frequency selective channels"
    - "interactive reconciliation with low density parity check codes"

Connected through hyperedge HE-2 (induced by source paper "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "polar coding for secure transmission and key agreement"
    - "non systematic codes for physical layer security"
    - "efficient reconciliation protocol for discrete variable quantum key distribution"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "secret sharing over fast fading mimo wiretap channels"
    - "secure nested codes for type ii wiretap channels"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "problems in application of ldpc codes to information reconciliation in quantum key distribution protocols"):
  with members:
    - "efficient reconciliation protocol for discrete variable quantum key distribution"

Connected through hyperedge HE-4 (induced by source paper "efficient reconciliation of correlated continuous random variables using ldpc codes"):
  with members:
    - "reconciliation of a quantum distributed gaussian key"

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)