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 quadratic inverses for quadratic 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. Sun and Takeshita have recently shown that the class of quadratic permutation polynomials over integer rings provides excellent performance for turbo codes. In this correspondence, a necessary and sufficient condition is proven for the existence of a quadratic inverse polynomial for a quadratic permutation polynomial over an integer ring. Further, a simple construction is given for the quadratic inverse. All but one of the quadratic interleavers proposed earlier by Sun and Takeshita are found to admit a quadratic inverse, although none were explicitly designed to do so. An explanation is argued for the observation that restriction to a quadratic inverse polynomial does not narrow the pool of good quadratic interleavers for turbo codes.

Connected through hyperedge HE-1 (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 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"
    - "permutation polynomial interleavers an algebraic geometric perspective"
    - "on maximum contention free interleavers and permutation polynomials over integer rings"

Connected through hyperedge HE-3 (induced by source paper "impact of interleaver pruning on properties of underlying permutations"):
  with members:
    - "pruned bit reversal permutations mathematical characterization fast algorithms and architectures"

Connected through hyperedge HE-4 (induced by source paper "cycle structure of permutation functions over finite fields and their applications"):
  with members:
    - "permutation polynomial interleavers an algebraic geometric perspective"
    - "on quasi cyclic interleavers for parallel turbo codes"

Connected through hyperedge HE-5 (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 maximum contention free interleavers and permutation polynomials over integer rings"

Connected through hyperedge HE-6 (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 maximum contention free interleavers and permutation polynomials over integer rings"

Connected through hyperedge HE-7 (induced by source paper "permutation polynomial interleavers an algebraic geometric perspective"):
  with members:
    - "on maximum contention free interleavers and permutation polynomials over integer rings"
    - "a new construction for ldpc codes using permutation polynomials over integer rings"

Connected through hyperedge HE-8 (induced by source paper "a new construction for ldpc codes using permutation polynomials over integer rings"):
  with members:
    - "on maximum contention free interleavers and 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)