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 transmission of sources over noisy channels with side information at the receivers"):
  Abstract: This paper investigates the problem of source-channel coding for secure transmission with arbitrarily correlated side informations at both receivers. 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 problems of secure source coding with (uncoded) side information at the decoders and the wiretap channel. A general outer bound on the rate-distortion-equivocation region, as well as an inner bound based on a pure digital scheme, is derived for arbitrary channels and side informations. In some special cases of interest, it is proved that this digital scheme is optimal and that separation holds. However, it is also shown through a simple counterexample with a binary source that a pure analog scheme can outperform the digital one while being optimal. According to these observations and assuming matched bandwidth, a novel hybrid digital/analog scheme that aims to gather the advantages of both digital and analog ones is then presented. In the quadratic Gaussian setup when side information is only present at the eavesdropper, this strategy is proved to be optimal. Furthermore, it outperforms both digital and analog schemes and cannot be achieved via time-sharing. Through 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 multiterminal source coding with side information at the eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "discriminatory lossy source coding side information privacy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "secure lossy source coding with side information at the decoders":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wiretap channels with random states non causally available at the encoder")
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "capacity regions of two new classes of 2 receiver broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "comparison of channels criteria for domination by a symmetric channel")
  Member "joint source channel coding with side information using hybrid digital analog codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "minimum energy analysis for robust gaussian joint source channel coding with a square law profile")
  Member "two way source coding with a helper":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adaptive coding for two way lossy source channel communication")
  Member "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secure broadcasting using independent secret keys")

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)