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 "n channel asymmetric entropy constrained multiple description lattice vector quantization"):
  Abstract: This paper is about the design and analysis of an index-assignment (IA) based multiple-description coding scheme for the n-channel asymmetric case. We use entropy constrained lattice vector quantization and restrict attention to simple reconstruction functions, which are given by the inverse IA function when all descriptions are received or otherwise by a weighted average of the received descriptions. We consider smooth sources with finite differential entropy rate and MSE fidelity criterion. As in previous designs, our construction is based on nested lattices which are combined through a single IA function. The results are exact under high-resolution conditions and asymptotically as the nesting ratios of the lattices approach infinity. For any n, the design is asymptotically optimal within the class of IA-based schemes. Moreover, in the case of two descriptions and finite lattice vector dimensions greater than one, the performance is strictly better than that of existing designs. In the case of three descriptions, we show that in the limit of large lattice vector dimensions, points on the inner bound of Pradhan et al. can be achieved. Furthermore, for three descriptions and finite lattice vector dimensions, we show that the IA-based approach yields, in the symmetric case, a smaller rate loss than the recently proposed source-splitting approach.

Includes members:
  Member "approximating the gaussian multiple description rate region under symmetric distortion constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the storage cost of private information retrieval")
  Member "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "multiple description coding by dithered delta sigma quantization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi tenant c ran with spectrum pooling downlink optimization under privacy constraints")
  Member "multiple description lattice vector quantization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function")
  Member "n channel entropy constrained multiple description lattice vector quantization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal index assignment for multiple description scalar quantization")
  Member "multiple description quantization via gram schmidt orthogonalization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "successive wyner ziv coding for the binary ceo problem under logarithmic loss")
  Member "vector gaussian multiple description with individual and central receivers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "index assignment for multichannel communication under failure":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal index assignment for multiple description scalar quantization")

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)