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 "bounding and estimating the classical information rate of quantum channels with memory"):
  Abstract: We consider the scenario of classical communication over a finite-dimensional quantum channel with memory using separable-state input ensemble and local output measurements. We propose algorithms for estimating and bounding the information rate of such communication setups. Some of the algorithms are extensions of their counterparts for (classical) finite-state-machine channels. Notably, we discuss suitable graphical models for doing the relevant computations. Moreover, the auxiliary channels are learned in a data-driven approach, ie, only input/output sequences of the true channel are needed, but not the channel model of the true channel.

Includes members:
  Member "double edge factor graphs definition properties and examples":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "factor graphs for quantum probabilities")
  Member "factor graphs for quantum probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "double edge factor graphs definition properties and examples")
  Member "optimization of information rate upper and lower bounds for channels with memory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved lower bounds on mutual information accounting for nonlinear signal noise interaction")

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)