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: "on the read once property of branching programs and cnfs of bounded treewidth"
  Abstract: In this paper we prove a space lower bound of $n^{\Omega(k)}$ for non-deterministic (syntactic) read-once branching programs ({\sc nrobp}s) on functions expressible as {\sc cnf}s with treewidth at most $k$ of their primal graphs. This lower bound rules out the possibility of fixed-parameter space complexity of {\sc nrobp}s parameterized by $k$. #R##N#We use lower bound for {\sc nrobp}s to obtain a quasi-polynomial separation between Free Binary Decision Diagrams and Decision Decomposable Negation Normal Forms, essentially matching the existing upper bound introduced by Beame et al. and thus proving the tightness of the latter.

Connected through hyperedge HE-1 (induced by source paper "regular resolution for cnf of bounded incidence treewidth with few long clauses"):
  with members:
    - "understanding the complexity of sat using knowledge compilation"
    - "narrow proofs may be maximally long"
    - "understanding model counting for beta acyclic cnf formulas"

Connected through hyperedge HE-2 (induced by source paper "on the relative succinctness of sentential decision diagrams"):
  with members:
    - "a superpolynomial lower bound for the size of non deterministic complement of an unambiguous automaton"
    - "non fpt lower bounds for structural restrictions of decision dnnf"
    - "circuit treewidth sentential decision and query compilation"
    - "sdds are exponentially more succinct than obdds"
    - "new limits for knowledge compilation and applications to exact model counting"
    - "on oblivious branching programs with bounded repetition that cannot efficiently compute cnfs of bounded treewidth"
    - "lower bounds for exact model counting and applications in probabilistic databases"
    - "the language of search"

Connected through hyperedge HE-3 (induced by source paper "circuit treewidth sentential decision and query compilation"):
  with members:
    - "tractable lineages on treelike instances limits and extensions"
    - "parameterized compilation lower bounds for restricted cnf formulas"
    - "sdds are exponentially more succinct than obdds"
    - "new limits for knowledge compilation and applications to exact model counting"
    - "on obdds for cnfs of bounded treewidth"
    - "cliquewidth and knowledge compilation"
    - "the dichotomy of conjunctive queries on probabilistic structures"
    - "a knowledge compilation map"

Connected through hyperedge HE-4 (induced by source paper "on oblivious branching programs with bounded repetition that cannot efficiently compute cnfs of bounded treewidth"):
  with members:
    - "width hierarchy for k obdd of small width"
    - "two types of branching programs with bounded repetition that cannot efficiently compute monotone 3 cnfs"
    - "no small nondeterministic read once branching programs for cnfs of bounded treewidth"
    - "expander cnfs have exponential dnnf size"
    - "on obdds for cnfs of bounded treewidth"

Connected through hyperedge HE-5 (induced by source paper "new limits for knowledge compilation and applications to exact model counting"):
  with members:
    - "on obdds for cnfs of bounded treewidth"
    - "lower bounds for exact model counting and applications in probabilistic databases"
    - "the language of search"

Connected through hyperedge HE-6 (induced by source paper "expander cnfs have exponential dnnf size"):
  with members:
    - "no small nondeterministic read once branching programs for cnfs of bounded treewidth"
    - "on compiling structured cnfs to obdds"
    - "on obdds for cnfs of bounded treewidth"
    - "lower bounds for exact model counting and applications in probabilistic databases"
    - "a knowledge compilation map"

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