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: "the adversarial noise threshold for distributed protocols"
  Abstract: We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology. #R##N#In our first result we show that any $n$-party $T$-round protocol on an undirected communication network $G$ can be compiled into a robust simulation protocol on a sparse ($\mathcal{O}(n)$ edges) subnetwork so that the simulation tolerates an adversarial error rate of $\Omega\left(\frac{1}{n}\right)$; the simulation has a round complexity of $\mathcal{O}\left(\frac{m \log n}{n} T\right)$, where $m$ is the number of edges in $G$. (So the simulation is work-preserving up to a $\log$ factor.) The adversary's error rate is within a constant factor of optimal. Given the error rate, the round complexity blowup is within a factor of $\mathcal{O}(k \log n)$ of optimal, where $k$ is the edge connectivity of $G$. We also determine that the maximum tolerable error rate on directed communication networks is $\Theta(1/s)$ where $s$ is the number of edges in a minimum equivalent digraph. #R##N#Next we investigate adversarial per-edge error rates, where the adversary is given an error budget on each edge of the network. We determine the exact limit for tolerable per-edge error rates on an arbitrary directed graph. However, the construction that approaches this limit has exponential round complexity, so we give another compiler, which transforms $T$-round protocols into $\mathcal{O}(mT)$-round simulations, and prove that for polynomial-query black box compilers, the per-edge error rate tolerated by this last compiler is within a constant factor of optimal.

Connected through hyperedge HE-1 (induced by source paper "noisy beeping networks"):
  with members:
    - "leader election in multi hop radio networks"
    - "efficient multiparty interactive coding for insertions deletions and substitutions"
    - "erasure correction for noisy radio networks"
    - "broadcasting in noisy radio networks"
    - "naming a channel with beeps"
    - "feedback from nature simple randomised distributed algorithms for maximal independent set selection and greedy colouring"
    - "design patterns in beeping algorithms examples emulation and analysis"
    - "communicating with beeps"

Connected through hyperedge HE-2 (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"
    - "adaptive protocols for interactive communication"
    - "optimal error rates for interactive coding ii efficiency and list decoding"

Connected through hyperedge HE-3 (induced by source paper "low congestion cycle covers and their applications"):
  with members:
    - "property testing of planarity in the congest model"
    - "minor excluded network families admit fast distributed algorithms"
    - "distributed treewidth computation"
    - "faster distributed shortest path approximations via shortcuts"
    - "round and message optimal distributed part wise aggregation"
    - "low congestion shortcuts without embedding"
    - "minimum weight cycle covers and their approximability"

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"
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "balancing communication for multi party interactive coding"
    - "interactive channel capacity revisited"
    - "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 "adaptive protocols for interactive communication"):
  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"
    - "optimal error rates for interactive coding ii efficiency and list decoding"
    - "tree codes and a conjecture on exponential sums"

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)