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: "a galois connection for weighted relational clones of infinite size"
  Abstract: A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen et al. established a Galois connection between finitely-generated weighted clones and finitely-generated weighted relational clones [SICOMP’13], and asked whether this connection holds in general. We answer this question in the affirmative for weighted (relational) clones with real weights and show that the complexity of the corresponding valued CSPs is preserved.

Connected through hyperedge HE-1 (induced by source paper "the complexity of boolean surjective general valued csps"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the complexity of finite valued csps"
    - "algebraic properties of valued constraint satisfaction problem"
    - "the complexity of general valued csps"
    - "an algebraic hardness criterion for surjective constraint satisfaction"
    - "an algebraic theory of complexity for discrete optimization"
    - "on the approximation of submodular functions"

Connected through hyperedge HE-2 (induced by source paper "on planar valued csps"):
  with members:
    - "the power of sherali adams relaxations for general valued csps"
    - "even delta matroids and the complexity of planar boolean csps"
    - "the complexity of finite valued csps"
    - "necessary conditions for tractability of valued csps"
    - "hybrid v csps and algebraic reductions"
    - "algebraic properties of valued constraint satisfaction problem"
    - "the complexity of general valued csps"
    - "effectiveness of structural restrictions for hybrid csps"

Connected through hyperedge HE-3 (induced by source paper "binarisation for valued constraint satisfaction problems"):
  with members:
    - "the power of sherali adams relaxations for general valued csps"
    - "a finer reduction of constraint problems to digraphs"
    - "algebraic properties of valued constraint satisfaction problem"
    - "a reduction from valued csp to min cost homomorphism problem for digraphs"
    - "the complexity of general valued csps"
    - "sherali adams relaxations for valued csps"
    - "robustly solvable constraint satisfaction problems"
    - "an algebraic theory of complexity for discrete optimization"

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)