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: "effective secrecy reliability confusion and stealth"
  Abstract: A security measure called effective security is defined that includes strong secrecy and stealth communication. Effective secrecy ensures that a message cannot be deciphered and that the presence of meaningful communication is hidden. To measure stealth we use resolvability and relate this to binary hypothesis testing. Results are developed for wire-tap channels and broadcast channels with confidential messages.

Connected through hyperedge HE-1 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints"):
  with members:
    - "uplink achievable rate for massive mimo systems with low resolution adc"
    - "strong secrecy from channel resolvability"
    - "secure communication over fading channels with statistical qos constraints"

Connected through hyperedge HE-2 (induced by source paper "stealthy communication over adversarially jammed multipath networks"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "embedding covert information in broadcast communications"
    - "covert communication over adversarially jammed channels"
    - "covert communication over a k user multiple access channel"
    - "quadratically constrained myopic adversarial channels"
    - "time division is optimal for covert communication over some broadcast channels"
    - "sufficiently myopic adversaries are blind"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-3 (induced by source paper "gaussian signalling for covert communications"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "covert communication over a k user multiple access channel"
    - "multipath stealth communication with jammers"
    - "covert communication in wireless relay networks"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert communication in fading channels under channel uncertainty"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-4 (induced by source paper "exact exponent for soft covering"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "second order asymptotics in covert communication"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "a stronger soft covering lemma and applications"
    - "renyi divergence and kullback leibler divergence"
    - "exact random coding error exponents of optimal bin index decoding"

Connected through hyperedge HE-5 (induced by source paper "covert secret key generation with an active warden"):
  with members:
    - "covert communication over adversarially jammed channels"
    - "stealthy secret key generation"
    - "covert communication in fading channels under channel uncertainty"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "the likelihood encoder for lossy compression"
    - "covert communication in the presence of an uninformed jammer"
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-6 (induced by source paper "first and second order asymptotics in covert communication"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "finite blocklength bounds for wiretap channels"
    - "optimal throughput for covert communication over a classical quantum channel"
    - "a stronger soft covering lemma and applications"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "reliable deniable communication hiding messages in noise"

Connected through hyperedge HE-7 (induced by source paper "steganography protocols for quantum channels"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert wireless communication with artificial noise generation"
    - "covert communication in the presence of an uninformed jammer"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "achievability proof via output statistics of random binning"
    - "perfectly secure steganography capacity error exponents and code constructions"

Connected through hyperedge HE-8 (induced by source paper "learning requirements for stealth attacks"):
  with members:
    - "stealth attacks on the smart grid"
    - "information theoretic attacks in the smart grid"
    - "sparse attack construction and state estimation in the smart grid centralized and distributed models"

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)