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 "the strongly asynchronous massive access channel"):
  Abstract: This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length $A_n:=e^{n\alpha}$ blocks, where each block lasts $n$ channel uses. A global probability of error is enforced, ensuring that all the users' identities and messages are correctly identified and decoded. Achievability bounds are derived for the case that different users have similar channels, the case that users' channels can be chosen from a set which has polynomially many elements in the blocklength $n$, and the case with no restriction on the users' channels. A general converse bound on the capacity region and a converse bound on the maximum growth rate of the number of users are derived.

Includes members:
  Member "on the capacity of the slotted strongly asynchronous channel with a bursty user":
    also connected through other hyperedges:
      (none)
  Member "capacity of gaussian many access channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "asymptotically optimal matching of multiple sequences to source distributions and training sequences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal resolution of change point detection with empirically observed statistics and erasures")
  Member "energy and sampling constrained asynchronous communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of the slotted strongly asynchronous channel with a bursty user")
  Member "asynchronous communication capacity bounds and suboptimality of training":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "second order asymptotics for communication under strong asynchronism")
  Member "optimal sequential frame synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "second order asymptotics for communication under strong asynchronism")

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)