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: "secrecy achieving polar coding for binary input memoryless symmetric wire tap channels"
  Abstract: A polar coding scheme is introduced in this paper for the wire-tap channel. It is shown that the provided scheme achieves the entire rate-equivocation region for the case of symmetric and degraded wire-tap channel, where the weak notion of secrecy is assumed. For the particular case of binary erasure wire-tap channel, an alternative proof is given. The case of general non-degraded wire-tap channels is also considered.

Connected through hyperedge HE-1 (induced by source paper "greedy merge degrading has optimal power law"):
  with members:
    - "information distilling quantizers"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "channel upgradation for non binary input alphabets and macs"
    - "on the construction of polar codes"
    - "at low snr asymmetric quantizers are better"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-2 (induced by source paper "rate dependent analysis of the asymptotic behavior of channel polarization"):
  with members:
    - "finite length scaling for polar codes"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "properties and construction of polar codes"
    - "polar codes for the m user mac"
    - "refined rate of channel polarization"

Connected through hyperedge HE-3 (induced by source paper "channel upgradation for non binary input alphabets and macs"):
  with members:
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "how to achieve the capacity of asymmetric channels"
    - "upgraded approximation of non binary alphabets for polar code construction"
    - "polar codes for the two user multiple access channel"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-4 (induced by source paper "polynomial time semantically secure encryption achieving the secrecy capacity"):
  with members:
    - "a cryptographic treatment of the wiretap channel"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "nested polar codes for wiretap and relay channels"
    - "strong secrecy for erasure wiretap channels"
    - "invertible extractors and wiretap protocols"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"
    - "on the randomness of independent experiments"

Connected through hyperedge HE-5 (induced by source paper "achieving the secrecy capacity of wiretap channels using polar codes"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "how to construct polar codes"
    - "polar coding for secure transmission and key agreement"
    - "nested polar codes for wiretap and relay channels"
    - "an entropy inequality for q ary random variables and its application to channel polarization"
    - "strong secrecy for erasure wiretap channels"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "lattice codes for the gaussian wiretap channel"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "unimodular lattices for the gaussian wiretap channel"
    - "secrecy gain a wiretap lattice code design"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "on wiretap networks ii"
    - "golden space time trellis coded modulation"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "coding for cryptographic security enhancement using stopping sets"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "non systematic codes for physical layer security"
    - "strong secrecy for erasure wiretap channels"
    - "physical layer security combining error control coding and cryptography"
    - "the wiretap channel with feedback encryption over the channel"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "rate equivocation optimal spatially coupled ldpc codes for the bec wiretap channel"):
  with members:
    - "performance analysis and design of two edge type ldpc codes for the bec wiretap channel"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "polar coding for secure transmission and key agreement"
    - "nested polar codes for wiretap and relay channels"
    - "the effect of spatial coupling on compressive sensing"
    - "weight distributions of multi edge type ldpc codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)