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 "parameterizable byzantine broadcast in loosely connected networks"):
  Abstract: We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly. We focus on non-cryptographic solutions. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the good information), but require a highly connected network. A probabilistic approach was recently proposed for loosely connected networks: the Byzantine failures are randomly distributed, and the correct nodes deliver the good information with high probability. A first solution require the nodes to initially know their position on the network, which may be difficult or impossible in self-organizing or dynamic networks. A second solution relaxed this hypothesis but has much weaker Byzantine tolerance guarantees. In this paper, we propose a parameterizable broadcast protocol that does not require nodes to have any knowledge about the network. We give a deterministic technique to compute a set of nodes that always deliver authentic information, for a given set of Byzantine failures. Then, we use this technique to experimentally evaluate our protocol, and show that it significantely outperforms previous solutions with the same hypotheses. Important disclaimer: these results have NOT yet been published in an international conference or journal. This is just a technical report presenting intermediary and incomplete results. A generalized version of these results may be under submission.

Includes members:
  Member "a scalable byzantine grid":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reliable communication in a dynamic network in the presence of byzantine faults")
  Member "on byzantine broadcast in loosely connected networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reliable communication in a dynamic network in the presence of byzantine faults")
  Member "maximum metric spanning tree made byzantine tolerant":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "self stabilizing mobile byzantine tolerant regular register with bounded timestamp")
  Member "bounding the impact of unbounded attacks in stabilization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "self stabilizing mobile byzantine tolerant regular register with bounded timestamp")
  Member "on byzantine containment properties of the min 1 protocol":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "self stabilizing mobile byzantine tolerant regular register with bounded timestamp")
  Member "the impact of topology on byzantine containment in stabilization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reliable communication in a dynamic network in the presence of byzantine faults")
  Member "discovering network topology in the presence of byzantine faults":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi hop byzantine reliable broadcast with honest dealer made practical")

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.DC(Distributed, Parallel, and Cluster Computing)