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: "construction of near optimum burst erasure correcting low density parity check codes"
  Abstract: In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists in starting from the parity-check matrix of an LDPC code and developing an optimized parity-check matrix, with the same performance on the memory-less erasure channel, and suitable also for the iterative correction of single bursts of erasures. The parity-check matrix optimization is performed by an algorithm called pivot searching and swapping (PSS) algorithm, which executes permutations of carefully chosen columns of the parity-check matrix, after a local analysis of particular variable nodes called stopping set pivots. This algorithm can be in principle applied to any LDPC code. If the input parity-check matrix is designed for achieving good performance on the memory-less erasure channel, then the code obtained after the application of the PSS algorithm provides good joint correction of independent erasures and single erasure bursts. Numerical results are provided in order to show the effectiveness of the PSS algorithm when applied to different categories of LDPC codes.

Connected through hyperedge HE-1 (induced by source paper "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"):
  with members:
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "low power secret key agreement over ofdm"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "increasing physical layer security through scrambled codes and arq"
    - "enhanced public key security for the mceliece cryptosystem"
    - "on a family of circulant matrices for quasi cyclic low density generator matrix codes"
    - "non systematic codes for physical layer security"

Connected through hyperedge HE-2 (induced by source paper "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes"):
  with members:
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "interleaved product ldpc codes"
    - "progressive differences convolutional low density parity check codes"
    - "scaling efficient code based cryptosystems for embedded platforms"
    - "on a family of circulant matrices for quasi cyclic low density generator matrix codes"

Connected through hyperedge HE-3 (induced by source paper "windowed decoding of protograph based ldpc convolutional codes over erasure channels"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "asymptotically regular ldpc codes with linear distance growth and thresholds close to capacity"
    - "on distance properties of quasi cyclic protograph based ldpc codes"
    - "improved upper bounds on stopping redundancy"

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)