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: "equivalence relations for computing permutation polynomials"
  Abstract: We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new functions that map permutation polynomials (PPs) to other PPs. Our expanded normalization applies to almost all PPs, including when the characteristic of the finite field divides the degree of the polynomial. The equivalence relations make it possible to reduce the size of the space, when doing an exhaustive search. As a result, we have been able to compute almost all permutation polynomials of degree $d$ at most 10 over $GF(q)$, where $q$ is at most 97. We have also been able to compute nPPs of degrees 11 and 12 in a few cases. The techniques apply to arbitrary $q$ and $d$. In addition, the equivalence relations allow the set all PPs for a given degree and a given field $GF(q)$ to be succinctly described by their representative nPPs. We give several tables at the end of the paper listing the representative nPPs (\ie the equivalence classes) for several values of $q$ and $d$. We also give several new lower bounds for $M(n,D)$, the maximum number of permutations on $n$ symbols with pairwise Hamming distance $D$, mostly derived from our results on PPs.

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)