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: "a new construction for ldpc codes using permutation polynomials over integer rings"
  Abstract: A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new codes are quasi-cyclic. Graph isomorphisms and automorphisms are identified and used in an efficient search for good codes. Graphs with girth as large as 12 were found. Upper bounds on the minimum Hamming distance are found both analytically and algorithmically. The bounds indicate that the minimum distance grows with block length. Near-codewords are one of the causes for error floors in LDPC codes; the new construction provides a good framework for studying near-codewords in LDPC codes. Nine example codes are given, and computer simulation results show the excellent error performance of these codes. Finally, connections are made between this new LDPC construction and turbo codes using interleavers generated by quadratic permutation polynomials.

Connected through hyperedge HE-1 (induced by source paper "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"):
  with members:
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "deriving good ldpc convolutional codes from ldpc block codes"
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "on distance properties of quasi cyclic protograph based ldpc codes"
    - "absdet pseudo codewords and perm pseudo codewords definitions and properties"
    - "adaptive methods for linear programming decoding"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "permutation polynomial interleavers an algebraic geometric perspective"):
  with members:
    - "on maximum contention free interleavers and permutation polynomials over integer rings"
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"

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)