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 "distributed multiple access with an enhanced physical link layer interface part i single transmission option"):
  Abstract: This paper investigates the problem of distributed medium access control in a time slotted wireless multiple access network with an unknown finite number of homogeneous users. Assume that each user has a single transmission option. In each time slot, a user chooses either to idle or to transmit a packet. Under a general channel model, a distributed medium access control framework is proposed to adapt transmission probabilities of all users to a value that is near optimal with respect to a predetermined symmetric network utility. Probability target of each user in the proposed algorithm is calculated based upon a channel contention measure, which is defined as the conditional success probability of a virtual packet. It is shown that the proposed algorithm falls into the classical stochastic approximation framework with guaranteed convergence when the contention measure can be directly obtained from the receiver. On the other hand, computer simulations show that, when the contention measure is not directly available, a revised medium access control algorithm can still be developed to help the system converging to the same desired equilibrium.

Includes members:
  Member "a generalized channel coding theory for distributed communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed multiple access with a general link layer channel")
  Member "error performance of channel coding in random access communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "distributed multiple access with a general link layer 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)