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: "improved bounds for the randomized decision tree complexity of recursive majority"
  Abstract: We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a lower bound of $(1/2-\delta) \cdot 2.57143^h$ for the two-sided-error randomized decision tree complexity of evaluating height $h$ formulae with error $\delta \in [0,1/2)$. This improves the lower bound of $(1-2\delta)(7/3)^h$ given by Jayram, Kumar, and Sivakumar (STOC'03), and the one of $(1-2\delta) \cdot 2.55^h$ given by Leonardos (ICALP'13). Second, we improve the upper bound by giving a new zero-error randomized decision tree algorithm that has complexity at most $(1.007) \cdot 2.64944^h$. The previous best known algorithm achieved complexity $(1.004) \cdot 2.65622^h$. The new lower bound follows from a better analysis of the base case of the recursion of Jayram et al. The new algorithm uses a novel "interleaving" of two recursive algorithms.

Connected through hyperedge HE-1 (induced by source paper "linear sketching over mathbb f_2"):
  with members:
    - "an inequality for the fourier spectrum of parity decision trees"
    - "analysis of boolean functions"
    - "a composition theorem for parity kill number"
    - "on the structure of boolean functions with small spectral norm"
    - "on the parity complexity measures of boolean functions"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-2 (induced by source paper "computing majority by constant depth majority circuits with low fan in gates"):
  with members:
    - "computing majority with low fan in majority queries"
    - "addition is exponentially harder than counting for shallow monotone circuits"
    - "super linear gate and super quadratic wire lower bounds for depth two and depth three threshold circuits"
    - "analysis of boolean functions"

Connected through hyperedge HE-3 (induced by source paper "an inequality for the fourier spectrum of parity decision trees"):
  with members:
    - "a composition theorem for parity kill number"
    - "on the structure of boolean functions with small spectral norm"
    - "open problems in analysis of boolean functions"
    - "on the parity complexity measures of boolean functions"

Connected through hyperedge HE-4 (induced by source paper "analysis of boolean functions"):
  with members:
    - "some improvements to total degree tests"
    - "dnf sparsification and a faster deterministic counting algorithm"
    - "hypercontractive inequalities via sos with an application to vertex cover"
    - "hypercontractivity sum of squares proofs and their applications"
    - "majority is stablest discrete and sos"
    - "a satisfiability algorithm for ac 0"
    - "the influence lower bound via query elimination"
    - "fooling functions of halfspaces under product distributions"

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.DS(Data Structures and Algorithms)