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: "nested polar codes for wiretap and relay channels"
  Abstract: We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper's channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding scheme also achieves the capacity of the physically degraded receiver-orthogonal relay channel. We show simulation results for moderate block length for the binary erasure wiretap channel, comparing polar codes and two edge type LDPC codes.

Connected through hyperedge HE-1 (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-2 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"):
  with members:
    - "secure massive mimo systems with limited rf chains"
    - "secure transmission with large numbers of antennas and finite alphabet inputs"
    - "probabilistically robust swipt for secrecy misome systems"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "full duplex bidirectional secure communications under perfect and distributionally ambiguous eavesdropper s csi"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "physical layer security aware routing and performance tradeoffs in ad hoc networks"
    - "hybrid procoder and combiner design for secure transmission in mmwave mimo systems"

Connected through hyperedge HE-3 (induced by source paper "channel coding at low capacity"):
  with members:
    - "polar codes with a stepped boundary"
    - "recursive list decoding for reed muller codes"
    - "beta beta bounds finite blocklength analog of the golden formula"
    - "relaxed polar codes"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
    - "polar codes for broadcast channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"

Connected through hyperedge HE-4 (induced by source paper "a new coding paradigm for the primitive relay channel"):
  with members:
    - "capacity achieving rate compatible polar codes"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "capacity of a class of state dependent orthogonal relay channels"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "soft decoding based strategies for relay and interference channels analysis and achievable rates using ldpc codes"
    - "universal polar codes"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-5 (induced by source paper "secrecy energy efficiency of mimome wiretap channels with full duplex jamming"):
  with members:
    - "multi tenant c ran with spectrum pooling downlink optimization under privacy constraints"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "softnull many antenna full duplex wireless via digital beamforming"
    - "a survey of energy efficient techniques for 5g networks and challenges ahead"
    - "hardware impairments aware transceiver for full duplex massive mimo relaying"
    - "multi objective optimization for robust power efficient and secure full duplex wireless communication systems"
    - "joint design of optimal cooperative jamming and power allocation for linear precoding"
    - "robust beamforming for secure communication in systems with wireless information and power transfer"

Connected through hyperedge HE-6 (induced by source paper "code constructions for physical unclonable functions and biometric secrecy systems"):
  with members:
    - "controllable identifier measurements for private authentication with secret keys"
    - "secure and reliable key agreement with physical unclonable functions"
    - "privacy secrecy and storage with multiple noisy measurements of identifiers"
    - "the likelihood encoder for lossy compression"
    - "polar coding for secret key generation"
    - "informational divergence approximations to product distributions"
    - "secret key generation using correlated sources and channels"
    - "separation of reliability and secrecy in rate limited secret key generation"

Connected through hyperedge HE-7 (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-8 (induced by source paper "polar coding for achieving the capacity of marginal channels in nonbinary input setting"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy for erasure wiretap channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"
    - "polarization for arbitrary discrete memoryless channels"
    - "invertible extractors and wiretap protocols"
    - "on the rate of channel polarization"

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)