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: "solutions of x q k cdots x q x a in gf 2 n"
  Abstract: Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field is fairly large. Thus, it may be of great interest to find an explicit representation of the solutions independently of the field base. This was previously done only for quadratic equations over a binary finite field. This paper gives an explicit representation of solutions for a much wider class of affine polynomials over a binary prime field.

Connected through hyperedge HE-1 (induced by source paper "on permutation quadrinomials and 4 uniform bct"):
  with members:
    - "new results about the boomerang uniformity of permutation polynomials"
    - "on a conjecture about a class of permutation quadrinomials"
    - "differentially 4 uniform permutations with the best known nonlinearity from butterflies"
    - "a highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree"

Connected through hyperedge HE-2 (induced by source paper "4 uniform bct permutations from generalized butterfly structure"):
  with members:
    - "new results about the boomerang uniformity of permutation polynomials"
    - "on the boomerang uniformity of quadratic permutations over f 2 n"
    - "differentially 4 uniform permutations with the best known nonlinearity from butterflies"

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)