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: "interactive channel capacity revisited"
  Abstract: We provide the first capacity approaching coding schemes that robustly simulate any interactive protocol over an adversarial channel that corrupts any $\epsilon$ fraction of the transmitted symbols. Our coding schemes achieve a communication rate of $1 - O(\sqrt{\epsilon \log \log 1/\epsilon})$ over any adversarial channel. This can be improved to $1 - O(\sqrt{\epsilon})$ for random, oblivious, and computationally bounded channels, or if parties have shared randomness unknown to the channel. #R##N#Surprisingly, these rates exceed the $1 - \Omega(\sqrt{H(\epsilon)}) = 1 - \Omega(\sqrt{\epsilon \log 1/\epsilon})$ interactive channel capacity bound which [Kol and Raz; STOC'13] recently proved for random errors. We conjecture $1 - \Theta(\sqrt{\epsilon \log \log 1/\epsilon})$ and $1 - \Theta(\sqrt{\epsilon})$ to be the optimal rates for their respective settings and therefore to capture the interactive channel capacity for random and adversarial errors. #R##N#In addition to being very communication efficient, our randomized coding schemes have multiple other advantages. They are computationally efficient, extremely natural, and significantly simpler than prior (non-capacity approaching) schemes. In particular, our protocols do not employ any coding but allow the original protocol to be performed as-is, interspersed only by short exchanges of hash values. When hash values do not match, the parties backtrack. Our approach is, as we feel, by far the simplest and most natural explanation for why and how robust interactive communication in a noisy environment is possible.

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"
    - "the adversarial noise threshold for distributed protocols"
    - "adaptive protocols for interactive communication"
    - "optimal error rates for interactive coding ii efficiency and list decoding"

Connected through hyperedge HE-2 (induced by source paper "on the interactive capacity of finite state protocols"):
  with members:
    - "a lower bound on the interactive capacity of binary memoryless symmetric channels"
    - "bridging the capacity gap between interactive and one way communication"
    - "information equals amortized communication"

Connected through hyperedge HE-3 (induced by source paper "small memory robust simulation of client server interactive protocols over oblivious noisy channels"):
  with members:
    - "efficient multiparty interactive coding for insertions deletions and substitutions"
    - "coding for interactive communication with small memory and applications to robust circuits"
    - "optimal error rates for interactive coding ii efficiency and list decoding"

Connected through hyperedge HE-4 (induced by source paper "a lower bound on the interactive capacity of binary memoryless symmetric channels"):
  with members:
    - "extremes of error exponents"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (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"
    - "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-6 (induced by source paper "erasure correction for noisy radio networks"):
  with members:
    - "broadcasting in noisy radio networks"
    - "multi message broadcast with abstract mac layers and unreliable links"
    - "randomized broadcast in radio networks with collision detection"
    - "bounds on contention management in radio networks"

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

Connected through hyperedge HE-8 (induced by source paper "shannon capacity is achievable for binary interactive first order markovian protocols"):
  with members:
    - "interactive coding for markovian protocols"
    - "bridging the capacity gap between interactive and one way communication"

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)