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 "coding for interactive communication correcting insertions and deletions"):
  Abstract: We consider the question of interactive communication, in which two remote parties perform a computation while their communication channel is (adversarially) noisy. We extend here the discussion into a more general and stronger class of noise, namely, we allow the channel to perform insertions and deletions of symbols. These types of errors may bring the parties "out of sync", so that there is no consensus regarding the current round of the protocol. #R##N#In this more general noise model, we obtain the first interactive coding scheme that has a constant rate and resists noise rates of up to $1/18-\varepsilon$. To this end we develop a novel primitive we name edit distance tree code. The edit distance tree code is designed to replace the Hamming distance constraints in Schulman's tree codes (STOC 93), with a stronger edit distance requirement. However, the straightforward generalization of tree codes to edit distance does not seem to yield a primitive that suffices for communication in the presence of synchronization problems. Giving the "right" definition of edit distance tree codes is a main conceptual contribution of this work.

Includes members:
  Member "an improved bound on the fraction of correctable deletions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "locally decodable codes with randomized encoding")
  Member "efficient low redundancy codes for correcting multiple deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "low complexity interactive algorithms for synchronization from deletions insertions and substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "list decoding of deletions using guess check codes")
  Member "maximal noise in interactive communication over erasure channels and channels with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions")
  Member "deletion codes in the high noise and high rate regimes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locally decodable codes with randomized encoding")
  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 "interactive coding resilient to an unknown number of erasures")

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)