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: "cause clue clauses error localization using maximum satisfiability"
  Abstract: Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization based on a reduction to the maximal satisfiability problem (MAX-SAT), which asks what is the maximum number of clauses of a Boolean formula that can be simultaneously satisfied by an assignment. At an intuitive level, our algorithm takes as input a program and a failing test, and comprises the following three steps. First, using symbolic execution, we encode a trace of a program as a Boolean trace formula which is satisfiable iff the trace is feasible. Second, for a failing program execution (e.g., one that violates an assertion or a post-condition), we construct an unsatisfiable formula by taking the trace formula and additionally asserting that the input is the failing test and that the assertion condition does hold at the end. Third, using MAX-SAT, we find a maximal set of clauses in this formula that can be satisfied together, and output the complement set as a potential cause of the error. We have implemented our algorithm in a tool called bug-assist for C programs. We demonstrate the surprising effectiveness of the tool on a set of benchmark examples with injected faults, and show that in most cases, bug-assist can quickly and precisely isolate the exact few lines of code whose change eliminates the error. We also demonstrate how our algorithm can be modified to automatically suggest fixes for common classes of errors such as off-by-one.

Connected through hyperedge HE-1 (induced by source paper "responsibility analysis by abstract interpretation"):
  with members:
    - "a relational logic for higher order programs"
    - "provenance as dependency analysis"
    - "what causes a system to satisfy a specification"
    - "responsibility and blame a structural model approach"

Connected through hyperedge HE-2 (induced by source paper "approximation strategies for incomplete maxsat"):
  with members:
    - "automated synthesis of semantic malware signatures using maximum satisfiability"
    - "generalized totalizer encoding for pseudo boolean constraints"
    - "incremental cardinality constraints for maxsat"
    - "solving linux upgradeability problems using boolean optimization"

Connected through hyperedge HE-3 (induced by source paper "data driven feedback generation for introductory programming exercises"):
  with members:
    - "automated clustering and program repair for introductory programming assignments"
    - "semi supervised verified feedback generation"
    - "sk_p a neural program corrector for moocs"
    - "feedback generation for performance problems in introductory programming assignments"
    - "distributed representations of words and phrases and their compositionality"
    - "automated feedback generation for introductory programming assignments"

Connected through hyperedge HE-4 (induced by source paper "model based diagnosis of multiple observations with implicit hitting sets"):
  with members:
    - "propositional abduction with implicit hitting sets"
    - "algorithms for implicit hitting set problems"
    - "detecting inconsistencies in large biological networks with answer set programming"
    - "answer sets for consistent query answering in inconsistent databases"
    - "model based diagnosis using structured system descriptions"

Connected through hyperedge HE-5 (induced by source paper "learning to blame localizing novice type errors with data driven diagnosis"):
  with members:
    - "dynamic witnesses for static type errors or ill typed programs usually go wrong"
    - "adam a method for stochastic optimization"

Connected through hyperedge HE-6 (induced by source paper "learning likely invariants to explain why a program fails"):
  with members:
    - "inferring loop invariants by mutation dynamic analysis and static checking"
    - "casper debugging null dereferences with ghosts and causality traces"
    - "contracts in practice"
    - "automated fault localization using potential invariants 1"

Connected through hyperedge HE-7 (induced by source paper "fuzzy maximum satisfiability"):
  with members:
    - "solving linux upgradeability problems using boolean optimization"
    - "new inference rules for max sat"
    - "on using unsatisfiability for solving maximum satisfiability"
    - "a logical approach to efficient max sat solving"

Connected through hyperedge HE-8 (induced by source paper "exploiting resolution based representations for maxsat solving"):
  with members:
    - "incremental cardinality constraints for maxsat"
    - "on using unsatisfiability for solving maximum satisfiability"

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)