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: "cuttlefish a lightweight primitive for adaptive query processing"
  Abstract: Modern data processing applications execute increasingly sophisticated analysis that requires operations beyond traditional relational algebra. As a result, operators in query plans grow in diversity and complexity. Designing query optimizer rules and cost models to choose physical operators for all of these novel logical operators is impractical. To address this challenge, we develop Cuttlefish, a new primitive for adaptively processing online query plans that explores candidate physical operator instances during query execution and exploits the fastest ones using multi-armed bandit reinforcement learning techniques. We prototype Cuttlefish in Apache Spark and adaptively choose operators for image convolution, regular expression matching, and relational joins. Our experiments show Cuttlefish-based adaptive convolution and regular expression operators can reach 72-99% of the throughput of an all-knowing oracle that always selects the optimal algorithm, even when individual physical operators are up to 105x slower than the optimal. Additionally, Cuttlefish achieves join throughput improvements of up to 7.5x compared with Spark SQL's query optimizer.

Connected through hyperedge HE-1 (induced by source paper "neo a learned query optimizer"):
  with members:
    - "termite a system for tunneling through heterogeneous data"
    - "skinnerdb regret bounded query evaluation via reinforcement learning"
    - "pre training neural networks with human demonstrations for deep reinforcement learning"
    - "learned cardinalities estimating correlated joins with deep learning"
    - "learning state representations for query optimization with deep reinforcement learning"
    - "deep reinforcement learning for join order enumeration"
    - "learning scheduling algorithms for data processing clusters"
    - "learning to optimize join queries with deep reinforcement learning"

Connected through hyperedge HE-2 (induced by source paper "dataset search a survey"):
  with members:
    - "interactive summarization and exploration of top aggregate query answers"
    - "ad hoc table retrieval using semantic similarity"
    - "on the fly table generation"
    - "everything you always wanted to know about a dataset studies in data summarisation"
    - "a survey on data collection for machine learning a big data ai integration perspective"
    - "neural vector spaces for unsupervised information retrieval"
    - "entitables smart assistance for entity focused tables"
    - "navigating the data lake with datamaran automatically extracting structure from log datasets"

Connected through hyperedge HE-3 (induced by source paper "how i learned to stop worrying and love re optimization"):
  with members:
    - "learned cardinalities estimating correlated joins with deep learning"
    - "learning state representations for query optimization with deep reinforcement learning"
    - "deep reinforcement learning for join order enumeration"
    - "learning to optimize join queries with deep reinforcement learning"

Connected through hyperedge HE-4 (induced by source paper "deeplens towards a visual data management system"):
  with members:
    - "physical representation based predicate optimization for a visual analytics database"
    - "blazeit optimizing declarative aggregation and limit queries for neural network based video analytics"
    - "the case for automatic database administration using deep reinforcement learning"
    - "learning to optimize join queries with deep reinforcement learning"
    - "smoke fine grained lineage at interactive speed"
    - "noscope optimizing neural network queries over video at scale"
    - "deeper depth prediction with fully convolutional residual networks"
    - "cudnn efficient primitives for deep learning"

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.DB(Databases)