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 "list decoding random euclidean codes and infinite constellations"):
  Abstract: We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the source and the adversary have power constraints $ P $ and $ N $ respectively, the list decoding capacity is equal to $ \frac{1}{2}\log\frac{P}{N} $. Random spherical codes achieve constant list sizes, and the goal of the present paper is to obtain a better understanding of the smallest achievable list size as a function of the gap to capacity. We show a reduction from arbitrary codes to spherical codes, and derive a lower bound on the list size of typical random spherical codes. We also give an upper bound on the list size achievable using nested Construction-A lattices and infinite Construction-A lattices. We then define and study a class of infinite constellations that generalize Construction-A lattices and prove upper and lower bounds for the same. Other goodness properties such as packing goodness and AWGN goodness of infinite constellations are proved along the way. Finally, we consider random lattices sampled from the Haar distribution and show that if a certain number-theoretic conjecture is true, then the list size grows as a polynomial function of the gap-to-capacity.

Includes members:
  Member "good distance lattices from high dimensional expanders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating constraint satisfaction problems on high dimensional expanders")
  Member "improved list decodability of random linear binary codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ldpc codes achieve list decoding capacity")
  Member "quadratically constrained myopic adversarial channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quadratically constrained two way adversarial channels")
  Member "on the weight distribution of random binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distribution of the minimal distance of random linear codes")
  Member "list decoding with double samplers":
    also connected through other hyperedges:
      (none)
  Member "sufficiently myopic adversaries are blind":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "authentication against a myopic adversary")
  Member "it ll probably work out improved list decoding through random operations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized list decoding")
  Member "every list decodable code for high noise has abundant near optimal rate puncturings":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on error decoding of locally repairable and partial mds codes")

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)