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 "efficient multiparty interactive coding for insertions deletions and substitutions"):
  Abstract: In the field of interactive coding, two or more parties wish to carry out a distributed computation over a communication network that may be noisy. The ultimate goal is to develop efficient coding schemes that can tolerate a high level of noise while increasing the communication by only a constant factor (i.e., constant rate). #R##N#In this work we consider synchronous communication networks over an arbitrary topology, in the powerful adversarial insertion-deletion noise model. Namely, the noisy channel may adversarially alter the content of any transmitted symbol, as well as completely remove a transmitted symbol or inject a new symbol into the channel. We provide efficient, constant rate schemes that successfully conduct any computation with high probability as long as the adversary corrupts at most $\varepsilon /m$ fraction of the total communication, where $m$ is the number of links in the network and $\varepsilon$ is a small constant. This scheme assumes the parties share a random string to which the adversarial noise is oblivious. We can remove this assumption at the price of being resilient to $\varepsilon / (m\log m)$ adversarial error. #R##N#While previous work considered the insertion-deletion noise model in the two-party setting, to the best of our knowledge, our scheme is the first multiparty scheme that is resilient to insertions and deletions. Furthermore, our scheme is the first computationally efficient scheme in the multiparty setting that is resilient to adversarial noise.

Includes members:
  Member "synchronization strings channel simulations and interactive coding for insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "locally decodable codes with randomized encoding")
  Member "distributed computing with channel noise":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consensus needs broadcast in noiseless models but can be exponentially easier in the presence of noise")
  Member "coding for interactive communication correcting insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covering codes for insertions and deletions")
  Member "interactive channel capacity revisited":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the interactive capacity of finite state protocols")
  Member "the adversarial noise threshold for distributed protocols":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "noisy beeping networks")
  Member "adaptive protocols for interactive communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "small memory robust simulation of client server interactive protocols over oblivious noisy channels")

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)