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: "linear tabling strategies and optimizations"
  Abstract: Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the strategies used in handling looping subgoals. One decision concerns when answers are consumed and returned. This paper describes two strategies, namely, {\it lazy} and {\it eager} strategies, and compares them both qualitatively and quantitatively. The results indicate that, while the lazy strategy has good locality and is well suited for finding all solutions, the eager strategy is comparable in speed with the lazy strategy and is well suited for programs with cuts. Linear tabling relies on depth-first iterative deepening rather than suspension to compute fixpoints. Each cluster of inter-dependent subgoals as represented by a top-most looping subgoal is iteratively evaluated until no subgoal in it can produce any new answers. Naive re-evaluation of all looping subgoals, albeit simple, may be computationally unacceptable. In this paper, we also introduce semi-naive optimization, an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers, into linear tabling. We give the conditions for the technique to be safe (i.e. sound and complete) and propose an optimization technique called {\it early answer promotion} to enhance its effectiveness. Benchmarking in B-Prolog demonstrates that with this optimization linear tabling compares favorably well in speed with the state-of-the-art implementation of SLG.

Connected through hyperedge HE-1 (induced by source paper "tabled typeclass resolution"):
  with members:
    - "type classes for efficient exact real arithmetic in coq"
    - "type classes for mathematics in type theory"
    - "xsb extending prolog with tabled logic programming"
    - "linear tabulated resolution based on prolog control strategy"

Connected through hyperedge HE-2 (induced by source paper "viterbi training in prism"):
  with members:
    - "the pita system tabling and answer subsumption for reasoning under uncertainty"
    - "parameter learning of logic programs for symbolic statistical modeling"
    - "efficient probabilistic top down and left corner parsing"

Connected through hyperedge HE-3 (induced by source paper "planning as tabled logic programming"):
  with members:
    - "using tabled logic programming to solve the petrobras planning problem"
    - "efficient tabling of structured data with enhanced hash consing"

Connected through hyperedge HE-4 (induced by source paper "infinite probability computation by cyclic explanation graphs"):
  with members:
    - "model checking with probabilistic tabled logic programming"
    - "the pita system tabling and answer subsumption for reasoning under uncertainty"
    - "xsb extending prolog with tabled logic programming"
    - "on applying or parallelism and tabling to logic programs"
    - "parameter learning of logic programs for symbolic statistical modeling"
    - "efficient probabilistic top down and left corner parsing"
    - "prefix probabilities from stochastic tree adjoining grammars"

Connected through hyperedge HE-5 (induced by source paper "combinatorial search with picat"):
  with members:
    - "using tabled logic programming to solve the petrobras planning problem"
    - "the language features and architecture of b prolog"

Connected through hyperedge HE-6 (induced by source paper "toward a dynamic programming solution for the 4 peg tower of hanoi problem with configurations"):
  with members:
    - "the language features and architecture of b prolog"

Connected through hyperedge HE-7 (induced by source paper "efficient tabling of structured data with enhanced hash consing"):
  with members:
    - "global trie for subterms"
    - "representation sharing for prolog"
    - "the language features and architecture of b prolog"
    - "xsb extending prolog with tabled logic programming"
    - "o 1 reversible tree navigation without cycles"

Connected through hyperedge HE-8 (induced by source paper "optimal placement of valves in a water distribution network with clp fd"):
  with members:
    - "the language features and architecture of b prolog"
    - "clp based protein fragment assembly"
    - "design and implementation of aggregate functions in the dlv system"

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)