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: "maximal noise in interactive communication over erasure channels and channels with feedback"
  Abstract: We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3. Additionally, we provide a simple and efficient robust protocol that succeeds as long as the fraction of noise is at most 1/3 - \epsilon. Surprisingly, both bounds hold regardless of whether the parties send bits or symbols from an arbitrarily large alphabet. We also consider interactive communication over erasure channels. We provide a protocol that matches the optimal tolerable erasure rate of 1/2 - \epsilon of previous protocols (Franklin et al., CRYPTO '13) but operates in a much simpler and more efficient way. Our protocol works with an alphabet of size 4, in contrast to prior protocols in which the alphabet size grows as epsilon goes to zero. Building on the above algorithm with a fixed alphabet size, we are able to devise a protocol for binary erasure channels that tolerates erasure rates of up to 1/3 - \epsilon.

Connected through hyperedge HE-1 (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"
    - "interactive channel capacity revisited"
    - "adaptive protocols for interactive communication"
    - "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-2 (induced by source paper "optimal short circuit resilient formulas"):
  with members:
    - "interactive channel capacity revisited"
    - "adaptive protocols for interactive communication"
    - "optimal error rates for interactive coding i adaptivity and other settings"

Connected through hyperedge HE-3 (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"
    - "interactive channel capacity revisited"
    - "deletion codes in the high noise and high rate regimes"
    - "adaptive protocols for interactive communication"

Connected through hyperedge HE-4 (induced by source paper "making asynchronous distributed computations robust to noise"):
  with members:
    - "coding for interactive communication correcting insertions and deletions"
    - "balancing communication for multi party interactive coding"
    - "interactive channel capacity revisited"
    - "the adversarial noise threshold for distributed protocols"
    - "breathe before speaking efficient information dissemination despite noisy limited and anonymous communication"
    - "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-5 (induced by source paper "bridging the capacity gap between interactive and one way communication"):
  with members:
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"

Connected through hyperedge HE-6 (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"
    - "interactive channel capacity revisited"
    - "deletion codes in the high noise and high rate regimes"
    - "adaptive protocols for interactive communication"
    - "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-7 (induced by source paper "the adversarial noise threshold for distributed protocols"):
  with members:
    - "sparse sums of positive semidefinite matrices"
    - "balancing communication for multi party interactive coding"
    - "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"
    - "faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms"
    - "twice ramanujan sparsifiers"

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

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)