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 "locally decodable codes with randomized encoding"):
  Abstract: We initiate a study of locally decodable codes with randomized encoding. Standard locally decodable codes are error correcting codes with a deterministic encoding function and a randomized decoding function, such that any desired message bit can be recovered with good probability by querying only a small number of positions in the corrupted codeword. This allows one to recover any message bit very efficiently in sub-linear or even logarithmic time. Besides this straightforward application, locally decodable codes have also found many other applications such as private information retrieval, secure multiparty computation, and average-case complexity. #R##N#However, despite extensive research, the tradeoff between the rate of the code and the number of queries is somewhat disappointing. For example, the best known constructions still need super-polynomially long codeword length even with a logarithmic number of queries, and need a polynomial number of queries to achieve a constant rate. In this paper, we show that by using a randomized encoding, in several models we can achieve significantly better rate-query tradeoff. In addition, our codes work for both the standard Hamming errors, and the more general and harder edit errors.

Includes members:
  Member "optimal document exchange and new codes for small number of insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal k deletion correcting codes")
  Member "deterministic document exchange protocols and almost optimal binary codes for edit errors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "block edit errors with transpositions deterministic document exchange protocols and almost optimal binary codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimally resilient codes for list decoding from insertions and deletions")
  Member "synchronization strings channel simulations and interactive coding for insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimally resilient codes for list decoding from insertions and deletions")
  Member "synchronization strings explicit constructions local decoding and applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimally resilient codes for list decoding from insertions and deletions")
  Member "synchronization strings efficient and fast deterministic constructions over small alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "near linear time insertion deletion codes and 1 e approximating edit distance via indexing")
  Member "synchronization strings codes for insertions and deletions approaching the singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "efficiently decodable insertion deletion codes for high noise and high rate regimes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimally resilient codes for list decoding from insertions and deletions")

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)