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: "on maximum contention free interleavers and permutation polynomials over integer rings"
  Abstract: An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Contention-free interleavers have been recently shown to be suitable for parallel decoding of turbo codes. In this correspondence, it is shown that permutation polynomials generate maximum contention-free interleavers, i.e., every factor of the interleaver length becomes a possible degree of parallel processing of the decoder. Further, it is shown by computer simulations that turbo codes using these interleavers perform very well for the Third Generation Partnership Project (3GPP) standard

Connected through hyperedge HE-1 (induced by source paper "minimum pseudoweight analysis of 3 dimensional turbo codes"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "analysis and design of tuned turbo codes"
    - "polytope of correct linear programming decoding and low weight pseudo codewords"
    - "exposing pseudoweight layers in regular ldpc code ensembles"
    - "turbo decoding on the binary erasure channel finite length analysis and turbo stopping sets"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "parallel interleaver design for a high throughput hspa lte multi standard turbo decoder"):
  with members:
    - "on complexity energy and implementation efficiency of channel decoders"
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"

Connected through hyperedge HE-3 (induced by source paper "pruned bit reversal permutations mathematical characterization fast algorithms and architectures"):
  with members:
    - "permutation polynomial interleavers an algebraic geometric perspective"

Connected through hyperedge HE-4 (induced by source paper "analysis of cubic permutation polynomials for turbo codes"):
  with members:
    - "improved qpp interleavers for lte standard"
    - "permutation polynomial interleavers an algebraic geometric perspective"
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"

Connected through hyperedge HE-5 (induced by source paper "multiple access demodulation in the lifted signal graph with spatial coupling"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "connection between annealed free energy and belief propagation on random factor graph ensembles"
    - "tight bounds on the capacity of binary input random cdma systems"
    - "a general computation rule for lossy summaries messages with examples from equalization"

Connected through hyperedge HE-6 (induced by source paper "performance analysis of 3 dimensional turbo codes"):
  with members:
    - "further results on quadratic permutation polynomial based interleavers for turbo codes"
    - "permutation polynomial interleavers an algebraic geometric perspective"
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"

Connected through hyperedge HE-7 (induced by source paper "further results on quadratic permutation polynomial based interleavers for turbo codes"):
  with members:
    - "permutation polynomial interleavers an algebraic geometric perspective"
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"

Connected through hyperedge HE-8 (induced by source paper "permutation polynomial interleavers an algebraic geometric perspective"):
  with members:
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"
    - "a new construction for ldpc codes using 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)