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 "on the reliability function of discrete memoryless multiple access channel with feedback"):
  Abstract: We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). The bounds are similar to the one for point-to-point channels, increasing linearly with respect to an appropriate distance between the rate pair and the capacity boundary. For the lower bound on the error exponent, we adapt Yamamoto and Itoh's coding scheme consisting of a data and a confirmation stage. In the data stage we use arbitrary feedback capacity-achieving codes. In the confirmation stage, each transmitter sends one bit of information to the receiver using a pair of codebooks of size two, one for each transmitter. The codewords at this stage are selected randomly according to an appropriately optimized joint probability distribution. For the upper bound on the error exponent, we adopt the proof techniques of Burnashev for the reliability function of the point-to-point case. The upper bound is derived by studying the rate of decrease of appropriate message entropies.

Includes members:
  Member "on the necessity of structured codes for communications over mac with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how to compute modulo prime power sums")
  Member "a simple converse of burnashev s reliability function":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal active social network de anonymization using information thresholds")

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)