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 "file updates under random arbitrary insertions and deletions"):
  Abstract: A client/encoder edits a file, as modeled by an insertion-deletion (InDel) process. An old copy of the file is stored remotely at a data-centre/decoder, and is also available to the client. We consider the problem of throughput- and computationally-efficient communication from the client to the data-centre, to enable the server to update its copy to the newly edited file. We study two models for the source files/edit patterns: the random pre-edit sequence left-to-right random InDel (RPES-LtRRID) process, and the arbitrary pre-edit sequence arbitrary InDel (APES-AID) process. In both models, we consider the regime in which the number of insertions/deletions is a small (but constant) fraction of the original file. For both models we prove information-theoretic lower bounds on the best possible compression rates that enable file updates. Conversely, our compression algorithms use dynamic programming (DP) and entropy coding, and achieve rates that are approximately optimal.

Includes members:
  Member "low complexity interactive algorithms for synchronization from deletions insertions and substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "list decoding of deletions using guess check codes")
  Member "synchronizing rankings via interactive communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low complexity interactive algorithms for synchronization from deletions insertions and substitutions")
  Member "synchronizing edits in distributed storage networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "harnessing correlations in distributed erasure coded key value stores")
  Member "bounds on the capacity of random insertion and deletion additive noise channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "a compression algorithm using mis aligned side information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "scalable string reconciliation by recursive content dependent shingling")
  Member "synchronization from deletions through interactive communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multilayer codes for synchronization from deletions and insertions")
  Member "efficient file synchronization a distributed source coding approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "guess check codes for deletions insertions and synchronization")
  Member "on the deletion channel with small deletion probability":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an overview of capacity results for synchronization channels")

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)