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 "trade offs in distributed interactive proofs"):
  Abstract: The study of interactive proofs in the context of distributed network computing is a novel topic, recently introduced by Kol, Oshman, and Saxena [PODC 2018]. In the spirit of sequential interactive proofs theory, we study the power of distributed interactive proofs. This is achieved via a series of results establishing trade-offs between various parameters impacting the power of interactive proofs, including the number of interactions, the certificate size, the communication complexity, and the form of randomness used. Our results also connect distributed interactive proofs with the established field of distributed verification. In general, our results contribute to providing structure to the landscape of distributed interactive proofs.

Includes members:
  Member "the power of distributed verifiers in interactive proofs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "certifying safety when implementing consensus")
  Member "distributed triangle detection via expander decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed testing of graph isomorphism in the congest model")
  Member "redundancy in distributed proofs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "introduction to local certification")
  Member "distributed pcp theorems for hardness of approximation in p":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails")
  Member "survey of distributed decision":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "what graph neural networks cannot learn depth vs width")
  Member "a hierarchy of local decision":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a breezing proof of the kmw bound")
  Member "one round multi party communication complexity of distinguishing sums":
    also connected through other hyperedges:
      (none)
  Member "randomized distributed decision":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "introduction to local certification")

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.DC(Distributed, Parallel, and Cluster Computing)