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 analysis and design of two edge type ldpc codes for the bec wiretap channel"
  Abstract: We consider transmission over a wiretap channel where both the main channel and the wiretapper's channel are binary erasure channels (BEC). A code construction method is proposed using two edge-type low-density parity-check (LDPC) codes based on the coset encoding scheme. Using a single edge-type LDPC ensemble with a given threshold over the BEC, we give a construction for a two edge-type LDPC ensemble with the same threshold. If the given single edge-type LDPC ensemble has degree two variable nodes, our construction gives rise to degree one variable nodes in the code used over the main channel. This results in zero threshold over the main channel. In order to circumvent this problem, the degree distribution of the two edge-type LDPC ensemble is numerically optimized. We find that the resulting ensembles are able to perform close to the boundary of the rate-equivocation region of the wiretap channel. Further, a method to compute the ensemble average equivocation of two edge-type LDPC ensembles is provided by generalizing a recently published approach to measure the equivocation of single edge-type ensembles for transmission over the BEC in the point-to-point setting. From this analysis, we find that relatively simple constructions give very good secrecy performance.

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 "degraded broadcast channel secrecy outside of a bounded range"):
  with members:
    - "an information theoretic approach to secret sharing"
    - "informational divergence approximations to product distributions"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy from channel resolvability"
    - "degraded compound multi receiver wiretap channels"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "the secrecy rate region of the broadcast channel"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-3 (induced by source paper "ber based physical layer security with finite codelength combining strong converse and error amplification"):
  with members:
    - "performance assessment and design of finite length ldpc codes for the gaussian 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"

Connected through hyperedge HE-4 (induced by source paper "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy for erasure wiretap channels"
    - "exchange of limits why iterative decoding works"
    - "secure nested codes for type ii wiretap channels"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "rate equivocation optimal spatially coupled ldpc codes for the bec wiretap channel"):
  with members:
    - "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"
    - "secrecy achieving polar coding for binary input memoryless symmetric wire tap channels"
    - "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)