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 "hardness measures and resolution lower bounds"):
  Abstract: Various "hardness" measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving. In this report we aim at a unified view of a number of hardness measures, including different measures of width, space and size of resolution proofs. We also extend these measures to all clause-sets (possibly satisfiable).

Includes members:
  Member "on sat representations of xor constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the quest for an acyclic graph")
  Member "trading inference effort versus size in cnf knowledge compilation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on sat representations of xor constraints")
  Member "towards a theory of good sat representations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on sat representations of xor constraints")
  Member "understanding space in proof complexity separations and trade offs via substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "near optimal lower bounds on quantifier depth and weisfeiler leman refinement steps")
  Member "circuit complexity and decompositions of global constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bounds on the size of pc and urc formulas")

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)