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 "coded trace reconstruction in a constant number of traces"):
  Abstract: The coded trace reconstruction problem asks to construct a code $C\subset \{0,1\}^n$ such that any $x\in C$ is recoverable from independent outputs ("traces") of $x$ from a binary deletion channel (BDC). We present binary codes of rate $1-\varepsilon$ that are efficiently recoverable from $\exp(O_q(\log^{1/3}(1/\varepsilon)))$ (a constant independent of $n$) traces of a $\operatorname{BDC}_q$ for any constant deletion probability $q\in(0,1)$. We also show that, for rate $1-\varepsilon$ binary codes, $\tilde \Omega(\log^{5/2}(1/\varepsilon))$ traces are required. The results follow from a pair of black-box reductions that show that average-case trace reconstruction is essentially equivalent to coded trace reconstruction. We also show that there exist codes of rate $1-\varepsilon$ over an $O_{\varepsilon}(1)$-sized alphabet that are recoverable from $O(\log(1/\varepsilon))$ traces, and that this is tight.

Includes members:
  Member "coding for deletion channels with multiple traces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the error probability of maximum likelihood decoding over two deletion channels")
  Member "coded trace reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "beyond trace reconstruction population recovery from the deletion channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coded trace reconstruction")
  Member "trace reconstruction generalized and parameterized":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coded trace reconstruction")
  Member "unique reconstruction of coded strings from multiset substring spectra":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "capacity upper bounds for deletion type channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "average case reconstruction for the deletion channel subpolynomially many traces suffice":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the error probability of maximum likelihood decoding over two deletion channels")
  Member "polynomial time decodable codes for the binary deletion channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal codes correcting a burst of deletions of variable length")

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)