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: "maximum sum rate of slotted aloha with capture"
  Abstract: The sum rate performance of random-access networks crucially depends on the access protocol and receiver structure. Despite extensive studies, how to characterize the maximum sum rate of the simplest version of random access, Aloha, remains an open question. In this paper, a comprehensive study of the sum rate performance of slotted Aloha networks is presented. By extending the unified analytical framework proposed in [20], [21] from the classical collision model to the capture model, the network steady-state point in saturated conditions is derived as a function of the signal-to-interference-plus-noise ratio (SINR) threshold which determines a fundamental tradeoff between the information encoding rate and the network throughput. To maximize the sum rate, both the SINR threshold and backoff parameters of nodes should be properly selected. Explicit expressions of the maximum sum rate and the optimal setting are obtained, which show that similar to the sum capacity of the multiple access channel, the maximum sum rate of slotted Aloha also logarithmically increases with the mean received signal-to-noise ratio (SNR), but the high-SNR slope is only $e^{-1}$. Effects of backoff and power control on the sum rate performance of slotted Aloha networks are further discussed, which shed important light on the practical network design.

Connected through hyperedge HE-1 (induced by source paper "random noma with cross slot successive interference cancellation packet recovery"):
  with members:
    - "maximum sum rate of slotted aloha with successive interference cancellation"
    - "noma based random access with multichannel aloha"
    - "irregular repetition slotted aloha over the rayleigh block fading channel with capture"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "aloha random access that operates as a rateless code"

Connected through hyperedge HE-2 (induced by source paper "maximum sum rate of slotted aloha with successive interference cancellation"):
  with members:
    - "noma based random access with multichannel aloha"
    - "coded random access applying codes on graphs to design random access protocols"
    - "aloha random access that operates as a rateless code"
    - "random access an information theoretic perspective"
    - "random access with physical layer network coding"
    - "an overview of the transmission capacity of wireless networks"

Connected through hyperedge HE-3 (induced by source paper "interference aware opportunistic random access in dense iot networks"):
  with members:
    - "opportunistic downlink interference alignment for multi cell mimo networks"
    - "mu mimo mac protocols for wireless local area networks a survey"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "opportunistic interference alignment for random access networks"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "cooperative slotted aloha for multi base station systems"
    - "scalable synchronization and reciprocity calibration for distributed multiuser mimo"
    - "can one achieve multiuser diversity in uplink multi cell networks"

Connected through hyperedge HE-4 (induced by source paper "multi cell aware opportunistic random access for machine type communications"):
  with members:
    - "opportunistic downlink interference alignment for multi cell mimo networks"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "opportunistic interference alignment for random access networks"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "cooperative slotted aloha for multi base station systems"
    - "scalable synchronization and reciprocity calibration for distributed multiuser mimo"
    - "can one achieve multiuser diversity in uplink multi cell networks"
    - "opportunistic interference mitigation achieves optimal degrees of freedom in wireless multi cell uplink 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.IT(Information Theory)