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 "finite blocklength analysis of multiple access channels with without cooperation"):
  Abstract: Motivated by the demand of reliable and low latency communications, we employ tools from information theory, stochastic processes and queueing theory, in order to provide a comprehensive framework regarding the analysis of a Time Division Multiple Access (TDMA) network with bursty traffic, in the finite blocklength regime. Specifically, we re-examine the stability conditions of a noncooperative TDMA multiple access channel, evaluate the optimal throughput, and identify the optimal trade-off between data packet size and latency. The evaluation is performed both numerically and via the proposed approximations that result in closed form expressions. Then, we examine the stability conditions and the performance of the Multiple Access Relay Channel with TDMA scheduling, subject to finite blocklength constraints, by applying a cognitive cooperation protocol that assumes relaying is enabled when sources are idle. Finally, we propose the novel Batch-And-Forward (BAF) strategy, that can significantly enhance the performance of cooperative networks in the finite blocklength regime, as well as reduce the requirement in metadata. The BAF strategy is quite versatile, thus, it can be embedded in existing cooperative protocols, without imposing additional complexity on the overall scheme.

Includes members:
  Member "ultra reliable short packet communications half duplex or full duplex relaying":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective capacity of noma with finite blocklength for low latency communications")
  Member "finite blocklength bounds for wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "relay assisted multiple access with full duplex multi packet reception":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless caching helper system with heterogeneous traffic and random availability")
  Member "the third order term in the normal approximation for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "quasi static multiple antenna fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "one shot capacity of discrete channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards massive ultra reliable and low latency wireless the art of sending short packets")

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)