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 "bounded contention coding for wireless networks in the high snr regime"):
  Abstract: Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communication in such networks. #R##N#This paper proposes a novel approach for wireless communication, which embraces collisions rather than avoiding them, over an additive channel. It introduces a coding technique called Bounded-Contention Coding (BCC) that allows collisions to be successfully decoded by the receiving nodes into the original transmissions and whose complexity depends on a bound on the contention among the transmitters. #R##N#BCC enables deterministic local broadcast in a network with n nodes and at most a transmitters with information of l bits each within O(a log n + al) bits of communication with full-duplex radios, and O((a log n + al)(log n)) bits, with high probability, with half-duplex radios. When combined with random linear network coding, BCC gives global broadcast within O((D + a + log n)(a log n + l)) bits, with high probability. This also holds in dynamic networks that can change arbitrarily over time by a worst-case adversary. When no bound on the contention is given, it is shown how to probabilistically estimate it and obtain global broadcast that is adaptive to the true contention in the network.

Includes members:
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "deterministic network model revisited an algebraic network coding approach":
    also connected through other hyperedges:
      (none)
  Member "faster information dissemination in dynamic networks via network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "local distributed algorithms in highly dynamic networks")
  Member "improved combinatorial algorithms for wireless information flow":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient capacity computation and power optimization for relay networks")
  Member "algebraic network coding approach to deterministic wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two unicast information flows over linear deterministic networks")
  Member "collision helps algebraic collision recovery for wireless erasure networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sign compute resolve for tree splitting random access")
  Member "analyzing network coding gossip made easy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "synchronous transmissions in low power wireless a survey of communication protocols and network services")
  Member "dynamic sharing of a multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "scalable wake up of multi channel single hop 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)