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 "polynomial time semantically secure encryption achieving the secrecy capacity"):
  Abstract: In the wiretap channel setting, one aims to get information-theoretic privacy of communicated data based only on the assumption that the channel from sender to receiver is noisier than the one from sender to adversary. The secrecy capacity is the optimal (highest possible) rate of a secure scheme, and the existence of schemes achieving it has been shown. For thirty years the ultimate and unreached goal has been to achieve this optimal rate with a scheme that is polynomial-time. (This means both encryption and decryption are proven polynomial time algorithms.) This paper finally delivers such a scheme. In fact it does more. Our scheme not only meets the classical notion of security from the wiretap literature, called MIS-R (mutual information security for random messages) but achieves the strictly stronger notion of semantic security, thus delivering more in terms of security without loss of rate.

Includes members:
  Member "a cryptographic treatment of the wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "key and message semantic security over state dependent channels")
  Member "how to construct polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "nested polar codes for wiretap and relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sign bit shaping using polar codes")
  Member "strong secrecy for erasure wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar coding for achieving the capacity of marginal channels in nonbinary input setting")
  Member "secrecy achieving polar coding for binary input memoryless symmetric wire tap channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "greedy merge degrading has optimal power law")
  Member "invertible extractors and wiretap protocols":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "leakage resilient non malleable secret sharing in non compartmentalized models")
  Member "fuzzy extractors how to generate strong keys from biometrics and other noisy data":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis")

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)