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 "on two conjectures about permutation trinomials over mathbb f _ 3 2k"):
  Abstract: Permutation polynomials with few terms attracts researchers' interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree polynomial and a seventh-degree polynomial over the finite field $\mathbb{F}_{3^{2k}}$, two conjectures on permutation trinomials over $\mathbb{F}_{3^{2k}}$ proposed recently by Li, Qu, Li and Fu are settled, where $k$ is a positive integer.

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 permutation trinomials from niho exponents over finite fields with even characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on a conjecture about a class of permutation quadrinomials")
  Member "new permutation trinomials constructed from fractional polynomials":
    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")
  Member "new classes of permutation binomials and permutation trinomials over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)