human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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).

Connected through hyperedge HE-1 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions"):
  with members:
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "distributed computing with channel noise"
    - "coding for interactive communication correcting insertions and deletions"
    - "interactive channel capacity revisited"
    - "the adversarial noise threshold for distributed protocols"
    - "optimal error rates for interactive coding ii efficiency and list decoding"

Connected through hyperedge HE-2 (induced by source paper "interactive coding resilient to an unknown number of erasures"):
  with members:
    - "distributed computing with channel noise"
    - "sending a message with unknown noise"
    - "interactive communication with unknown noise rate"
    - "coding for interactive communication correcting insertions and deletions"
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "optimal error rates for interactive coding ii efficiency and list decoding"

Connected through hyperedge HE-3 (induced by source paper "optimal short circuit resilient formulas"):
  with members:
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"

Connected through hyperedge HE-4 (induced by source paper "synchronization strings channel simulations and interactive coding for insertions and deletions"):
  with members:
    - "synchronization strings list decoding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "synchronization strings efficient and fast deterministic constructions over small alphabets"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "interactive channel capacity revisited"
    - "deletion codes in the high noise and high rate regimes"

Connected through hyperedge HE-5 (induced by source paper "coding for interactive communication correcting insertions and deletions"):
  with members:
    - "an improved bound on the fraction of correctable deletions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "interactive channel capacity revisited"
    - "deletion codes in the high noise and high rate regimes"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "optimal error rates for interactive coding ii efficiency and list decoding"

Connected through hyperedge HE-6 (induced by source paper "maximal noise in interactive communication over erasure channels and channels with feedback"):
  with members:
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "optimal error rates for interactive coding ii efficiency and list decoding"
    - "tree codes and a conjecture on exponential sums"

Connected through hyperedge HE-7 (induced by source paper "balancing communication for multi party interactive coding"):
  with members:
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"

Connected through hyperedge HE-8 (induced by source paper "optimal error rates for interactive coding ii efficiency and list decoding"):
  with members:
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"

Question: Please tell me which class the center node 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)