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 "computing the partition function of a polynomial on the boolean cube"):
  Abstract: For a polynomial \(f:\{ -1,1\}^{n}\longrightarrow \mathbb{C}\), we define the partition function as the average of e λf(x) over all points x ∈ {−1, 1} n , where \(\lambda \in \mathbb{C}\) is a parameter. We present a quasi-polynomial algorithm, which, given such f, λ and e > 0 approximates the partition function within a relative error of e in N O(lnn−lne) time provided \(\vert \lambda \vert \leq (2L\sqrt{\deg f})^{-1}\), where L = L( f) is a parameter bounding the Lipschitz constant of f from above and N is the number of monomials in f. As a corollary, we obtain a quasi-polynomial algorithm, which, given such an f with coefficients ± 1 and such that every variable enters not more than 4 monomials, approximates the maximum of f on { − 1, 1} n within a factor of \(O\left (\delta ^{-1}\sqrt{\deg f}\right )\), provided the maximum is Nδ for some 0   4, we are able to establish a similar result when δ ≥ (k − 1)∕k.

Includes members:
  Member "beating the random assignment on constraint satisfaction problems of bounded degree":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "general bounds on satisfiability thresholds for random csps via fourier analysis")
  Member "grothendieck type inequalities in combinatorial optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarially robust low dimensional representations")

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