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: "a network coded diversity protocol for collision recovery in slotted aloha networks"
  Abstract: We propose a collision recovery scheme for symbol-synchronous slotted ALOHA (SA) based on physical layer network coding over extended Galois Fields. Information is extracted from colliding bursts allowing to achieve higher maximum throughput with respect to previously proposed collision recovery schemes. An energy analysis is also performed, and it is shown that, by adjusting the transmission probability, high energy efficiency can be achieved. The paper also addresses several practical aspects, namely frequency, phase, and amplitude estimation, as well as partial symbol asynchronism. A performance evaluation is carried out using the proposed algorithms, revealing remarkable performance in terms of normalized throughput.

Connected through hyperedge HE-1 (induced by source paper "prioritized random mac optimization via graph based analysis"):
  with members:
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "optimal selection of adaptive streaming representations"
    - "seek and decode random access with physical layer network coding and multiuser detection"
    - "coded random access how coding theory helps to build random access protocols"
    - "exploiting capture effect in frameless aloha for massive wireless random access"
    - "what will 5g be"
    - "cooperative slotted aloha for multi base station systems"
    - "the throughput of slotted aloha with diversity"

Connected through hyperedge HE-2 (induced by source paper "sign compute resolve for random access"):
  with members:
    - "coded random access how coding theory helps to build random access protocols"
    - "aloha random access that operates as a rateless code"
    - "coded splitting tree protocols"
    - "spatially coupled random access on graphs"
    - "bounded contention coding for wireless networks in the high snr regime"
    - "random access with physical layer network coding"
    - "frameless aloha protocol for wireless networks"
    - "reliable physical layer network coding"

Connected through hyperedge HE-3 (induced by source paper "random access with physical layer network coding"):
  with members:
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "sliding window based contention resolution diversity slotted aloha"
    - "random access an information theoretic perspective"
    - "frameless aloha protocol for wireless networks"
    - "reliable physical layer network coding"
    - "high throughput random access via codes on graphs coded slotted aloha"
    - "an enhanced multiple random access scheme for satellite communications"
    - "collision helps algebraic collision recovery for wireless erasure networks"

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)