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: "on secure source coding with side information at the encoder"
  Abstract: We consider a secure source coding problem with side information (S.I.) at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate limited link to a legitimate decoder. The message sent is also observed by the eavesdropper. The encoder aims to minimize both the distortion incurred by the legitimate decoder; and the information leakage rate at the eavesdropper. When the encoder has access to the uncoded S.I. at the decoder, we characterize the rate-distortion-information leakage rate (R.D.I.) region under a Markov chain assumption and when S.I. at the encoder does not improve the rate-distortion region as compared to the case when S.I. is absent. When the decoder also has access to the eavesdroppers S.I., we characterize the R.D.I. region without the Markov Chain condition. We then consider a related setting where the encoder and decoder obtain coded S.I. through a rate limited helper, and characterize the R.D.I. region for several special cases, including special cases under logarithmic loss distortion and for special cases of the Quadratic Gaussian setting. Finally, we consider the amplification measures of list or entropy constraint at the decoder, and show that the R.D.I. regions for the settings considered in this paper under these amplification measures coincide with R.D.I. regions under per symbol logarithmic loss distortion constraint at the decoder.

Connected through hyperedge HE-1 (induced by source paper "secure lossy source coding for some classes of helper and gray wyner models"):
  with members:
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "secure source coding with a public helper"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "secure lossless compression with side information"
    - "on the secure degrees of freedom of wireless x networks"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-2 (induced by source paper "privacy constrained remote source coding"):
  with members:
    - "lossless secure source coding yamamoto s setting"
    - "from the information bottleneck to the privacy funnel"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "rate distortion theory for secrecy systems"
    - "privacy against statistical inference"
    - "discriminatory lossy source coding side information privacy"
    - "multiterminal source coding under logarithmic loss"

Connected through hyperedge HE-3 (induced by source paper "secret key generation through a relay"):
  with members:
    - "common randomness and key generation with limited interaction"
    - "secure communication via an untrusted non regenerative relay in fading channels"
    - "common information and secret key capacity"
    - "strongly secure communications over the two way wiretap channel"
    - "rate regions of secret key sharing in a new source model"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "secret key agreement from correlated gaussian sources by rate limited public communication"
    - "multiterminal source coding with complementary delivery"

Connected through hyperedge HE-4 (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"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"

Connected through hyperedge HE-5 (induced by source paper "the ceo problem with secrecy constraints"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "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 lossy source coding with side information at the decoders"
    - "secure source coding with a helper"
    - "secure lossless compression with side information"

Connected through hyperedge HE-6 (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"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "using a secret key to foil an eavesdropper"
    - "multiterminal source coding under logarithmic loss"
    - "secure lossy source coding with side information at the decoders"
    - "a framework for partial secrecy"

Connected through hyperedge HE-7 (induced by source paper "secure source coding with a public helper"):
  with members:
    - "secure coordination with a two sided helper"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "rate distortion theory for secrecy systems"
    - "information masking and amplification the source coding setting"
    - "multiterminal source coding under logarithmic loss"
    - "cascade triangular and two way source coding with degraded side information at the second user"
    - "a framework for partial secrecy"

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)