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 "expander cnfs have exponential dnnf size"):
  Abstract: Decomposable Negation Normal Forms (DNNFs) are a restricted form of Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables. We prove an unconditional exponential lower bound on the size of DNNFs for a class of CNF formulas built from expander graphs. This result settles several open problems in the area of knowledge compilation (Darwiche and Marquis, 2002).

Includes members:
  Member "no small nondeterministic read once branching programs for cnfs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "connecting knowledge compilation classes and width parameters")
  Member "on compiling structured cnfs to obdds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the relation between structured d dnnfs and sdds")
  Member "on the read once property of branching programs and cnfs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "regular resolution for cnf of bounded incidence treewidth with few long clauses")
  Member "on obdds for cnfs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "connecting knowledge compilation classes and width parameters")
  Member "lower bounds for exact model counting and applications in probabilistic databases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the relation between structured d dnnfs and sdds")
  Member "a knowledge compilation map":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "abstracting probabilistic models a logical perspective")

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.CC(Computational Complexity)