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 communication with unknown noise rate"
  Abstract: Alice and Bob want to run a protocol over a noisy channel, where a certain number of bits are flipped adversarially. Several results take a protocol requiring $L$ bits of noise-free communication and make it robust over such a channel. In a recent breakthrough result, Haeupler described an algorithm that sends a number of bits that is conjectured to be near optimal in such a model. However, his algorithm critically requires $a \ priori$ knowledge of the number of bits that will be flipped by the adversary. #R##N#We describe an algorithm requiring no such knowledge. If an adversary flips $T$ bits, our algorithm sends $L + O\left(\sqrt{L(T+1)\log L} + T\right)$ bits in expectation and succeeds with high probability in $L$. It does so without any $a \ priori$ knowledge of $T$. Assuming a conjectured lower bound by Haeupler, our result is optimal up to logarithmic factors. #R##N#Our algorithm critically relies on the assumption of a private channel. We show that privacy is necessary when the amount of noise is unknown.

Connected through hyperedge HE-1 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks"):
  with members:
    - "fast and resource competitive broadcast in multi channel radio networks"
    - "the energy complexity of broadcast"
    - "exploiting spontaneous transmissions for broadcasting and leader election in radio networks"
    - "exponential separations in the energy complexity of leader election"
    - "randomized broadcast in radio networks with collision detection"
    - "making evildoers pay resource competitive broadcast in sensor networks"
    - "a resource competitive jamming defense"

Connected through hyperedge HE-2 (induced by source paper "resource competitive sybil defenses"):
  with members:
    - "proof of work without all the work"
    - "secure one way interactive communication"
    - "torbricks blocking resistant tor bridge distribution"
    - "bitcoin ng a scalable blockchain protocol"
    - "the mason test a defense against sybil attacks in wireless networks without trusted authorities"
    - "self healing computation"
    - "the sybil attacks and defenses a survey"
    - "quorums quicken queries efficient asynchronous secure multiparty computation"

Connected through hyperedge HE-3 (induced by source paper "scalable and secure computation among strangers resource competitive byzantine protocols"):
  with members:
    - "time message trade offs in distributed algorithms"
    - "sending a message with unknown noise"
    - "torbricks blocking resistant tor bridge distribution"
    - "bitcoin ng a scalable blockchain protocol"
    - "sublinear bounds for randomized leader election"
    - "making evildoers pay resource competitive broadcast in sensor networks"
    - "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary"

Connected through hyperedge HE-4 (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"
    - "coding for interactive communication correcting insertions and deletions"
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "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-5 (induced by source paper "proof of work without all the work computationally efficient attack resistant systems"):
  with members:
    - "proof of work without all the work"
    - "secure one way interactive communication"
    - "torbricks blocking resistant tor bridge distribution"
    - "the mason test a defense against sybil attacks in wireless networks without trusted authorities"
    - "self healing computation"
    - "the sybil attacks and defenses a survey"
    - "storage and search in dynamic peer to peer networks"
    - "making evildoers pay resource competitive broadcast in sensor networks"

Connected through hyperedge HE-6 (induced by source paper "sending a message with unknown noise"):
  with members:
    - "distributed computing with channel noise"
    - "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"
    - "physical layer network coding tutorial survey and beyond"

Connected through hyperedge HE-7 (induced by source paper "secure one way interactive communication"):
  with members:
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "tree codes and a conjecture on exponential sums"

Connected through hyperedge HE-8 (induced by source paper "distributed computing with channel noise"):
  with members:
    - "interactive channel capacity revisited"

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)