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 "elias bound for general distances and stable sets in edge weighted graphs"):
  Abstract: This paper presents an extension of the Elias bound on the minimum distance of codes for discrete alphabets with general, possibly infinite valued, distances. The bound is obtained by combining a previous extension of the Elias bound, introduced by Blahut, with an extension of a bound previously introduced by the author which builds upon ideas of Gallager, Lovasz, and Marton. The result can in fact be interpreted as a unification of the Elias bound and of Lovasz’s bound on graph (or zero-error) capacity, both being recovered as particular cases of the one presented here. Previous extensions of the Elias bound by Berlekamp, Blahut, and Piret are shown to be included as particular cases of our bound. Applications to the reliability function are then discussed.

Includes members:
  Member "constant compositions in the sphere packing bound for classical quantum channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a simple derivation of the refined sphere packing bound under certain symmetry hypotheses")
  Member "an elias bound on the bhattacharyya distance of codes for channels with a zero error capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "variable length coding for zero error channel capacity")
  Member "lower bounds on the probability of error for classical and classical quantum channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the renyi capacity and center")

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)