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: "permutation polynomial interleavers an algebraic geometric perspective"
  Abstract: An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are important because they admit analytical designs and simple, practical hardware implementation. The spread factor of an interleaver is a common measure for turbo coding applications. Maximum-spread interleavers are interleavers whose spread factors achieve the upper bound. An infinite sequence of quadratic PPs over integer rings that generate maximum-spread interleavers is presented. New properties of PP interleavers are investigated from an algebraic-geometric perspective resulting in a new non- linearity metric for interleavers. A new interleaver metric that is a function of both the nonlinearity metric and the spread factor is proposed. It is numerically demonstrated that the spread factor has a diminishing importance with the block length. A table of good interleavers for a variety of interleaver lengths according to the new metric is listed. Extensive computer simulation results with impressive frame error rates confirm the efficacy of the new metric. Further, when tail-biting constituent codes are used, the resulting turbo codes are quasi-cyclic.

Connected through hyperedge HE-1 (induced by source paper "pruned bit reversal permutations mathematical characterization fast algorithms and architectures"):
  with members:
    - "on maximum contention free interleavers and permutation polynomials over integer rings"

Connected through hyperedge HE-2 (induced by source paper "analysis of cubic permutation polynomials for turbo codes"):
  with members:
    - "improved qpp interleavers for lte standard"
    - "on maximum contention free interleavers and permutation polynomials over integer rings"
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"

Connected through hyperedge HE-3 (induced by source paper "cycle structure of permutation functions over finite fields and their applications"):
  with members:
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"
    - "on quasi cyclic interleavers for parallel turbo codes"

Connected through hyperedge HE-4 (induced by source paper "performance analysis of 3 dimensional turbo codes"):
  with members:
    - "further results on quadratic permutation polynomial based interleavers for turbo codes"
    - "on maximum contention free interleavers and permutation polynomials over integer rings"
    - "on quadratic inverses for quadratic permutation polynomials over integer rings"

Connected through hyperedge HE-5 (induced by source paper "further results on quadratic permutation polynomial based interleavers for turbo codes"):
  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)