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: "optimizing batch linear queries under exact and approximate differential privacy"
  Abstract: Differential privacy is a promising privacy-preserving paradigm for statistical query processing over sensitive data. It works by injecting random noise into each query result, such that it is provably hard for the adversary to infer the presence or absence of any individual record from the published noisy results. The main objective in differentially private query processing is to maximize the accuracy of the query results, while satisfying the privacy guarantees. Previous work, notably \cite{LHR+10}, has suggested that with an appropriate strategy, processing a batch of correlated queries as a whole achieves considerably higher accuracy than answering them individually. However, to our knowledge there is currently no practical solution to find such a strategy for an arbitrary query batch; existing methods either return strategies of poor quality (often worse than naive methods) or require prohibitively expensive computations for even moderately large domains. Motivated by this, we propose low-rank mechanism (LRM), the first practical differentially private technique for answering batch linear queries with high accuracy. LRM works for both exact (i.e., $\epsilon$-) and approximate (i.e., ($\epsilon$, $\delta$)-) differential privacy definitions. We derive the utility guarantees of LRM, and provide guidance on how to set the privacy parameters given the user's utility expectation. Extensive experiments using real data demonstrate that our proposed method consistently outperforms state-of-the-art query processing solutions under differential privacy, by large margins.

Connected through hyperedge HE-1 (induced by source paper "crypt epsilon crypto assisted differential privacy on untrusted servers"):
  with members:
    - "an economic analysis of privacy protection and statistical accuracy as social choices"
    - "mvg mechanism differential privacy under matrix valued query"
    - "amplification by shuffling from local to central differential privacy via anonymity"
    - "ektelo a framework for defining differentially private computations"
    - "shrinkwrap differentially private query processing in private data federations"
    - "locally differentially private heavy hitter identification"
    - "renyi differential privacy"
    - "prochlo strong privacy for analytics in the crowd"

Connected through hyperedge HE-2 (induced by source paper "outis crypto assisted differential privacy on untrusted servers"):
  with members:
    - "an economic analysis of privacy protection and statistical accuracy as social choices"
    - "mvg mechanism differential privacy under matrix valued query"
    - "amplification by shuffling from local to central differential privacy via anonymity"
    - "ektelo a framework for defining differentially private computations"
    - "shrinkwrap differentially private query processing in private data federations"
    - "locally differentially private heavy hitter identification"
    - "marginal release under local differential privacy"
    - "cryptodl deep neural networks over encrypted data"

Connected through hyperedge HE-3 (induced by source paper "mvg mechanism differential privacy under matrix valued query"):
  with members:
    - "a differential privacy mechanism design under matrix valued query"
    - "towards practical differential privacy for sql queries"
    - "coupling random orthonormal projection with gaussian generative model for non interactive private data release"
    - "convex optimization for linear query processing under approximate differential privacy"
    - "understanding the sparse vector technique for differential privacy"
    - "principled evaluation of differentially private algorithms using dpbench"
    - "an improved private mechanism for small databases"
    - "a data and workload aware algorithm for range queries under differential privacy"

Connected through hyperedge HE-4 (induced by source paper "privacy preserving aggregation of controllable loads to compensate fluctuations in solar power"):
  with members:
    - "battery energy storage scheduling for optimal load variance minimization"

Connected through hyperedge HE-5 (induced by source paper "differentially private query learning from data publishing to model publishing"):
  with members:
    - "optimal error of query sets under the differentially private matrix mechanism"
    - "a learning theory approach to non interactive database privacy"
    - "differential privacy via wavelet transforms"
    - "boosting the accuracy of differentially private histograms through consistency"
    - "what can we learn privately"

Connected through hyperedge HE-6 (induced by source paper "convex optimization for linear query processing under approximate differential privacy"):
  with members:
    - "rappor randomized aggregatable privacy preserving ordinal response"
    - "a data and workload aware algorithm for range queries under differential privacy"
    - "the geometry of differential privacy the sparse and approximate cases"
    - "calibrating data to sensitivity in private data analysis"
    - "an adaptive mechanism for accurate query answering under differential privacy"
    - "low rank mechanism for optimizing batch queries under differential privacy"
    - "optimal error of query sets under the differentially private matrix mechanism"
    - "differential privacy via wavelet transforms"

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)