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 "losing weight by gaining edges"):
  Abstract: We present a new way to encode weighted sums into unweighted pairwise constraints, obtaining the following results. #R##N#- Define the k-SUM problem to be: given n integers in [-n^2k, n^2k] are there k which sum to zero? (It is well known that the same problem over arbitrary integers is equivalent to the above definition, by linear-time randomized reductions.) We prove that this definition of k-SUM remains W[1]-hard, and is in fact W[1]-complete: k-SUM can be reduced to f(k) * n^o(1) instances of k-Clique. #R##N#- The maximum node-weighted k-Clique and node-weighted k-dominating set problems can be reduced to n^o(1) instances of the unweighted k-Clique and k-dominating set problems, respectively. This implies a strong equivalence between the time complexities of the node weighted problems and the unweighted problems: any polynomial improvement on one would imply an improvement for the other. #R##N#- A triangle of weight 0 in a node weighted graph with m edges can be deterministically found in m^1.41 time.

Includes members:
  Member "threesomes degenerates and love triangles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the fine grained complexity of parity problems")
  Member "popular conjectures imply strong lower bounds for dynamic problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "the parameterized complexity of domination type problems and application to linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new algorithms for weighted k domination and total k domination problems in proper interval graphs")
  Member "3sum 3xor triangles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "all non trivial variants of 3 ldt are equivalent")
  Member "exact weight subgraphs and the k sum conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "all non trivial variants of 3 ldt are equivalent")
  Member "reducing a target interval to a few exact queries":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equal subset sum faster than the meet in the middle")

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)