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 "arq for physical layer network coding"):
  Abstract: This paper investigates ARQ (Automatic Repeat request) designs for PNC (Physical-layer Network Coding) systems. We have previously found that, besides TWRC (Two-Way Relay Channel) operated on the principle of PNC, there are many other PNC building blocks--building blocks are simple small network structures that can be used to construct a large network. In some of these PNC building blocks, receivers can obtain side information through overhearing. Although such overheard information is not the target information that the receivers desire, the receivers can exploit the overheard information together with a network-coded packet received to obtain a desired native packet. This leads to throughput gain. Our previous study, however, assumed what is sent always get received. In practice, that is not the case. Error control is needed to ensure reliable communication. This paper focuses on the use of ARQ to ensure reliable PNC communication. The availability of overheard Information and its potential exploitation make the ARQ design of a network-coded system different from that of a non-network-coded system. In this paper, we lay out the fundamental considerations for such ARQ design: 1) We address how to track the stored coded packets and overheard packets to increase the chance of packet extraction, and derive the throughput gain achieved by tracking 2) We investigate two variations of PNC ARQ, coupled and non-coupled ARQs, and prove that non-coupled ARQ is more efficient; 3) We show how to optimize parameters in PNC ARQ--specifically the window size and ACK frequency--to minimize the throughput degradation caused by ACK feedback overhead and wasteful retransmissions due to lost ACK.

Includes members:
  Member "network codes for real time applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "in order packet delivery in instantly decodable network coded systems over wireless broadcast")
  Member "joint channel estimation and channel decoding in physical layer network coding systems an em bp factor graph framework":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "building blocks of physical layer network coding")
  Member "asynchronous convolutional coded physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implementation of uplink network coded modulation for two hop networks")
  Member "asynchronous physical layer network coding with quasi cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer network coding a random coding error exponent perspective")
  Member "building blocks of physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "study of buffer aided physical layer network coding with ml and mmse linear code designs for cooperative ds cdma systems")
  Member "distributed mac protocol supporting physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reliable physical layer network coding supporting real applications")
  Member "asynchronous physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an analysis of two user uplink asynchronous non orthogonal multiple access systems")
  Member "reliable physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "towards massive connectivity support for scalable mmtc communications in 5g 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)