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 "correlated source coded sequences with compromised channel and source symbols using shannon s cipher system"):
  Abstract: Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources to transmit. Here, two correlated sources across a channel with eavesdroppers are investigated, and conditions for perfect secrecy when some channel information and some source data symbols (the predetermined information) have been wiretapped are determined. The adversary in this situation has access to more information than if a link is wiretapped only and can thus determine more about a particular source. This scenario caters for an application where the eavesdropper has access to some preexisting information. We provide bounds for the channel and key rates for this scenario. Further, we provide a method to reduce the key lengths required for perfect secrecy.

Includes members:
  Member "secure transmission of sources over noisy channels with side information at the receivers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secret key generation over noisy channels with correlated sources")
  Member "secure multiterminal source coding with side information at the eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "imperfect secrecy in wiretap channel ii":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "active secure coding based on eavesdropper behavior learning")
  Member "the shannon cipher system with a guessing wiretapper general sources":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression")
  Member "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)