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 "doubly efficient pseudo deterministic proofs"):
  Abstract: In [20] Goldwasser, Grossman and Holden introduced pseudo-deterministic interactive proofs for search problems where a powerful prover can convince a probabilistic polynomial time verifier that a solution to a search problem is canonical. They studied search problems for which polynomial time algorithms are not known and for which many solutions are possible. They showed that whereas there exists a constant round pseudo deterministic proof for graph isomorphism where the canonical solution is the lexicographically smallest isomorphism, the existence of pseudo-deterministic interactive proofs for NP-hard problems would imply the collapse of the polynomial time hierarchy. #R##N#In this paper, we turn our attention to studying doubly-efficient pseudo-deterministic proofs for polynomial time search problems: pseudo-deterministic proofs with the extra requirement that the prover runtime is polynomial and the verifier runtime to verify that a solution is canonical is significantly lower than the complexity of finding any solution, canonical or otherwise. Naturally this question is particularly interesting for search problems for which a lower bound on its worst case complexity is known or has been widely conjectured. #R##N#We show doubly-efficient pseudo-deterministic algorithms for a host of natural problems whose complexity has long been conjectured. In particular: #R##N#We show a doubly efficient pseudo-deterministic proof for linear programming where the canonical solution which the prover will provide is the lexicographically greatest optimal solution for the LP. #R##N#We show a doubly efficient pseudo-deterministic proof for 3-SUM and problems reducible to 3-SUM. #R##N#We show a doubly-efficient pseudo-deterministic proof for the hitting set problem. #R##N#We show a doubly-efficient pseudo-deterministic proof for the Zero Weight Triangle problem.

Includes members:
  Member "solving linear programs in the current matrix multiplication time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "pseudo deterministic proofs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pseudo deterministic streaming")
  Member "graph isomorphism in quasipolynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "into the square on the complexity of quadratic time solvable problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "diameter computation on h minor free graphs and graphs of bounded distance vc dimension")
  Member "time optimal interactive proofs for circuit evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "veriml enabling integrity assurances and fair payments for machine learning as a service")
  Member "verifiable computation with massively parallel interactive proofs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "non cooperative rational interactive proofs")
  Member "practical verified computation with streaming interactive proofs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the efficient server audit problem deduplicated re execution and the web")

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)