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 "universal random access error exponents for codebooks of different word lengths"):
  Abstract: Csisz\'ar's channel coding theorem for multiple codebooks is generalized allowing the codeword lenghts differ across codebooks. Also in this case, for each codebook an error exponent can be achieved that equals the random coding exponent for this codebook alone, in addition, erasure detection failure probability tends to 0. This is proved even for sender and receiver not knowing the channel. As a corollary, a substantial improvement is obtained when the sender knows the channel.

Includes members:
  Member "unequal message protection asymptotic and non asymptotic tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi class source channel coding")
  Member "random access and source channel coding error exponents for multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "error exponents for asynchronous multiple access channels controlled asynchronism may outperform synchronism")
  Member "error performance of channel coding in random access communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed multiple access with a general link layer channel")
  Member "a new approach to random access reliable communication and reliable collision detection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed multiple access with a general link layer channel")
  Member "unequal error protection an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "privacy aware distributed hypothesis testing")

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)