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 "new algorithms and lower bounds for sequential access data compression"):
  Abstract: This thesis concerns sequential-access data compression, i.e., by algorithms that read the input one or more times from beginning to end. In one chapter we consider adaptive prefix coding, for which we must read the input character by character, outputting each character's self-delimiting codeword before reading the next one. We show how to encode and decode each character in constant worst-case time while producing an encoding whose length is worst-case optimal. In another chapter we consider one-pass compression with memory bounded in terms of the alphabet size and context length, and prove a nearly tight tradeoff between the amount of memory we can use and the quality of the compression we can achieve. In a third chapter we consider compression in the read/write streams model, which allows us passes and memory both polylogarithmic in the size of the input. We first show how to achieve universal compression using only one pass over one stream. We then show that one stream is not sufficient for achieving good grammar-based compression. Finally, we show that two streams are necessary and sufficient for achieving entropy-only bounds.

Includes members:
  Member "on optimally partitioning a text to improve its compression":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimally partitioning variable byte codes")
  Member "low memory adaptive prefix coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "worst case optimal adaptive prefix coding")
  Member "dynamic asymmetric communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient and compact representations of prefix codes")
  Member "reversal complexity revisited":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unidirectional input output streaming complexity of reversal and sorting")
  Member "large alphabets and incompressibility":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lempel ziv like parsing in small space")
  Member "tight lower bounds for query processing on streaming and external memory data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "streamability of nested word transductions")
  Member "dynamic shannon coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimax trees in linear time")

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)