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: "a rate distortion based secrecy system with side information at the decoders"
  Abstract: A secrecy system with side information at the decoders is studied in the context of lossy source compression over a noiseless broadcast channel. The decoders have access to different side information sequences that are correlated with the source. The fidelity of the communication to the legitimate receiver is measured by a distortion metric, as is traditionally done in the Wyner-Ziv problem. The secrecy performance of the system is also evaluated under a distortion metric. An achievable rate-distortion region is derived for the general case of arbitrarily correlated side information. Exact bounds are obtained for several special cases in which the side information satisfies certain constraints. An example is considered in which the side information sequences come from a binary erasure channel and a binary symmetric channel.

Connected through hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "stealthy secret key generation"
    - "wiretap channels with causal state information strong secrecy"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-2 (induced by source paper "strong secrecy for cooperative broadcast channels"):
  with members:
    - "broadcast channels with privacy leakage constraints"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "on state dependent broadcast channels with cooperation"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"

Connected through hyperedge HE-3 (induced by source paper "the likelihood encoder for lossy compression"):
  with members:
    - "joint source channel secrecy using hybrid coding"
    - "a generalized typicality for abstract alphabets"
    - "the likelihood encoder for lossy source compression"
    - "a technique for deriving one shot achievability results in network information theory"
    - "non asymptotic output statistics of random binning and its applications"
    - "a connection between good rate distortion codes and backward dmcs"
    - "the likelihood encoder for source coding"
    - "distributed channel synthesis"

Connected through hyperedge HE-4 (induced by source paper "semantic security capacity for wiretap channels of type ii"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "the likelihood encoder for lossy compression"
    - "soft covering with high probability"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "semantically secure coding scheme achieving the capacity of a gaussian wiretap channel"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "the likelihood encoder for lossy source compression"
    - "informational divergence approximations to product distributions"

Connected through hyperedge HE-5 (induced by source paper "joint source channel secrecy using hybrid coding"):
  with members:
    - "rate distortion based physical layer secrecy with applications to multimode fiber"
    - "the likelihood encoder for lossy source compression"
    - "the likelihood encoder for source coding"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "hybrid coding an interface for joint source channel coding and network communication"
    - "source channel secrecy with causal disclosure"
    - "secrecy is cheap if the adversary must reconstruct"

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)