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: "dynamic shannon coding"
  Abstract: We present a new algorithm for dynamic prefix-free coding, based on Shannon coding. We give a simple analysis and prove a better upper bound on the length of the encoding produced than the corresponding bound for dynamic Huffman coding. We show how our algorithm can be modified for efficient length-restricted coding, alphabetic coding and coding with unequal letter costs.

Connected through hyperedge HE-1 (induced by source paper "new algorithms and lower bounds for sequential access data compression"):
  with members:
    - "on optimally partitioning a text to improve its compression"
    - "low memory adaptive prefix coding"
    - "dynamic asymmetric communication"
    - "reversal complexity revisited"
    - "large alphabets and incompressibility"
    - "tight lower bounds for query processing on streaming and external memory data"

Connected through hyperedge HE-2 (induced by source paper "minimax trees in linear time"):
  with members:
    - "a new algorithm for building alphabetic minimax trees"
    - "tight bounds on minimum maximum pointwise redundancy"
    - "radix sorting with no extra space"

Connected through hyperedge HE-3 (induced by source paper "worst case optimal adaptive prefix coding"):
  with members:
    - "low memory adaptive prefix coding"
    - "dynamic ordered sets with exponential search trees"

Connected through hyperedge HE-4 (induced by source paper "dynamic asymmetric communication"):
  with members:
    - "sorting a low entropy sequence"

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)