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: "performance assessment and design of finite length ldpc codes for the gaussian wiretap channel"
  Abstract: In this work we study the reliability and secrecy performance achievable by practical low-density parity-check (LDPC) codes over the Gaussian wiretap channel. While several works have already addressed this problem in asymptotic conditions, i.e., under the hypothesis of codewords of infinite length, only a few approaches exist for the finite length regime. We propose an approach to measure the performance of practical codes and compare it with that achievable in asymptotic conditions. Moreover, based on the secrecy metrics we adopt to achieve this target, we propose a code optimization algorithm which allows to design irregular LDPC codes able to approach the ultimate performance limits even at moderately small codeword lengths (in the order of 10000 bits).

Connected through hyperedge HE-1 (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-2 (induced by source paper "an overview of physical layer security with finite alphabet signaling"):
  with members:
    - "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"
    - "physical layer cryptography through massive mimo"
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "sum secrecy rate maximization for full duplex two way relay networks using alamouti based rank two beamforming"
    - "performance of lattice coset codes on universal software radio peripherals"
    - "secure m psk communication via directional modulation"
    - "finite blocklength bounds for wiretap channels"
    - "physical layer security in millimeter wave cellular networks"

Connected through hyperedge HE-3 (induced by source paper "on secrecy metrics for physical layer security over quasi static fading channels"):
  with members:
    - "rethinking the intercept probability of random linear network coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "secure on off transmission design with channel estimation errors"
    - "wireless physical layer security with imperfect channel state information a survey"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"

Connected through hyperedge HE-4 (induced by source paper "analysis of short blocklength codes for secrecy"):
  with members:
    - "quantifying equivocation for finite blocklength wiretap codes"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "deterministic constructions for large girth protograph ldpc codes"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "coding for cryptographic security enhancement using stopping sets"

Connected through hyperedge HE-5 (induced by source paper "ber based physical layer security with finite codelength combining strong converse and error amplification"):
  with members:
    - "performance analysis and design of two edge type ldpc codes for the bec wiretap channel"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "on secrecy above secrecy capacity"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "secrecy gain a wiretap lattice code design"
    - "invertible extractors and wiretap protocols"

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)