human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "protograph ldpc code design for asynchronous random access"):
  Abstract: This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define a surrogate channel model and propose different protograph low-density parity-check code designs. The proposed codes are both tested in a setup where the physical layer is abstracted, as well as on a more realistic channel model, where finite-length physical layer simulations of the entire asynchronous random access scheme, including decoding are carried out. We find that the abstracted physical layer model overestimates the performance when short blocks are considered. Additionally, the optimized codes show gains in supported channel traffic - a measure of the number of terminals that can be concurrently accommodated on the channel - of around 17% at a packet loss rate of 10^{-2} w.r.t. off-the-shelf codes.

Includes members:
  Member "enhancing contention resolution aloha using combining techniques":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multiple relay slotted aloha performance analysis and bounds")
  Member "finite length analysis of irregular repetition slotted aloha in the waterfall region":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "random access channel coding in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "error floor analysis of coded slotted aloha over packet erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar slotted aloha over slot erasure channels")
  Member "coded slotted aloha a graph based method for uncoordinated multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "phase transition analysis for covariance based massive random access with massive mimo")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "low density parity check codes for nonergodic block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components")

Question: Please tell me which class the source paper 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)