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: "boolean equi propagation for concise and efficient sat encodings of combinatorial problems"
  Abstract: We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate information about equalities between Boolean literals. This information is then applied to simplify the CNF encoding of the constraints. A key factor is that considering only a small fragment of a constraint model at one time enables us to apply stronger, and even complete, reasoning to detect equivalent literals in that fragment. Once detected, equivalences apply to simplify the entire constraint model and facilitate further reasoning on other fragments. Equi-propagation in combination with partial evaluation and constraint simplification provide the foundation for a powerful approach to SAT-based finite domain constraint solving. We introduce a tool called BEE (Ben-Gurion Equi-propagation Encoder) based on these ideas and demonstrate for a variety of benchmarks that our approach leads to a considerable reduction in the size of CNF encodings and subsequent speed-ups in SAT solving times.

Connected through hyperedge HE-1 (induced by source paper "optimal depth sorting networks"):
  with members:
    - "sorting networks to the end and back again"
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "new bounds on optimal sorting networks"
    - "computing the ramsey number r 4 3 3 using abstraction and symmetry breaking"
    - "applying sorting networks to synthesize optimized sorting libraries"
    - "sorting networks the end game"
    - "the quest for optimal sorting networks efficient generation of two layer prefixes"
    - "twenty five comparators is optimal when sorting nine inputs and twenty nine for ten"

Connected through hyperedge HE-2 (induced by source paper "clingcon the next generation"):
  with members:
    - "pddl planning via constraint answer set programming"
    - "predicate logic as a modelling language the idp system"
    - "clingo asp control preliminary report"
    - "aspartame solving constraint satisfaction problems with answer set programming"
    - "conflict driven asp solving with external sources"
    - "asp modulo csp the clingcon system"
    - "introduction to the 28th international conference on logic programming special issue"
    - "multi threaded asp solving with clasp"

Connected through hyperedge HE-3 (induced by source paper "logic programming with graph automorphism integrating naut with prolog tool description"):
  with members:
    - "graph isomorphism in quasipolynomial time"
    - "practical graph isomorphism ii"

Connected through hyperedge HE-4 (induced by source paper "breaking symmetries in graph search with canonizing sets"):
  with members:
    - "breaking symmetry with different orderings"
    - "conflict anticipation in the search for graph automorphisms"
    - "symmetry breaking constraints recent results"
    - "graph symmetry detection and canonical labeling differences and synergies"
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"

Connected through hyperedge HE-5 (induced by source paper "computing the ramsey number r 4 3 3 using abstraction and symmetry breaking"):
  with members:
    - "diamond free degree sequences"
    - "satisfiability and computing van der waerden numbers"

Connected through hyperedge HE-6 (induced by source paper "twenty five comparators is optimal when sorting nine inputs and twenty nine for ten"):
  with members:
    - "the quest for optimal sorting networks efficient generation of two layer prefixes"
    - "optimal sorting networks"

Connected through hyperedge HE-7 (induced by source paper "compiling finite domain constraints to sat with bee the director s cut"):
  with members:
    - "compiling finite domain constraints to sat with bee"
    - "boolean equi propagation for optimized sat encoding"
    - "optimal base encodings for pseudo boolean constraints"
    - "logic programming with satisfiability"

Connected through hyperedge HE-8 (induced by source paper "aspartame solving constraint satisfaction problems with answer set programming"):
  with members:
    - "asp modulo csp the clingcon system"
    - "a translational approach to constraint answer set solving"

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.AI(Artificial Intelligence)