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 "adaptive protocols for interactive communication"):
  Abstract: How much adversarial noise can protocols for interactive communication tolerate? This question was examined by Braverman and Rao (IEEE Trans. Inf. Theory, 2014) for the case of "robust" protocols, where each party sends messages only in fixed and predetermined rounds. We consider a new class of non-robust protocols for Interactive Communication, which we call adaptive protocols. Such protocols adapt structurally to the noise induced by the channel in the sense that both the order of speaking, and the length of the protocol may vary depending on observed noise. #R##N#We define models that capture adaptive protocols and study upper and lower bounds on the permissible noise rate in these models. When the length of the protocol may adaptively change according to the noise, we demonstrate a protocol that tolerates noise rates up to $1/3$. When the order of speaking may adaptively change as well, we demonstrate a protocol that tolerates noise rates up to $2/3$. Hence, adaptivity circumvents an impossibility result of $1/4$ on the fraction of tolerable noise (Braverman and Rao, 2014).

Includes members:
  Member "maximal noise in interactive communication over erasure channels and channels with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interactive coding resilient to an unknown number of erasures")
  Member "interactive channel capacity revisited":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions")
  Member "the adversarial noise threshold for distributed protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noisy beeping networks")
  Member "optimal error rates for interactive coding i adaptivity and other settings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interactive coding resilient to an unknown number of erasures")
  Member "optimal error rates for interactive coding ii efficiency and list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions")
  Member "tree codes and a conjecture on exponential sums":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on decoding cohen haeupler schulman tree codes")

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)