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: "energy efficient coded random access for the wireless uplink"
  Abstract: We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN multiple-access channel (MAC) by Polyanskiy'2017, in the practically more relevant case of users subject to Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding achievability bound, which we analyze both non-asymptotically (at finite blocklength) and asymptotically. As a candidate practical solution, we propose an explicit sparse-graph based coding scheme together with an alternating belief-propagation decoder. The latter's performance is found to be surprisingly close to the finite-blocklength bounds. Our main findings are twofold. First, just like in the AWGN MAC we see that jointly decoding large number of users leads to a surprising phase transition effect, where at spectral efficiencies below a critical threshold (5-15 bps/Hz depending on reliability) a perfect multi-user interference cancellation is possible. Second, while the presence of Rayleigh fading significantly increases the minimal required energy-per-bit $E_b/N_0$ (from about 0-2 dB to about 8-11 dB), the inherent randomization introduced by the channel makes it much easier to attain the optimal performance via iterative schemes. #R##N#In all, it is hoped that a principled definition of the random-access model together with our information-theoretic analysis will open the road towards unified benchmarking and comparison performance of various random-access solutions, such as the currently discussed candidates (MUSA, SCMA, RSMA) for the 5G/6G.

Connected through hyperedge HE-1 (induced by source paper "massive access for future wireless communication systems"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "non bayesian activity detection large scale fading coefficient estimation and unsourced random access with a massive mimo receiver"
    - "on the fundamental limits of mimo massive access communication"
    - "a joint graph based coding scheme for the unsourced random access gaussian channel"
    - "polar coding and random spreading for unsourced multiple access"
    - "sparcs for unsourced random access"
    - "random access channel coding in the finite blocklength regime"
    - "a new scaling law for activity detection in massive mimo systems"

Connected through hyperedge HE-2 (induced by source paper "optimizing information freshness using low power status updates via sleep wake scheduling"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "broadcast age of information in csma ca based wireless networks"
    - "minimizing the age of information in a csma environment"
    - "age optimal updates of multiple information flows"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "sampling for data freshness optimization non linear age functions"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"

Connected through hyperedge HE-3 (induced by source paper "optimal age energy trade off via sleep wake scheduling"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "broadcast age of information in csma ca based wireless networks"
    - "minimizing the age of information in a csma environment"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "sampling for data freshness optimization non linear age functions"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "age optimal information updates in multihop 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)