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: "blinkdb queries with bounded errors and bounded response times on very large data"
  Abstract: In this paper, we present BlinkDB, a massively parallel, sampling-based approximate query engine for running ad-hoc, interactive SQL queries on large volumes of data. The key insight that BlinkDB builds on is that one can often make reasonable decisions in the absence of perfect answers. For example, reliably detecting a malfunctioning server using a distributed collection of system logs does not require analyzing every request processed by the system. Based on this insight, BlinkDB allows one to trade-off query accuracy for response time, enabling interactive queries over massive data by running queries on data samples and presenting results annotated with meaningful error bars. To achieve this, BlinkDB uses two key ideas that differentiate it from previous work in this area: (1) an adaptive optimization framework that builds and maintains a set of multi-dimensional, multi-resolution samples from original data over time, and (2) a dynamic sample selection strategy that selects an appropriately sized sample based on a query's accuracy and/or response time requirements. We have built an open-source version of BlinkDB and validated its effectiveness using the well-known TPC-H benchmark as well as a real-world analytic workload derived from Conviva Inc. Our experiments on a 100 node cluster show that BlinkDB can answer a wide range of queries from a real-world query trace on up to 17 TBs of data in less than 2 seconds (over 100\times faster than Hive), within an error of 2 - 10%.

Connected through hyperedge HE-1 (induced by source paper "ml aqp query driven approximate query processing based on machine learning"):
  with members:
    - "approximate query processing using deep generative models"
    - "neo a learned query optimizer"
    - "selectivity estimation with deep likelihood models"
    - "deepdb learn from data not from queries"
    - "an empirical analysis of deep learning for cardinality estimation"
    - "an end to end learning based cost estimator"
    - "estimating cardinalities with deep sketches"
    - "learned cardinalities estimating correlated joins with deep learning"

Connected through hyperedge HE-2 (induced by source paper "finding interesting frames in deep video analytics a top k approach"):
  with members:
    - "blazeit optimizing declarative aggregation and limit queries for neural network based video analytics"
    - "yolov3 an incremental improvement"
    - "focus querying large video datasets with low latency and low cost"
    - "scanner efficient video analysis at scale"
    - "occlusion aware hand pose estimation using hierarchical mixture density network"
    - "face detection using deep learning an improved faster rcnn approach"
    - "abnormality detection and localization in chest x rays using deep convolutional neural networks"
    - "noscope optimizing neural network queries over video at scale"

Connected through hyperedge HE-3 (induced by source paper "towards scalable dataframe systems"):
  with members:
    - "verdictdb universalizing approximate query processing"
    - "helix holistic optimization for accelerating iterative machine learning"
    - "ray a distributed framework for emerging ai applications"
    - "adaptive sampling for rapidly matching histograms"
    - "laradb a minimalist kernel for linear and relational algebra computation"
    - "towards a holistic integration of spreadsheets with databases a scalable storage engine for presentational data management"
    - "lara a key value algebra underlying arrays and relations"
    - "visualization aware sampling for very large databases"

Connected through hyperedge HE-4 (induced by source paper "providing insights for queries affected by failures and stragglers"):
  with members:
    - "shark sql and rich analytics at scale"
    - "fdb a query engine for factorised relational databases"

Connected through hyperedge HE-5 (induced by source paper "physical representation based predicate optimization for a visual analytics database"):
  with members:
    - "blazeit optimizing declarative aggregation and limit queries for neural network based video analytics"
    - "blazeit fast exploratory video queries using neural networks"
    - "verdictdb universalizing approximate query processing"
    - "focus querying large video datasets with low latency and low cost"
    - "mobilenets efficient convolutional neural networks for mobile vision applications"
    - "squeeze and excitation networks"
    - "squeezenet alexnet level accuracy with 50x fewer parameters and 0 5mb model size"
    - "noscope optimizing neural network queries over video at scale"

Connected through hyperedge HE-6 (induced by source paper "approximate query processing using deep generative models"):
  with members:
    - "learned cardinalities estimating correlated joins with deep learning"
    - "idebench a benchmark for interactive data exploration"
    - "learning state representations for query optimization with deep reinforcement learning"
    - "deep reinforcement learning for join order enumeration"
    - "data synthesis based on generative adversarial networks"
    - "learning to optimize join queries with deep reinforcement learning"
    - "neuralcubes deep representations for visual data exploration"
    - "verdictdb universalizing approximate query processing"

Connected through hyperedge HE-7 (induced by source paper "supporting video queries on zero streaming cameras"):
  with members:
    - "scaling video analytics on constrained edge nodes"
    - "vstore a data store for analytics on large videos"
    - "blazeit optimizing declarative aggregation and limit queries for neural network based video analytics"
    - "secs efficient deep stream processing via class skew dichotomy"
    - "yolov3 an incremental improvement"
    - "focus querying large video datasets with low latency and low cost"
    - "deeplens towards a visual data management system"
    - "rexcam resource efficient cross camera video analytics at enterprise scale"

Connected through hyperedge HE-8 (induced by source paper "analysis of large scale multi tenant gpu clusters for dnn training workloads"):
  with members:
    - "superneurons dynamic gpu memory management for training deep neural networks"
    - "slaq quality driven scheduling for distributed machine learning"
    - "attention is all you need"
    - "deepprof performance analysis for deep learning applications via mining gpu execution patterns"
    - "accurate large minibatch sgd training imagenet in 1 hour"
    - "vdnn virtualized deep neural networks for scalable memory efficient neural network design"
    - "tensorflow a system for large scale machine learning"
    - "deep residual learning for image recognition"

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)