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: "characterization of negabent functions and construction of bent negabent functions with maximum algebraic degree"
  Abstract: We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these necessary and sufficient conditions for Boolean functions to be negabent, we obtain that the nega spectrum of a negabent function has at most 4 values. We determine the nega spectrum distribution of negabent functions. Further, we provide a method to construct bent-negabent functions in $n$ variables ($n$ even) of algebraic degree ranging from 2 to $\frac{n}{2}$, which implies that the maximum algebraic degree of an $n$-variable bent-negabent function is equal to $\frac{n}{2}$. Thus, we answer two open problems proposed by Parker and Pott and by St\v{a}nic\v{a} \textit{et al.} respectively.

Connected through hyperedge HE-1 (induced by source paper "several classes of negabent functions over finite fields"):
  with members:
    - "quaternary constant amplitude codes for multicode cdma"

Connected through hyperedge HE-2 (induced by source paper "decomposing generalized bent and hyperbent functions"):
  with members:
    - "partial spread and vectorial generalized bent functions"

Connected through hyperedge HE-3 (induced by source paper "generalized bent functions and their gray images"):
  with members:
    - "quaternary constant amplitude codes for multicode cdma"

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)