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: "perfectly secure steganography capacity error exponents and code constructions"
  Abstract: An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext, the resulting stegotext is required to have exactly the same probability distribution as the covertext. Then no statistical test can reliably detect the presence of the hidden message. We refer to such steganographic schemes as perfectly secure. A few such schemes have been proposed in recent literature, but they have vanishing rate. We prove that communication performance can potentially be vastly improved; specifically, our basic setup assumes independent and identically distributed (i.i.d.) covertext, and we construct perfectly secure steganographic codes from public watermarking codes using binning methods and randomized permutations of the code. The permutation is a secret key shared between encoder and decoder. We derive (positive) capacity and random-coding exponents for perfectly secure steganographic systems. The error exponents provide estimates of the code length required to achieve a target low error probability. In some applications, steganographic communication may be disrupted by an active warden, modeled here by a compound discrete memoryless channel (DMC). The transmitter and warden are subject to distortion constraints. We address the potential loss in communication performance due to the perfect-security requirement. This loss is the same as the loss obtained under a weaker order-1 steganographic requirement that would just require matching of first-order marginals of the covertext and stegotext distributions. Furthermore, no loss occurs if the covertext distribution is uniform and the distortion metric is cyclically symmetric; steganographic capacity is then achieved by randomized linear codes. Our framework may also be useful for developing computationally secure steganographic systems that have near-optimal communication performance.

Connected through hyperedge HE-1 (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"
    - "effective secrecy reliability confusion and stealth"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-2 (induced by source paper "universal covertness for discrete memoryless sources"):
  with members:
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-3 (induced by source paper "on the gold standard for security of universal steganography"):
  with members:
    - "constructing perfect steganographic systems"
    - "upper and lower bounds on black box steganography"

Connected through hyperedge HE-4 (induced by source paper "asymptotically optimum perfect universal steganography of finite memoryless sources"):
  with members:
    - "fast enumeration of combinatorial objects"

Connected through hyperedge HE-5 (induced by source paper "covert communication with channel state information at the transmitter"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "wiretap channels with random states non causally available at the encoder"
    - "covert communication over noisy channels a resolvability perspective"
    - "strong secrecy for cooperative broadcast channels"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "distributed channel synthesis"

Connected through hyperedge HE-6 (induced by source paper "computationally efficient deniable communication"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "quantum secure covert communication on bosonic channels"
    - "practical covert channels for wifi systems"
    - "lpd communication when the warden does not know when"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-7 (induced by source paper "reliable deniable and hidable communication over multipath networks"):
  with members:
    - "reliable deniable communication hiding messages in noise"
    - "effective secrecy reliability confusion and stealth"
    - "security notions for information theoretically secure encryptions"

Connected through hyperedge HE-8 (induced by source paper "reliable deniable and hidable communication over parallel link networks"):
  with members:
    - "reliable deniable communication hiding messages in noise"
    - "effective secrecy reliability confusion and stealth"

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)