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: "achieving the secrecy capacity of wiretap channels using polar codes"
  Abstract: Suppose that Alice wishes to send messages to Bob through a communication channel C1, but her transmissions also reach an eavesdropper Eve through another channel C2. This is the wiretap channel model introduced by Wyner in 1975. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms of Bob's probability of error in recovering the message, while security is measured in terms of the mutual information between the message and Eve's observations. Wyner showed that the situation is characterized by a single constant Cs, called the secrecy capacity, which has the following meaning: for all e >; 0, there exist coding schemes of rate R ≥ Cs-e that asymptotically achieve the reliability and security objectives. However, his proof of this result is based upon a random-coding argument. To date, despite consider able research effort, the only case where we know how to construct coding schemes that achieve secrecy capacity is when Eve's channel C2 is an erasure channel, or a combinatorial variation thereof. Polar codes were recently invented by Arikan; they approach the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. In this paper, we use polar codes to construct a coding scheme that achieves the secrecy capacity for a wide range of wiretap channels. Our construction works for any instantiation of the wiretap channel model, as long as both C1 and C2 are symmetric and binary-input, and C2 is degraded with respect to C1. Moreover, we show how to modify our construction in order to provide strong security, in the sense defined by Maurer, while still operating at a rate that approaches the secrecy capacity. In this case, we cannot guarantee that the reliability condition will also be satisfied unless the main channel C1 is noiseless, although we believe it can be always satisfied in practice.

Connected through hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "empirical and strong coordination via soft covering with polar codes"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "an information theoretic approach to secret sharing"

Connected through hyperedge HE-2 (induced by source paper "list decoding of universal polar codes"):
  with members:
    - "polar codes for the deletion channel weak and strong polarization"
    - "universal polarization for processes with memory"
    - "performance bounds of concatenated polar coding schemes"
    - "soft decision decoding of reed muller codes recursive lists"
    - "fast polarization for processes with memory"
    - "polar coding for processes with memory"
    - "joint successive cancellation decoding of polar codes over intersymbol interference channels"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"

Connected through hyperedge HE-3 (induced by source paper "secure polar coding for adversarial wiretap channel"):
  with members:
    - "polar coding for non stationary channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for the general wiretap channel"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels"):
  with members:
    - "random ensembles of lattices from generalized reductions"
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "universal lattice codes for mimo channels"
    - "a general formula for compound channel capacity"
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "the mimo wiretap channel decomposed"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"

Connected through hyperedge HE-5 (induced by source paper "sign bit shaping using polar codes"):
  with members:
    - "probabilistically shaped multi level coding with polar codes for fading channels"
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "efficient polar code construction for higher order modulation"
    - "polar codes for broadcast channels"
    - "llr based successive cancellation list decoding of polar codes"
    - "how to achieve the capacity of asymmetric channels"
    - "achievable rates for shaped bit metric decoding"
    - "list decoding of polar codes"

Connected through hyperedge HE-6 (induced by source paper "polar coding for common message only wiretap broadcast channel"):
  with members:
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "universal polar codes"
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-7 (induced by source paper "threshold secure coding with shared key"):
  with members:
    - "distributed multi user secret sharing"
    - "rate compatible polar codes for wireless channels"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the gaussian multiple access wire tap channel"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "secret key generation via pulse coupled synchronization"):
  with members:
    - "distributed multi user secret sharing"
    - "convergence results on pulse coupled oscillator protocols in locally connected networks"
    - "polar coding for secret key generation"

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)