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 "measuring secrecy by the probability of a successful guess"):
  Abstract: The secrecy of a communication system in which both the legitimate receiver and an eavesdropper are allowed some distortion is investigated. The secrecy metric considered is the exponent of the probability that the eavesdropper estimates the source sequence successfully within an acceptable distortion level. The problem is first studied when the transmitter and the legitimate receiver do not share any key and the transmitter is not subject to a rate constraint, which corresponds to a stylized model of a side channel and reveals connections to source coding with side information. The setting is then generalized to include a shared secret key between the transmitter and the legitimate receiver and a rate constraint on the transmitter, which corresponds to the Shannon cipher system. A single-letter characterization of the highest achievable exponent is provided, and asymptotically optimal strategies for both the primary user and the eavesdropper are demonstrated.

Includes members:
  Member "a large deviations approach to secure lossy compression":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "importance of small probability events in big data information measures applications and challenges")
  Member "mitigating timing side channel in shared schedulers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on scheduler side channels in dynamic priority real time systems")
  Member "the henchman problem measuring secrecy by the minimum distortion in a list":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strategic communication with side information at the decoder")
  Member "rate distortion theory for secrecy systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "improved rate equivocation regions for secure cooperative communication":
    also connected through other hyperedges:
      (none)
  Member "lossless compression with security constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "anonymous networking amidst eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inverse graph learning over optimization networks")
  Member "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)