human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "semantic security on wiretap channels using universal hashing with fading applications"):
  with members:
    - "a capacity achieving coding scheme for the awgn channel with polynomial encoding and decoding complexity"
    - "finite blocklength bounds for wiretap channels"
    - "almost universal codes for fading wiretap channels"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "universal hashing for information theoretic security"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "a cryptographic treatment of the wiretap channel"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-2 (induced by source paper "semantic security and the second largest eigenvalue of biregular graphs"):
  with members:
    - "the mac resolvability region semantic security and its operational implications"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "ramanujan graphs in polynomial time"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "universal hashing for information theoretic security"

Connected through hyperedge HE-3 (induced by source paper "semantic security capacity for wiretap channels of type ii"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "the likelihood encoder for lossy compression"
    - "soft covering with high probability"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "a rate distortion based secrecy system with side information at the decoders"
    - "semantically secure coding scheme achieving the capacity of a gaussian wiretap channel"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "the likelihood encoder for lossy source compression"

Connected through hyperedge HE-4 (induced by source paper "on mmse properties of codes for the gaussian broadcast and wiretap channels"):
  with members:
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "mmse of bad codes"
    - "statistical physics of signal estimation in gaussian noise theory and examples of phase transitions"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "construction of wiretap codes from ordinary channel codes"
    - "the secrecy capacity of the mimo wiretap channel"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-5 (induced by source paper "universal hashing for information theoretic security"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "polar coding for the broadcast channel with confidential messages and constrained randomization"):
  with members:
    - "polar codes for broadcast channels"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar coding for the general wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "polar coding for secret key generation"
    - "on secure communication with constrained randomization"

Connected through hyperedge HE-7 (induced by source paper "a cryptographic treatment of the wiretap channel"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "invertible extractors and wiretap protocols"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Question: Please tell me which class the center node 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)