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: "demand driven incremental object queries"
  Abstract: Object queries are essential in information seeking and decision making in vast areas of applications. However, a query may involve complex conditions on objects and sets, which can be arbitrarily nested and aliased. The objects and sets involved as well as the demand---the given parameter values of interest---can change arbitrarily. How to implement object queries efficiently under all possible updates, and furthermore to provide complexity guarantees? #R##N#This paper describes an automatic method. The method allows powerful queries to be written completely declaratively. It transforms demand as well as all objects and sets into relations. Most importantly, it defines invariants for not only the query results, but also all auxiliary values about the objects and sets involved, including those for propagating demand, and incrementally maintains all of them. Implementation and experiments with problems from a variety of application areas, including distributed algorithms and probabilistic queries, confirm the analyzed complexities, trade-offs, and significant improvements over prior work.

Connected through hyperedge HE-1 (induced by source paper "algorithm diversity for resilient systems"):
  with members:
    - "from clarity to efficiency for distributed algorithms"

Connected through hyperedge HE-2 (induced by source paper "logic programming applications what are the abstractions and implementations"):
  with members:
    - "applp a dialogue on applications of logic programming"
    - "precise complexity guarantees for pointer analysis via datalog with extensions"
    - "the founded semantics and constraint semantics of logic rules"
    - "team building with answer set programming in the gioia tauro seaport"
    - "xsb extending prolog with tabled logic programming"
    - "fo fd extending classical logic with rule based fixpoint definitions"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-3 (induced by source paper "simpler specifications and easier proofs of distributed algorithms using history variables"):
  with members:
    - "paxos made epr decidable reasoning about distributed protocols"
    - "auxiliary variables in tla"
    - "formal verification of multi paxos for distributed consensus"
    - "from clarity to efficiency for distributed algorithms"
    - "a tla proof system"

Connected through hyperedge HE-4 (induced by source paper "from clarity to efficiency for distributed algorithms"):
  with members:
    - "formal verification of multi paxos for distributed consensus"
    - "a linear logic programming language for concurrent programming over graph structures"
    - "applying prolog to develop distributed systems"

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)