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: "joint estimation and contention resolution protocol for wireless random access"
  Abstract: We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions. The users independently access the wireless link on a slot basis with a predefined probability, resulting in a distribution of user transmissions over slots, based on which the estimation and contention resolution are performed. Specifically, the contention resolution is performed using successive interference cancellation which, coupled with the use of the optimized access probabilities, enables throughputs that are substantially higher than the traditional slotted ALOHA-like protocols. The key feature of the proposed protocol is that the round durations are not a priori set and they are terminated when the estimation/contention-resolution performance reach the satisfactory levels.

Connected through hyperedge HE-1 (induced by source paper "admission control based traffic agnostic delay constrained random access ac dc ra for m2m communication"):
  with members:
    - "nr wide bandwidth operations"
    - "delay analysis of multichannel parallel contention tree algorithms mp cta"
    - "frameless aloha with reliability latency guarantees"
    - "on the reliability of lte random access performance bounds for machine to machine burst resolution time"

Connected through hyperedge HE-2 (induced by source paper "coded random access applying codes on graphs to design random access protocols"):
  with members:
    - "aloha random access that operates as a rateless code"
    - "frameless aloha protocol for wireless networks"

Connected through hyperedge HE-3 (induced by source paper "massive m2m access with reliability guarantees in lte systems"):
  with members:
    - "reengineering gsm gprs towards a dedicated network for massive smart metering"

Connected through hyperedge HE-4 (induced by source paper "coded random access how coding theory helps to build random access protocols"):
  with members:
    - "aloha random access that operates as a rateless code"
    - "spatially coupled random access on graphs"
    - "frameless aloha protocol for wireless networks"
    - "graph based random access for the collision channel without feedback capacity bound"

Connected through hyperedge HE-5 (induced by source paper "aloha random access that operates as a rateless code"):
  with members:
    - "spatially coupled random access on graphs"
    - "pseudo random aloha for enhanced collision recovery in rfid"
    - "frameless aloha protocol for wireless networks"
    - "high throughput random access via codes on graphs coded slotted aloha"

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)