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 "decoding by sampling part ii derandomization and soft output decoding"):
  Abstract: In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic, which brings considerable performance improvement and complexity reduction over to the randomized sampling. Moreover, the upper bound on the sample size K, which corresponds to near-maximum likelihood (ML) performance, is derived. We also find that the proposed algorithm can be used as an efficient tool to implement soft-output decoding in multiple-input multiple-output (MIMO) systems. An upper bound of the sphere radius R in list sphere decoding (LSD) is derived. Based on it, we demonstrate that the derandomized sampling algorithm is capable of achieving near-maximum a posteriori (MAP) performance. Simulation results show that near-optimum performance can be achieved by a moderate size K in both lattice decoding and soft-output decoding.

Includes members:
  Member "decoding by embedding correct decoding radius and dmt optimality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic sampling decoding where sphere decoding meets lattice gaussian distribution")
  Member "on the proximity factors of lattice reduction aided decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "decoding by sampling a randomized lattice algorithm for bounded distance decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "augmented lattice reduction for mimo decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decoding by embedding correct decoding radius and dmt optimality")
  Member "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deterministic sampling decoding where sphere decoding meets lattice gaussian distribution")
  Member "soft input soft output single tree search sphere decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "signal processing for high throughput satellites challenges in new interference limited scenarios")

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)