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 "source channel secrecy for shannon cipher system"):
  Abstract: Recently, a secrecy measure based on list-reconstruction has been proposed [2], in which a wiretapper is allowed to produce a list of $2^{mR_{L}}$ reconstruction sequences and the secrecy is measured by the minimum distortion over the entire list. In this paper, we show that this list secrecy problem is equivalent to the one with secrecy measured by a new quantity \emph{lossy-equivocation}, which is proven to be the minimum optimistic 1-achievable source coding rate (the minimum coding rate needed to reconstruct the source within target distortion with positive probability for \emph{infinitely many blocklengths}) of the source with the wiretapped signal as two-sided information, and also can be seen as a lossy extension of conventional equivocation. Upon this (or list) secrecy measure, we study source-channel secrecy problem in the discrete memoryless Shannon cipher system with \emph{noisy} wiretap channel. Two inner bounds and an outer bound on the achievable region of secret key rate, list rate, wiretapper distortion, and distortion of legitimate user are given. The inner bounds are derived by using uncoded scheme and (operationally) separate scheme, respectively. Thanks to the equivalence between lossy-equivocation secrecy and list secrecy, information spectrum method is leveraged to prove the outer bound. As special cases, the admissible region for the case of degraded wiretap channel or lossless communication for legitimate user has been characterized completely. For both these two cases, separate scheme is proven to be optimal. Interestingly, however, separation indeed suffers performance loss for other certain cases. Besides, we also extend our results to characterize the achievable region for Gaussian communication case. As a side product optimistic lossy source coding has also been addressed.

Includes members:
  Member "joint source channel secrecy using uncoded schemes towards secure source broadcast":
    also connected through other hyperedges:
      (none)
  Member "joint source channel secrecy using hybrid coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the likelihood encoder for lossy compression")
  Member "the henchman problem measuring secrecy by the minimum distortion in a list":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strategic communication with side information at the decoder")
  Member "secure transmission of sources over noisy channels with side information at the receivers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secret key generation over noisy channels with correlated sources")
  Member "information spectrum approach to strong converse theorems for degraded wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "first and second order asymptotics in covert communication")
  Member "information spectrum approach to the source channel separation theorem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "layered black box behavioral interconnection perspective and applications to the problem of communication with fidelity criteria part i i i d sources")
  Member "lossy joint source channel coding in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite sample analysis of image registration")
  Member "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint source channel secrecy using uncoded schemes towards secure source broadcast")

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)