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: "secret key agreement by soft decision of signals in gaussian maurer s model"
  Abstract: We consider the problem of secret key agreement in Gaussian Maurer's Model. In Gaussian Maurer's model, legitimate receivers, Alice and Bob, and a wire-tapper, Eve, receive signals randomly generated by a satellite through three independent memoryless Gaussian channels respectively. Then Alice and Bob generate a common secret key from their received signals. In this model, we propose a protocol for generating a common secret key by using the result of soft-decision of Alice and Bob's received signals. Then, we calculate a lower bound on the secret key rate in our proposed protocol. As a result of comparison with the protocol that only uses hard-decision, we found that the higher rate is obtained by using our protocol.

Connected through hyperedge HE-1 (induced by source paper "stealthy secret key generation"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "informational divergence approximations to product distributions"
    - "effective secrecy reliability confusion and stealth"
    - "secret key agreement from correlated gaussian sources by rate limited public communication"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-2 (induced by source paper "exponential decreasing rate of leaked information in universal random privacy amplification"):
  with members:
    - "commitment capacity of discrete memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "secret key agreement from correlated gaussian sources by rate limited public communication"):
  with members:
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "multiple input multiple output gaussian broadcast channels with confidential messages"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "reconciliation of a quantum distributed gaussian key"

Connected through hyperedge HE-4 (induced by source paper "strongly secure privacy amplification cannot be obtained by encoder of slepian wolf code"):
  with members:
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

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)