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 "wireless broadcast with optimal labelling"):
  Abstract: In this paper we study the broadcast problem in wireless networks when the broadcast is helped by a labelling scheme. Our contribution is twofold. First, we propose label optimal broadcast algorithms in a class of networks issued from our recent studies in wireless body area networks. We refer to these networks (level separable networks). We focus on two variants of broadcast: broadcast without acknowledgement (i.e. the initiator of the broadcast is not notified at the end of broadcast) and broadcast with acknowledgement. We propose an acknowledgement-free broadcast strategy using 1-bit labelling and broadcast with acknowledgement using a 2-bit labelling. In the class of level-separable networks our algorithms are memory optimal and finish within 2D rounds for both broadcast with and without acknowledgement, where D is the eccentricity of the broadcast initiator. In the broadcast with acknowledgement, we trigger the acknowledgement message during the broadcast propagation such that no extra rounds are needed for sending the acknowledgement back to the source once the broadcast is finished. Second, we improve a recent labelling-based broadcast scheme with acknowledgement designed for arbitrary networks in terms of memory and time complexity. That is, we better exploit the encoding of labels in order to not use extra memory to carry back the acknowledgement to the source. Nodes store only a 3-bits labelling.

Includes members:
  Member "ban gzkp optimal zero knowledge proof based scheme for wireless body area networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless broadcast with short labelling")
  Member "peak transmission rate resilient crosslayer broadcast for body area networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wireless broadcast with short labelling")
  Member "constant length labeling schemes for deterministic radio broadcast":
    also connected through other hyperedges:
      (none)
  Member "finding the size of a radio network with short labels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless broadcast with short labelling")
  Member "total order reliable convergecast in wban":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wireless broadcast with short labelling")
  Member "time vs information tradeoffs for leader election in anonymous trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deterministic leader election in anonymous radio networks")

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.NI(Networking and Internet Architecture)