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: "polar coding for secure transmission and key agreement"
  Abstract: Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Ar{\i}kan. It is shown that polar codes achieve non-trivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.

Connected through hyperedge HE-1 (induced by source paper "polar codes for broadcast channels"):
  with members:
    - "achieving marton s region for broadcast channels using polar codes"
    - "a comparison of superposition coding schemes"
    - "polar codes for the two user multiple access channel"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "polar codes for q ary channels q 2 r"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "multilevel polarization of polar codes over arbitrary discrete memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "secret key agreement with large antenna arrays under the pilot contamination attack"):
  with members:
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "secure transmission in multi cell massive mimo systems"
    - "secrecy sum rates for multi user mimo regularized channel inversion precoding"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel estimation and linear precoding in multiuser multiple antenna tdd systems"
    - "nested polar codes for wiretap and relay channels"

Connected through hyperedge HE-3 (induced by source paper "polar coding for the general wiretap channel"):
  with members:
    - "polar codes for broadcast channels"
    - "polar codes for distributed hierarchical source coding"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "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 broadcast channel with confidential messages and constrained randomization"
    - "polar coding for interference networks"
    - "efficient one way secret key agreement and private channel coding via polarization"

Connected through hyperedge HE-4 (induced by source paper "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"):
  with members:
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for the general wiretap channel"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "nested polar codes for wiretap and relay channels"
    - "strong secrecy for erasure wiretap channels"
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "polynomial complexity of polar codes for non binary alphabets key agreement and slepian wolf coding"):
  with members:
    - "key capacity with limited one way communication for product sources"
    - "polar coding for secret key generation"
    - "polar codes for the two user multiple access channel"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "an entropy inequality for q ary random variables and its application to channel polarization"
    - "polar codes for the m user mac"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "polar coding for secret key generation"):
  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 and constrained randomization"
    - "universal source polarization and an application to a multi user problem"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "secure biometrics concepts authentication architectures and challenges"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "strong coordination with polar codes"
    - "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"

Connected through hyperedge HE-7 (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-8 (induced by source paper "space time polar coded modulation"):
  with members:
    - "improved successive cancellation decoding of polar codes"
    - "polar coded modulation with optimal constellation labeling"
    - "list decoding of polar codes"
    - "aspects of polar coded modulation"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "polar codes are optimal for lossy source coding"

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)