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: "building blocks of physical layer network coding"
  Abstract: This paper investigates the fundamental building blocks of physical-layer network coding (PNC). Since its conception, PNC has developed into a subfield of network coding investigated by many. Most of the prior work, however, focused on the simplest communication setup in which PNC could be applied, namely the two-way-relay channel (TWRC). Studies of the application of PNC in general networks are relatively few. This paper is an attempt to fill this gap. To do so, we put forth two ideas: 1) For the purpose of scheduling transmissions, a general network can be decomposed into small building blocks of PNC, referred to as the PNC atoms. 2) TWRC is only one of many possible PNC atoms - besides TWRC, we identify eight other PNC atoms. We present formal definitions for the nine PNC atoms. We then formulate the PNC scheduling problem as a linear program based on the decomposition principle stated in 1) above. Two major results of our simulation experiments are as follows. First, under the decomposition framework, the throughput performance of PNC is significantly better than those of the traditional multi-hop scheme and the non-physical-layer network coding scheme - e.g., under heavy traffic volume, PNC can achieve 100% throughput gain relative to the traditional multi-hop scheme. Second, PNC decomposition based on a variety of different PNC atoms yield much better performance than PNC decomposition based on the TWRC atom alone.

Connected through hyperedge HE-1 (induced by source paper "study of buffer aided physical layer network coding with ml and mmse linear code designs for cooperative ds cdma systems"):
  with members:
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "robust adaptive beamforming based on low rank and cross correlation techniques"
    - "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems"
    - "adaptive distributed space time coding based on adjustable code matrices for cooperative mimo relaying systems"
    - "cooperative compute and forward"

Connected through hyperedge HE-2 (induced by source paper "reliable physical layer network coding supporting real applications"):
  with members:
    - "on the subtleties of q pam linear physical layer network coding"
    - "arq for physical layer network coding"
    - "network coded multiple access"
    - "distributed mac protocol supporting physical layer network coding"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"
    - "implementation of physical layer network coding"

Connected through hyperedge HE-3 (induced by source paper "arq for physical layer network coding"):
  with members:
    - "network codes for real time applications"
    - "joint channel estimation and channel decoding in physical layer network coding systems an em bp factor graph framework"
    - "asynchronous convolutional coded physical layer network coding"
    - "asynchronous physical layer network coding with quasi cyclic codes"
    - "distributed mac protocol supporting physical layer network coding"
    - "asynchronous physical layer network coding"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"

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