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: "error performance of channel coding in random access communication"
  Abstract: A new channel coding approach was proposed by Luo and Ephremides for random multiple-access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the rate information among each other or with the receiver. The receiver will either decode the messages or report a collision depending on whether reliable message recovery is possible. It was shown that, asymptotically as the codeword length goes to infinity, the set of communication rates supporting reliable message recovery can be characterized by an achievable region which equals Shannon's information rate region without a convex hull operation. In this paper, we derive achievable bounds on error probabilities, including the decoding error probability and the collision miss detection probability, of random multiple-access systems with a finite codeword length. Achievable error exponents are obtained by taking the codeword length to infinity.

Connected through hyperedge HE-1 (induced by source paper "distributed multiple access with a general link layer channel"):
  with members:
    - "a generalized channel coding theory for distributed communication"
    - "a new approach to random access reliable communication and reliable collision detection"

Connected through hyperedge HE-2 (induced by source paper "distributed multiple access with multiple transmission options at the link layer"):
  with members:
    - "a generalized channel coding theory for distributed communication"
    - "a new approach to random access reliable communication and reliable collision detection"

Connected through hyperedge HE-3 (induced by source paper "distributed capacity of a multiple access channel"):
  with members:
    - "a generalized channel coding theory for distributed communication"
    - "a new approach to random access reliable communication and reliable collision detection"

Connected through hyperedge HE-4 (induced by source paper "distributed multiple access with an enhanced physical link layer interface part i single transmission option"):
  with members:
    - "a generalized channel coding theory for distributed communication"
    - "a new approach to random access reliable communication and reliable collision detection"

Connected through hyperedge HE-5 (induced by source paper "capacity of gaussian many access channels"):
  with members:
    - "on or many access channels"
    - "sparse ofdm a compressive sensing approach to asynchronous neighbor discovery"
    - "identifying randomly activated users via sign compute resolve on graphs"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "many access for small packets based on precoding and sparsity aware recovery"
    - "many access channels the gaussian case with random user activities"
    - "many broadcast channels definition and capacity in the degraded case"
    - "sparse signal processing with linear and non linear observations a unified shannon theoretic approach"

Connected through hyperedge HE-6 (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"
    - "random access and source channel coding error exponents for multiple access channels"
    - "a new approach to random access reliable communication and reliable collision detection"
    - "unequal error protection an information theoretic perspective"

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

Connected through hyperedge HE-8 (induced by source paper "random access and source channel coding error exponents for multiple access channels"):
  with members:
    - "a generalized channel coding theory for distributed communication"
    - "a derivation of the source channel error exponent using non identical product distributions"
    - "a new approach to random access reliable communication and reliable collision detection"
    - "the dispersion of joint source channel coding"
    - "error exponent for multiple access channels lower bounds"
    - "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)