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: "graph based random access for the collision channel without feedback capacity bound"
  Abstract: A random access scheme for the collision channel without feedback is proposed. The scheme is based on erasure correcting codes for the recovery of packet segments that are lost in collisions, and on successive interference cancellation for resolving collisions. The proposed protocol achieves reliable communication in the asymptotic setting and attains capacities close to 1 [packets/slot]. A capacity bound as a function of the overall rate of the scheme is derived, and code distributions tightly approaching the bound developed.

Connected through hyperedge HE-1 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation"):
  with members:
    - "maximum sum rate of slotted aloha with successive interference cancellation"
    - "massive non orthogonal multiple access for cellular iot potentials and limitations"
    - "random access protocols for massive mimo"
    - "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 "two layer coded channel access with collision resolution design and analysis"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "probabilistic rateless multiple access for machine to machine communication"
    - "scma for downlink multiple access of 5g wireless networks"
    - "near capacity adaptive analog fountain codes for wireless channels"
    - "aloha random access that operates as a rateless code"
    - "high throughput random access via codes on graphs coded slotted aloha"

Connected through hyperedge HE-3 (induced by source paper "lattice erasure codes of low rank with noise margins"):
  with members:
    - "analog coding of a source with erasures"
    - "unitary precoding and basis dependency of mmse performance for gaussian erasure channels"

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"
    - "joint estimation and contention resolution protocol for wireless random access"
    - "frameless aloha protocol for wireless networks"

Connected through hyperedge HE-5 (induced by source paper "the throughput of slotted aloha with diversity"):
  with members:
    - "spatially coupled random access on graphs"
    - "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)