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 "error exponents for asynchronous multiple access channels controlled asynchronism may outperform synchronism"):
  Abstract: Exponential error bounds are derived for frame-asynchronous discrete memoryless multiple access channels with two senders. By numerical evaluation for a particular case, it follows that the reliability function for synchronous transmission may be beaten if the senders are allowed to transmit with an appropriately chosen delay.

Includes members:
  Member "error exponents of typical random trellis codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "large deviations behavior of the logarithmic error probability of random codes")
  Member "shifted coded slotted aloha":
    also connected through other hyperedges:
      (none)
  Member "distributed structure joint expurgation for the multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on binary distributed hypothesis testing")
  Member "universal random access error exponents for codebooks of different word lengths":
    also connected through other hyperedges:
      (none)
  Member "random access and source channel coding error exponents for multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint source channel coding for the multiple access channel with correlated sources")
  Member "error exponent for multiple access channels lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed structure joint expurgation for the multiple access channel")

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)