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: "secure wireless communication under spatial and local gaussian noise assumptions"
  Abstract: We consider wireless communication between Alice and Bob when the intermediate space between Alice and Bob is controlled by Eve. That is, our model divides the channel noise into two parts, the noise generated during the transmission and the noise generated in the detector. Eve is allowed to control the former, but is not allowed to do the latter. While the latter is assumed to be a Gaussian random variable, the former is not assumed to be a Gaussian random variable. In this situation, using backward reconciliation and the random sampling, we propose a protocol to generate secure keys between Alice and Bob under the assumption that Eve's detector has a Gaussian noise and Eve is out of Alice's neighborhood. In our protocol, the security criteria are quantitatively guaranteed even with finite block-length code based on the evaluation of error of the estimation of channel.

Connected through hyperedge HE-1 (induced by source paper "two way physical layer security protocol for gaussian channels"):
  with members:
    - "semi finite length analysis for information theoretic tasks"
    - "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"
    - "physical layer security for rf satellite channels in the finite length regime"
    - "wiretap channels nonasymptotic fundamental limits"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "numerical study on secrecy capacity and code length dependence of the performances in optical wiretap channels"
    - "the wiretap channel with generalized feedback secure communication and key generation"
    - "secret key agreement general capacity and second order asymptotics"

Connected through hyperedge HE-2 (induced by source paper "physical layer security protocol for poisson channels for passive man in the middle attack"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "physical layer security for rf satellite channels in the finite length regime"
    - "signal detection under short interval sampling of continuous waveforms for optical wireless scattering communication"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "numerical study on secrecy capacity and code length dependence of the performances in optical wiretap channels"
    - "5g wireless backhaul networks challenges and research advances"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strongly secure communications over the two way wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "physical layer security for rf satellite channels in the finite length regime"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "free space optical channel estimation for physical layer security"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "information theoretic physical layer security for satellite channels"
    - "empirical and strong coordination via soft covering with polar codes"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "joint power control in wiretap interference channels"
    - "secrecy analysis on network coding in bidirectional multibeam satellite communications"

Connected through hyperedge HE-4 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes"):
  with members:
    - "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "coding across unicast sessions can increase the secure message capacity"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "on secure network coding for two unicast sessions studying butterflies"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "coding against a limited view adversary the effect of causality and feedback"

Connected through hyperedge HE-5 (induced by source paper "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"):
  with members:
    - "secure network code for adaptive and active attacks with no randomness in intermediate nodes"
    - "universal construction of cheater identifiable secret sharing against rushing cheaters without honest majority"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "coding against a limited view adversary the effect of causality and feedback"
    - "non asymptotic and asymptotic analyses of information processing on markov chains"

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)