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 reduction of the csp dichotomy conjecture to digraphs"
  Abstract: It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the bounded width property, i.e., solvability by local consistency methods. We discuss further algorithmic properties that are preserved and related open problems.

Connected through hyperedge HE-1 (induced by source paper "a finer reduction of constraint problems to digraphs"):
  with members:
    - "the complexity of general valued csps"
    - "an algebraic theory of complexity for discrete optimization"
    - "absorbing subalgebras cyclic terms and the constraint satisfaction problem"
    - "on the scope of the universal algebraic approach to constraint satisfaction"
    - "the dichotomy of list homomorphisms for digraphs"
    - "a characterisation of first order constraint satisfaction problems"

Connected through hyperedge HE-2 (induced by source paper "hybrid v csps and algebraic reductions"):
  with members:
    - "algebraic properties of valued constraint satisfaction problem"
    - "the complexity of general valued csps"
    - "effectiveness of structural restrictions for hybrid csps"
    - "sherali adams relaxations for valued csps"
    - "the complexity of conservative valued csps"
    - "hybrid tractability of valued constraint problems"

Connected through hyperedge HE-3 (induced by source paper "a reduction from valued csp to min cost homomorphism problem for digraphs"):
  with members:
    - "a finer reduction of constraint problems to digraphs"
    - "algebraic properties of valued constraint satisfaction problem"
    - "the complexity of general valued csps"
    - "an algebraic theory of complexity for discrete optimization"
    - "computational complexity of the minimum cost homomorphism problem on three element domains"
    - "extensions of the minimum cost homomorphism problem"

Connected through hyperedge HE-4 (induced by source paper "effectiveness of structural restrictions for hybrid csps"):
  with members:
    - "sherali adams relaxations for valued csps"
    - "the complexity of conservative valued csps"
    - "hybrid tractability of valued constraint problems"

Connected through hyperedge HE-5 (induced by source paper "on backdoors to tractable constraint languages"):
  with members:
    - "backdoors into heterogeneous classes of sat and csp"
    - "strong backdoors to bounded treewidth sat"

Connected through hyperedge HE-6 (induced by source paper "space complexity of list h colouring a dichotomy"):
  with members:
    - "the dichotomy of list homomorphisms for digraphs"
    - "the complexity of the list homomorphism problem for graphs"
    - "a characterisation of first order constraint satisfaction problems"

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)