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 "lower bound on weights of large degree threshold functions"):
  Abstract: An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate}#N#for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$#N#if and only if $p(x)\geq 0$. The \emph{weight} of a threshold gate is the sum#N#of its absolute values.#N#  In this paper we study how large a weight might be needed if we fix some#N#function and some threshold degree. We prove $2^{\Omega(2^{2n/5})}$ lower bound#N#on this value. The best previous bound was $2^{\Omega(2^{n/8})}$ (Podolskii,#N#2009).#N#  In addition we present substantially simpler proof of the weaker#N#$2^{\Omega(2^{n/4})}$ lower bound. This proof is conceptually similar to other#N#proofs of the bounds on weights of nonlinear threshold gates, but avoids a lot#N#of technical details arising in other proofs. We hope that this proof will help#N#to show the ideas behind the construction used to prove these lower bounds.

Includes members:
  Member "a regularity lemma and low weight approximators for low degree polynomial threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "degree d chow parameters robustly determine degree d ptfs and algorithmic applications")
  Member "communication lower bounds using dual polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the degree of boolean functions as polynomials over mathbb z _m")

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.CC(Computational Complexity)