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: "a generalized channel coding theory for distributed communication"
  Abstract: This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each transmitter is chosen arbitrarily in each time slot. The coding choice of a transmitter is denoted by a code index parameter, which is known neither to other transmitters nor to the receiver. Fundamental performance limitation of the system is characterized using an achievable region defined in the space of the code index vectors. As the codeword length is taken to infinity, for all code index vectors inside the region, the receiver will decode the message reliably, while for all code index vectors outside the region, the receiver will report a collision reliably. A generalized system error performance measure is defined as the weighted sum of probabilities of different types of communication error events. Assume that the receiver chooses an “operation region” and intends to decode the message if the code index vector is inside the operation region. Achievable bounds on the tradeoff between the operation region and the generalized error performance measure are obtained under the assumption of a finite codeword length.

Connected through hyperedge HE-1 (induced by source paper "distributed multiple access with a general link layer channel"):
  with members:
    - "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-2 (induced by source paper "distributed multiple access with multiple transmission options at the link layer"):
  with members:
    - "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-3 (induced by source paper "distributed capacity of a multiple access channel"):
  with members:
    - "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-4 (induced by source paper "distributed multiple access with an enhanced physical link layer interface part i single transmission option"):
  with members:
    - "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 "random access and source channel coding error exponents for multiple access channels"):
  with members:
    - "a derivation of the source channel error exponent using non identical product distributions"
    - "error performance of channel coding in random access communication"
    - "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)