human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "secure coordination with a two sided helper"):
  Abstract: We investigate the problem of secure source coding with a two-sided helper in a game-theoretic framework. Alice (A) and Helen (H) view iid correlated information sequences $X^n$ and $Y^n$ respectively. Alice communicates to Bob (B) at rate $R$, while H broadcasts a message to both A and B at rate $R_H$. Additionally, A and B share secret key $K$ at rate $R_0$ that is independent of $(X^n,Y^n)$. An active adversary, Eve (E) sees all communication links while having access to a (possibly degraded) version of the past information. We characterize the rate-payoff region for this problem. We also solve the problem when the link from A to B is private. Our work recovers previous results of Schieler-Cuff and Kittichokechai et al.

Includes members:
  Member "optimal equivocation in secrecy systems a special case of distortion based characterization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gaussian secure source coding and wyner s common information")
  Member "the likelihood encoder for source coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the likelihood encoder for lossy compression")
  Member "on secure source coding with side information at the encoder":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure lossy source coding for some classes of helper and gray wyner models")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  Member "rate distortion theory for secrecy systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "using a secret key to foil an eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a large deviations approach to secure lossy compression")
  Member "multiterminal source coding under logarithmic loss":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "secure lossy source coding with side information at the decoders":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wiretap channels with random states non causally available at the encoder")

Question: Please tell me which class the source paper 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)