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: "tight bounds on minimum maximum pointwise redundancy"
  Abstract: This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of minimizing maximum pointwise redundancy. This objective relates to both universal modeling and Shannon coding, and these bounds are tight throughout the interval. The upper bounds also apply to a related objective, that of dth exponential redundancy.

Connected through hyperedge HE-1 (induced by source paper "lossless source codes for a class described by variational distance and optimal merging algorithm"):
  with members:
    - "optimal prefix codes for infinite alphabets with nonlinear costs"
    - "a general framework for codes involving redundancy minimization"

Connected through hyperedge HE-2 (induced by source paper "variable length lossless coding for variational distance class an optimal merging algorithm"):
  with members:
    - "a general framework for codes involving redundancy minimization"

Connected through hyperedge HE-3 (induced by source paper "optimal merging algorithms for lossless codes with generalized criteria"):
  with members:
    - "lossless coding with generalised criteria"
    - "optimal prefix codes for infinite alphabets with nonlinear costs"
    - "a general framework for codes involving redundancy minimization"

Connected through hyperedge HE-4 (induced by source paper "lossless coding with generalised criteria"):
  with members:
    - "a general framework for codes involving redundancy minimization"

Connected through hyperedge HE-5 (induced by source paper "minimax trees in linear time"):
  with members:
    - "a new algorithm for building alphabetic minimax trees"
    - "radix sorting with no extra space"
    - "dynamic shannon coding"

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)