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 lossy source channel wiretapping with side information at the receiving terminals"):
  Abstract: The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it through a noisy channel to a legitimate receiver (referred to as Bob). In this context, Alice must simultaneously satisfy the desired requirements on the distortion level at Bob, and the equivocation rate at the eavesdropper (referred to as Eve). This setting can be seen as a generalization of the conventional problems of secure source coding with side information at the decoders, and the wiretap channel. Inner and outer bounds on the rate-distortion-equivocation region for the case of arbitrary channels and side informations are derived. In some special cases of interest, it is shown that separation holds. By means of an appropriate coding, the presence of any statistical difference among the side informations, the channel noises, and the distortion at Bob can be fully exploited in terms of secrecy.

Includes members:
  Member "secure lossy source coding with side information at the decoders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wiretap channels with random states non causally available at the encoder")
  Member "secure source coding with a helper":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of remaining uncertainties and exponents under various conditional r e nyi entropies")
  Member "capacity regions of two new classes of 2 receiver broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "comparison of channels criteria for domination by a symmetric channel")
  Member "secure lossless compression with side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "lossless compression with security constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure broadcasting using independent secret keys")
  Member "on the shannon cipher system with a capacity limited key distribution channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a large deviations approach to secure lossy compression")

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)