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 interactive communication cost of the distributed nearest lattice point problem"):
  Abstract: We consider the problem of distributed computation of the nearest lattice point for a two dimensional lattice. An interactive two-party model of communication is considered. Algorithms with bounded, as well as unbounded, number of rounds of communication are considered. For the algorithm with a bounded number of rounds, expressions are derived for the error probability as a function of the total number of communicated bits. We observe that the error exponent depends on the lattice. With an infinite number of allowed communication rounds, the average cost of achieving zero error probability is shown to be finite.

Includes members:
  Member "communication cost of transforming a nearest plane partition to the voronoi partition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "classification in a large network")
  Member "distributed scalar quantization for computing high resolution analysis and extensions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on distributed quantization for classification")
  Member "distributed lossy averaging":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized geometric programming for rate allocation in consensus")

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)