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: "coded splitting tree protocols"
  Abstract: This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early as possible. Evaluations show that the proposed protocol provides considerable gains over the standard tree splitting protocol applying SIC. The improvement comes at the expense of an increased feedback and receiver complexity.

Connected through hyperedge HE-1 (induced by source paper "a random access protocol for pilot allocation in crowded massive mimo systems"):
  with members:
    - "random access in uplink massive mimo systems how to exploit asynchronicity and excess antennas"
    - "massive mimo ten myths and one critical question"
    - "random access for massive mimo systems with intra cell pilot contamination"
    - "random access protocol for massive mimo strongest user collision resolution sucr"
    - "massive mimo for crowd scenarios a solution based on random access"
    - "three practical aspects of massive mimo intermittent user activity pilot synchronism and asymmetric deployment"
    - "coded random access applying codes on graphs to design random access protocols"
    - "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits"

Connected through hyperedge HE-2 (induced by source paper "sign compute resolve for tree splitting random access"):
  with members:
    - "identifying randomly activated users via sign compute resolve on graphs"
    - "coded random access applying codes on graphs to design random access protocols"
    - "many access channels the gaussian case with random user activities"
    - "sign compute resolve for random access"
    - "random access with physical layer network coding"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"
    - "collision helps algebraic collision recovery for wireless erasure networks"

Connected through hyperedge HE-3 (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"
    - "spatially coupled random access on graphs"
    - "bounded contention coding for wireless networks in the high snr regime"
    - "random access with physical layer network coding"
    - "a network coded diversity protocol for collision recovery in slotted aloha networks"
    - "frameless aloha protocol for wireless networks"
    - "reliable physical layer network coding"

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.IT(Information Theory)