human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "random access and source channel coding error exponents for multiple access channels"
  Abstract: A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel coding error exponent for multiple access channels in the case of independent sources. This exponent is improved in a modified model that admits error free 0 rate communication between the senders.

Connected through hyperedge HE-1 (induced by source paper "error exponents for asynchronous multiple access channels controlled asynchronism may outperform synchronism"):
  with members:
    - "error exponents of typical random trellis codes"
    - "shifted coded slotted aloha"
    - "distributed structure joint expurgation for the multiple access channel"
    - "universal random access error exponents for codebooks of different word lengths"
    - "error exponent for multiple access channels lower bounds"

Connected through hyperedge HE-2 (induced by source paper "joint source channel coding for the multiple access channel with correlated sources"):
  with members:
    - "multiple access channel with independent sources error exponent analysis"

Connected through hyperedge HE-3 (induced by source paper "universal random access error exponents for codebooks of different word lengths"):
  with members:
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "error performance of channel coding in random access communication"
    - "a new approach to random access reliable communication and reliable collision detection"
    - "unequal error protection an information theoretic perspective"

Connected through hyperedge HE-4 (induced by source paper "a generalized channel coding theory for distributed communication"):
  with members:
    - "random access an information theoretic perspective"
    - "error performance of channel coding in random access communication"
    - "a new approach to random access reliable communication and reliable collision detection"

Connected through hyperedge HE-5 (induced by source paper "unequal message protection asymptotic and non asymptotic tradeoffs"):
  with members:
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "the third order term in the normal approximation for singular channels"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"
    - "the awgn red alert problem"
    - "moderate deviations in channel coding"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "the dispersion of joint source channel coding"
    - "unequal error protection an information theoretic perspective"

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