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 "local decode and update for big data compression"):
  Abstract: This paper investigates data compression that simultaneously allows local decoding and local update. The main result is a universal compression scheme for memoryless sources with the following features. The rate can be made arbitrarily close to the entropy of the underlying source, contiguous fragments of the source can be recovered or updated by probing or modifying a number of codeword bits that is on average linear in the size of the fragment, and the overall encoding and decoding complexity is quasilinear in the blocklength of the source. In particular, the local decoding or update of a single message symbol can be performed by probing or modifying a constant number of codeword bits. This latter part improves over previous best known results for which local decodability or update efficiency grows logarithmically with blocklength.

Includes members:
  Member "how to store a random walk":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "o log log n worst case local decoding and update efficiency for data compression")
  Member "set membership with non adaptive bit probes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "compressed data structures for dynamic sequences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed dynamic range majority and minority data structures")
  Member "set membership with a few bit probes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "bounds on the parameters of locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "a family of optimal locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a locality based approach for coded computation")
  Member "update efficiency and local repairability limits for capacity approaching codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "achieving multi port memory performance on single port memory with coding techniques")
  Member "on locally decodable source coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "o log log n worst case local decoding and update efficiency for data compression")

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)