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 "interactive coding resilient to an unknown number of erasures"):
  Abstract: We consider distributed computations between two parties carried out over a noisy channel that may erase messages. Following a noise model proposed by Dani et al. (2018), the noise level observed by the parties during the computation in our setting is arbitrary and a priory unknown to the parties. #R##N#We develop interactive coding schemes that adapt to the actual level of noise and correctly execute any two-party computation. Namely, in case the channel erases $T$ transmissions, the coding scheme will take $N+2T$ transmissions (using alphabet of size $4$) to correctly simulate any binary protocol that takes $N$ transmissions assuming a noiseless channel. We can further reduce the communication to $N+T$ if we relax the communication model in a similar way to the adaptive setting of Agrawal et al. (2016), and allow the parties to remain silent rather than transmitting a message in each and every round of the coding scheme. #R##N#Our coding schemes are efficient, deterministic, have linear overhead both in their communication and round complexity, and succeed (with probability 1) regardless of the amount of erasures $T$.

Includes members:
  Member "distributed computing with channel noise":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions")
  Member "sending a message with unknown noise":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scalable and secure computation among strangers resource competitive byzantine protocols")
  Member "interactive communication with unknown noise rate":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  Member "coding for interactive communication correcting insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "covering codes for insertions and deletions")
  Member "maximal noise in interactive communication over erasure channels and channels with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal short circuit resilient formulas")
  Member "interactive channel capacity revisited":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions")
  Member "adaptive protocols for interactive communication":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions")
  Member "optimal error rates for interactive coding i adaptivity and other settings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal short circuit resilient 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.DS(Data Structures and Algorithms)