human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "constructions of involutions over finite fields"):
  Abstract: An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications such as cryptography and coding theory. As far as we know, there are not many involutions, and there isn't a general way to construct involutions over finite fields. This paper gives a necessary and sufficient condition for the polynomials of the form $x^rh(x^s)\in \bF_q[x]$ to be involutions over the finite field~$\bF_q$, where $r\geq 1$ and $s\,|\, (q-1)$. By using this criterion we propose a general method to construct involutions of the form $x^rh(x^s)$ over $\bF_q$ from given involutions over the corresponding subgroup of $\bF_q^*$. Then, many classes of explicit involutions of the form $x^rh(x^s)$ over $\bF_q$ are obtained.

Includes members:
  Member "several classes of permutation trinomials from niho exponents":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some results about permutation properties of a kind of binomials over finite fields")
  Member "new classes of permutation binomials and permutation trinomials over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "some results about permutation properties of a kind of binomials over finite fields")
  Member "permutation trinomials over finite fields with even characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "some results about permutation properties of a kind of binomials over finite fields")

Question: Please tell me which class the source paper 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)