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 lossy source coding with side information at the decoders"
  Abstract: This paper investigates the problem of secure lossy source coding in the presence of an eavesdropper with arbitrary correlated side informations at the legitimate decoder (referred to as Bob) and the eavesdropper (referred to as Eve). This scenario consists of an encoder that wishes to compress a source to satisfy the desired requirements on: (i) the distortion level at Bob and (ii) the equivocation rate at Eve. It is assumed that the decoders have access to correlated sources as side information. For instance, this problem can be seen as a generalization of the well-known Wyner-Ziv problem taking into account the security requirements. A complete characterization of the rate-distortion-equivocation region for the case of arbitrary correlated side informations at the decoders is derived. Several special cases of interest and an application example to secure lossy source coding of binary sources in the presence of binary and ternary side informations are also considered. It is shown that the statistical differences between the side information at the decoders and the presence of non-zero distortion at the legitimate decoder can be useful in terms of secrecy. Applications of these results arise in a variety of distributed sensor network scenarios.

Connected through hyperedge HE-1 (induced by source paper "wiretap channels with random states non causally available at the encoder"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "strong secrecy for cooperative broadcast channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "renyi divergence and kullback leibler divergence"
    - "distributed channel synthesis"
    - "secret key generation using correlated sources and channels"
    - "a cryptographic treatment of the wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "gaussian secure source coding and wyner s common information"):
  with members:
    - "an extremal inequality for long markov chains"
    - "secure coordination with a two sided helper"
    - "the lossy common information of correlated sources"
    - "wyner s common information generalizations and a new lossy source coding interpretation"
    - "a bit of secrecy for gaussian source compression"
    - "optimal equivocation in secrecy systems a special case of distortion based characterization"
    - "on secure source coding with side information at the encoder"
    - "distributed channel synthesis"

Connected through hyperedge HE-3 (induced by source paper "the ceo problem with secrecy constraints"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "on secure source coding with side information at the encoder"
    - "secure source coding with a public helper"
    - "rate distortion theory for secrecy systems"
    - "discriminatory lossy source coding side information privacy"
    - "multiterminal source coding under logarithmic loss"
    - "secure source coding with a helper"
    - "secure lossless compression with side information"

Connected through hyperedge HE-4 (induced by source paper "secure coordination with a two sided helper"):
  with members:
    - "optimal equivocation in secrecy systems a special case of distortion based characterization"
    - "the likelihood encoder for source coding"
    - "on secure source coding with side information at the encoder"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "using a secret key to foil an eavesdropper"
    - "multiterminal source coding under logarithmic loss"
    - "a framework for partial secrecy"

Connected through hyperedge HE-5 (induced by source paper "a rate distortion based secrecy system with side information at the decoders"):
  with members:
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "the likelihood encoder for lossy source compression"
    - "a bit of secrecy for gaussian source compression"
    - "the likelihood encoder for source coding"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "secrecy is cheap if the adversary must reconstruct"
    - "using a secret key to foil an eavesdropper"

Connected through hyperedge HE-6 (induced by source paper "secure transmission of sources over noisy channels with side information at the receivers"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "discriminatory lossy source coding side information privacy"
    - "lecture notes on network information theory"
    - "capacity regions of two new classes of 2 receiver broadcast channels"
    - "joint source channel coding with side information using hybrid digital analog codes"
    - "two way source coding with a helper"
    - "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels"

Connected through hyperedge HE-7 (induced by source paper "secure multiterminal source coding with side information at the eavesdropper"):
  with members:
    - "rate distortion with side information at many decoders"
    - "information theoretic proofs of entropy power inequalities"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "rate region of the gaussian scalar help vector source coding problem"
    - "construction of wiretap codes from ordinary channel codes"
    - "lecture notes on network information theory"
    - "secure source coding with a helper"
    - "secure lossless compression with side information"

Connected through hyperedge HE-8 (induced by source paper "on secure source coding with side information at the encoder"):
  with members:
    - "increasing smart meter privacy through energy harvesting and storage devices"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "information masking and amplification the source coding setting"
    - "broadcast channels with confidential messages by randomness constrained stochastic encoder"
    - "smart meter privacy a utility privacy framework"
    - "discriminatory lossy source coding side information privacy"
    - "multiterminal source coding under logarithmic loss"
    - "multiterminal source coding with an entropy based distortion measure"

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)