human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "allsat compressed with wildcards from cnf s to orthogonal dnf s by imposing the clauses one by one"):
  Abstract: We present a novel technique for converting a Boolean CNF into an orthogonal DNF, aka exclusive sum of products. Our method (which will be pitted against a hardwired command from Mathematica) zooms in on the models of the CNF by imposing the clauses one after another. Wildcards beyond the common don't-care symbol compress the output. Furthermore, clausal imposition adapts well (challenging BDD's) to enumerate all models of bounded weight.

Includes members:
  Member "implementing efficient all solutions sat solvers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exploiting database management systems and treewidth for counting")
  Member "computing the output distribution and selection probabilities of a stack filter from the dnf of its positive boolean function":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "allsat compressed with wildcards part 1 converting cnf s to orthogonal dnf s")
  Member "counting or producing all fixed cardinality transversals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "allsat compressed with wildcards partitionings and face numbers of simplicial complexes")
  Member "compactly generating all satisfying truth assignments of a horn formula":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "allsat compressed with wildcards partitionings and face numbers of simplicial complexes")

Question: Please tell me which class the source paper 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)