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 "synchronizing edits in distributed storage networks"):
  Abstract: We consider the problem of synchronizing data in distributed storage networks under an edit model that includes deletions and insertions. We present two modifications of MDS, regenerating and locally repairable codes that allow updates in the parity-check values to be performed with one round of communication at low bit rates and using small storage overhead. Our main contributions are novel protocols for synchronizing both hot and semi-static data and protocols for data deduplication applications, based on intermediary permutation, Vandermonde and Cauchy matrix coding.

Includes members:
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "explicit maximally recoverable codes with locality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "update efficiency and local repairability limits for capacity approaching codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achieving multi port memory performance on single port memory with coding techniques")
  Member "a characterization of the number of subsequences obtained via the deletion channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "a deterministic polynomial time protocol for synchronizing from deletions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit formulas for the weight enumerators of some classes of deletion correcting codes")
  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 "on the locality of codeword symbols":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a locality based approach for coded computation")
  Member "efficient file synchronization a distributed source coding approach":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "guess check codes for deletions insertions and synchronization")

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)