human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "efficient file synchronization a distributed source coding approach"
  Abstract: The problem of reconstructing a source sequence with the presence of decoder side-information that is mis-synchronized to the source due to deletions is studied in a distributed source coding framework. Motivated by practical applications, the deletion process is assumed to be bursty and is modeled by a Markov chain. The minimum rate needed to reconstruct the source sequence with high probability is characterized in terms of an information theoretic expression, which is interpreted as the amount of information of the deleted content and the locations of deletions, subtracting “nature's secret”, that is, the uncertainty of the locations given the source and side-information. For small bursty deletion probability, the asymptotic expansion of the minimum rate is computed.

Connected through hyperedge HE-1 (induced by source paper "guess check codes for deletions insertions and synchronization"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "codes in the damerau distance for dna storage"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "coding against deletions in oblivious and online models"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "achievable rates for channels with deletions and insertions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"

Connected through hyperedge HE-2 (induced by source paper "multilayer codes for synchronization from deletions and insertions"):
  with members:
    - "list decoding of deletions using guess check codes"
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "list decoding of insertions and deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "edit distance sketching streaming and document exchange"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"

Connected through hyperedge HE-3 (induced by source paper "codes for correcting localized deletions"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "codes correcting two deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "correcting bursty and localized deletions using guess check codes"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-4 (induced by source paper "correcting bursty and localized deletions using guess check codes"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "codes correcting two deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "polar coding for the binary erasure channel with deletions"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-5 (induced by source paper "an information theoretic analysis of deduplication"):
  with members:
    - "file updates under random arbitrary insertions and deletions"
    - "synchronizing edits in distributed storage networks"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-6 (induced by source paper "multilayer codes for synchronization from deletions"):
  with members:
    - "efficient low redundancy codes for correcting multiple deletions"
    - "synchronization from deletions through interactive communication"

Connected through hyperedge HE-7 (induced by source paper "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"):
  with members:
    - "weight enumerators and higher support weights of maximally recoverable codes"
    - "on partial maximally recoverable and maximally recoverable codes"
    - "file updates under random arbitrary insertions and deletions"
    - "synchronizing edits in distributed storage networks"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "explicit maximally recoverable codes with locality"

Connected through hyperedge HE-8 (induced by source paper "file updates under random arbitrary insertions and deletions"):
  with members:
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "synchronizing rankings via interactive communication"
    - "synchronizing edits in distributed storage networks"
    - "bounds on the capacity of random insertion and deletion additive noise channels"
    - "a compression algorithm using mis aligned side information"
    - "synchronization from deletions through interactive communication"
    - "on the deletion channel with small deletion probability"

Question: Please tell me which class the center node 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)