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 "achieving new upper bounds for the hypergraph duality problem through logic"):
  Abstract: The hypergraph duality problem Dual is defined as follows: given two simple hypergraphs $\mathcal{G}$ and $\mathcal{H}$, decide whether $\mathcal{H}$ consists precisely of all minimal transversals of $\mathcal{G}$ (in which case we say that $\mathcal{G}$ is the dual of $\mathcal{H}$ or, equivalently, the transversal hypergraph of $\mathcal{H}$). This problem is equivalent to deciding whether two given nonredundant monotone disjunctive normal forms/conjunctive normal forms are dual. It is known that $\overline{{\sc Dual}}$, the complementary problem to Dual, is in GC($\log^2 n$, PTIME), where GC($f(n)$, $\mathcal{C}$) denotes the complexity class of all problems that after a nondeterministic guess of $O(f(n))$ bits can be decided (checked) within complexity class $\mathcal{C}$. It was conjectured that $\overline{{\sc Dual}}$ is in GC($\log^2 n$, LOGSPACE). In this paper we prove this conjecture and actually place the $\overline{{\sc Dual}}$ problem into the complexity class GC($\log^2 n$, TC$^{0}$) which i...

Includes members:
  Member "deciding monotone duality and identifying frequent itemsets in quadratic logspace":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of mining itemsets from the crowd using taxonomies")
  Member "new results on monotone dualization and generating hypergraph transversals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quasi polynomial algorithms for list coloring of nearly intersecting hypergraphs")
  Member "incremental recompilation of knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficiently enumerating hitting sets of hypergraphs arising in data profiling")

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)