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: "hottsql proving query rewrites with univalent sql semantics"
  Abstract: Every database system contains a query optimizer that performs query rewrites. Unfortunately, developing query optimizers remains a highly challenging task. Part of the challenges comes from the intricacies and rich features of query languages, which makes reasoning about rewrite rules difficult. In this paper, we propose a machine-checkable denotational semantics for SQL, the de facto language for relational database, for rigorously validating rewrite rules. Unlike previously proposed semantics that are either non-mechanized or only cover a small amount of SQL language features, our semantics covers all major features of SQL, including bags, correlated subqueries, aggregation, and indexes. Our mechanized semantics, called HoTTSQL, is based on K-Relations and homotopy type theory, where we denote relations as mathematical functions from tuples to univalent types. We have implemented HoTTSQL in Coq, which takes only fewer than 300 lines of code and have proved a wide range of SQL rewrite rules, including those from database research literature (e.g., magic set rewrites) and real-world query optimizers (e.g., subquery elimination). Several of these rewrite rules have never been previously proven correct. In addition, while query equivalence is generally undecidable, we have implemented an automated decision procedure using HoTTSQL for conjunctive queries: a well-studied decidable fragment of SQL that encompasses many real-world queries.

Connected through hyperedge HE-1 (induced by source paper "synthesizing database programs for schema refactoring"):
  with members:
    - "relational program synthesis"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "verifying equivalence of database driven applications"
    - "deepcoder learning to write programs"
    - "on the automated verification of web applications with embedded sql"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-2 (induced by source paper "a hott quantum equational theory extended version"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "homotopies for free"
    - "the hott library a formalization of homotopy type theory in coq"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "higher inductive types as homotopy initial algebras"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-3 (induced by source paper "the hott library a formalization of homotopy type theory in coq"):
  with members:
    - "formalising real numbers in homotopy type theory"
    - "partiality revisited the partiality monad as a quotient inductive inductive type"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "equations for hereditary substitution in leivant s predicative system f a case study"
    - "type classes for efficient exact real arithmetic in coq"
    - "type classes for mathematics in type theory"

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.PL(Programming Languages)