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: "affine equivalence for quadratic rotation symmetric boolean functions"
  Abstract: Let $f_n(x_0, x_1, \ldots, x_{n-1})$ denote the algebraic normal form (polynomial form) of a rotation symmetric (RS) Boolean function of degree $d$ in $n \geq d$ variables and let $wt(f_n)$ denote the Hamming weight of this function. Let $(0, a_1, \ldots, a_{d-1})_n$ denote the function $f_n$ of degree $d$ in $n$ variables generated by the monomial $x_0x_{a_1} \cdots x_{a_{d-1}}.$ Such a function $f_n$ is called monomial rotation symmetric (MRS). It was proved in a $2012$ paper that for any MRS $f_n$ with $d=3,$ the sequence of weights $\{w_k = wt(f_k):~k = 3, 4, \ldots\}$ satisfies a homogeneous linear recursion with integer coefficients. This result was gradually generalized in the following years, culminating around $2016$ with the proof that such recursions exist for any rotation symmetric function $f_n.$ Recursions for quadratic RS functions were not explicitly considered, since a $2009$ paper had already shown that the quadratic weights themselves could be given by an explicit formula. However, this formula is not easy to compute for a typical quadratic function. This paper shows that the weight recursions for the quadratic RS functions have an interesting special form which can be exploited to solve various problems about these functions, for example, deciding exactly which quadratic RS functions are balanced.

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)