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 "multidimensional binary vector assignment problem standard structural and above guarantee parameterizations"):
  Abstract: In this article we focus on the parameterized complexity of the#N#Multidimensional Binary Vector Assignment problem (called \BVA). An input of#N#this problem is defined by $m$ disjoint sets $V^1, V^2, \dots, V^m$, each#N#composed of $n$ binary vectors of size $p$. An output is a set of $n$ disjoint#N#$m$-tuples of vectors, where each $m$-tuple is obtained by picking one vector#N#from each set $V^i$. To each $m$-tuple we associate a $p$ dimensional vector by#N#applying the bit-wise AND operation on the $m$ vectors of the tuple. The#N#objective is to minimize the total number of zeros in these $n$ vectors. mBVA#N#can be seen as a variant of multidimensional matching where hyperedges are#N#implicitly locally encoded via labels attached to vertices, but was originally#N#introduced in the context of integrated circuit manufacturing.#N#  We provide for this problem FPT algorithms and negative results ($ETH$-based#N#results, $W$[2]-hardness and a kernel lower bound) according to several#N#parameters: the standard parameter $k$ i.e. the total number of zeros), as well#N#as two parameters above some guaranteed values.

Includes members:
  Member "slightly superexponential parameterized problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of finding large odd induced subgraphs and odd colorings")
  Member "kernelization lower bounds by cross composition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs")
  Member "faster parameterized algorithms using linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "structural parameterizations with modulator oblivion")
  Member "constraint satisfaction problems parameterized above or below tight bounds a survey":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "satisfiability of ordering csps above average")
  Member "on multiway cut parameterized above lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "structural parameterizations with modulator oblivion")
  Member "the linear arrangement problem parameterized above guaranteed value":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameterized and approximation algorithms for the load coloring problem")

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)