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: "the parameterized complexity of k biclique"
  Abstract: Given a graph $G$ and a parameter $k$, the $k$-biclique problem asks whether $G$ contains a complete bipartite subgraph $K_{k,k}$. This is the most easily stated problem on graphs whose parameterized complexity is still unknown. We provide an fpt-reduction from $k$-clique to $k$-biclique, thus solving this longstanding open problem. #R##N#Our reduction use a class of bipartite graphs with a threshold property of independent interest. More specifically, for positive integers $n$, $s$ and $t$, we consider a bipartite graph $G=(A\;\dot\cup\;B, E)$ such that $A$ can be partitioned into $A=V_1\;\dot\cup \;V_2\;\dot\cup\cdots\dot\cup\; V_n$ and for every $s$ distinct indices $i_1\cdots i_s$, there exist $v_{i_1}\in V_{i_1}\cdots v_{i_s}\in V_{i_s}$ such that $v_{i_1}\cdots v_{i_s}$ have at least $t+1$ common neighbors in $B$; on the other hand, every $s+1$ distinct vertices in $A$ have at most $t$ common neighbors in $B$. #R##N#Using the Paley-type graphs and Weil's character sum theorem, we show that for $t=(s+1)!$ and $n$ large enough, such threshold bipartite graphs can be computed in $n^{O(1)}$. One corollary of our reduction is that there is no $f(k)\cdot n^{o(k)}$ time algorithm to decide whether a graph contains a subgraph isomorphic to $K_{k!,k!}$ unless the ETH(Exponential Time Hypothesis) fails. We also provide a probabilistic construction with better parameters $t=\Theta(s^2)$, which indicates that $k$-biclique has no $f(k)\cdot n^{o(\sqrt{k})}$-time algorithm unless 3-SAT with $m$ clauses can be solved in $2^{o(m)}$-time with high probability. Our result also implies the dichotomy classification of the parameterized complexity of cardinality constrain satisfaction problem and the inapproximability of maximum $k$-intersection problem.

Connected through hyperedge HE-1 (induced by source paper "parameterized inapproximability for steiner orientation by gap amplification"):
  with members:
    - "tight fpt approximations for k median and k means"
    - "constant factor fpt approximation for capacitated k median"
    - "faster exact and approximate algorithms for k cut"
    - "from gap eth to fpt inapproximability clique dominating set and more"
    - "completely inapproximable monotone and antimonotone parameterized problems"
    - "almost polynomial ratio eth hardness of approximating densest k subgraph"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "directed multicut is w 1 hard even for four terminal pairs"

Connected through hyperedge HE-2 (induced by source paper "tight fpt approximations for k median and k means"):
  with members:
    - "turning big data into tiny data constant size coresets for k means pca and projective clustering"
    - "from gap eth to fpt inapproximability clique dominating set and more"
    - "improved and simplified inapproximability for k means"
    - "the hardness of approximation of euclidean k means"
    - "the constant inapproximability of the parameterized dominating set problem"
    - "an improved approximation for k median and positive correlation in budgeted optimization"
    - "approximating k median via pseudo approximation"
    - "a unified framework for approximating and clustering data"

Connected through hyperedge HE-3 (induced by source paper "inapproximability within w 1 the case of steiner orientation"):
  with members:
    - "tight fpt approximations for k median and k means"
    - "constant factor fpt approximation for capacitated k median"
    - "faster exact and approximate algorithms for k cut"
    - "from gap eth to fpt inapproximability clique dominating set and more"
    - "completely inapproximable monotone and antimonotone parameterized problems"
    - "directed multicut is w 1 hard even for four terminal pairs"
    - "steiner forest orientation problems"
    - "multicut is fpt"

Connected through hyperedge HE-4 (induced by source paper "a simple gap producing reduction for the parameterized set cover problem"):
  with members:
    - "from gap eth to fpt inapproximability clique dominating set and more"
    - "distributed pcp theorems for hardness of approximation in p"
    - "the constant inapproximability of the parameterized dominating set problem"
    - "losing weight by gaining edges"
    - "exact weight subgraphs and the k sum conjecture"
    - "analytical approach to parallel repetition"

Connected through hyperedge HE-5 (induced by source paper "eth hardness of approximating 2 csps and directed steiner network"):
  with members:
    - "hardness of approximate nearest neighbor search"
    - "on the hardness of approximate and exact bichromatic maximum inner product"
    - "improved approximation algorithms for projection games"
    - "distributed pcp theorems for hardness of approximation in p"
    - "detecting communities is hard and counting them is even harder"
    - "settling the complexity of computing approximate two player nash equilibria"
    - "approximating spanners and directed steiner forest upper and lower bounds"
    - "approximation of non boolean 2csp"

Connected through hyperedge HE-6 (induced by source paper "parameterized intractability of even set and shortest vector problem from gap eth"):
  with members:
    - "on the quantitative hardness of cvp"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "new lattice based cryptographic constructions"

Connected through hyperedge HE-7 (induced by source paper "from gap eth to fpt inapproximability clique dominating set and more"):
  with members:
    - "completely inapproximable monotone and antimonotone parameterized problems"
    - "almost polynomial ratio eth hardness of approximating densest k subgraph"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "how to refute a random csp"
    - "time approximation trade offs for inapproximable problems"
    - "eth hardness for densest k subgraph with perfect completeness"
    - "the constant inapproximability of the parameterized dominating set problem"
    - "lower bounds on the size of semidefinite programming relaxations"

Connected through hyperedge HE-8 (induced by source paper "homomorphisms are a good basis for counting small subgraphs"):
  with members:
    - "the hardness of embedding grids and walls"
    - "parameterized counting of trees forests and matroid bases"
    - "if the current clique algorithms are optimal so is valiant s parser"
    - "exponential time complexity of the permanent and the tutte polynomial"
    - "powers of tensors and fast matrix multiplication"
    - "complexity of counting subgraphs only the boundedness of the vertex cover number counts"
    - "characterizing the easy to find subgraphs from the viewpoint of polynomial time algorithms kernels and turing kernels"
    - "the challenges of unbounded treewidth in parameterised subgraph counting problems"

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