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: "a general framework for codes involving redundancy minimization"
  Abstract: A framework with two scalar parameters is introduced for various problems of finding a prefix code minimizing a coding penalty function. The framework encompasses problems previously proposed by Huffman, Campbell, Nath, and Drmota and Szpankowski, shedding light on the relationships among these problems. In particular, Nath's range of problems can be seen as bridging the minimum average redundancy problem of Huffman with the minimum maximum pointwise redundancy problem of Drmota and Szpankowski. Using this framework, two linear-time Huffman-like algorithms are devised for the minimum maximum pointwise redundancy problem, the only one in the framework not previously solved with a Huffman-like algorithm. Both algorithms provide solutions common to this problem and a subrange of Nath's problems, the second algorithm being distinguished by its ability to find the minimum variance solution among all solutions common to the minimum maximum pointwise redundancy and Nath problems. Simple redundancy bounds are also presented

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:
    - "tight bounds on minimum maximum pointwise redundancy"
    - "optimal prefix codes for infinite alphabets with nonlinear costs"

Connected through hyperedge HE-2 (induced by source paper "variable length lossless coding for variational distance class an optimal merging algorithm"):
  with members:
    - "tight bounds on minimum maximum pointwise redundancy"

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"
    - "tight bounds on minimum maximum pointwise redundancy"
    - "optimal prefix codes for infinite alphabets with nonlinear costs"

Connected through hyperedge HE-4 (induced by source paper "minimum redundancy coding for uncertain sources"):
  with members:
    - "minimax trees in linear time"

Connected through hyperedge HE-5 (induced by source paper "lossless coding with generalised criteria"):
  with members:
    - "tight bounds on minimum maximum pointwise redundancy"

Connected through hyperedge HE-6 (induced by source paper "tight bounds on minimum maximum pointwise redundancy"):
  with members:
    - "optimal prefix codes for infinite alphabets with nonlinear costs"
    - "renyi to renyi source coding under siege"

Connected through hyperedge HE-7 (induced by source paper "optimal prefix codes for infinite alphabets with nonlinear costs"):
  with members:
    - "source coding for quasiarithmetic penalties"

Connected through hyperedge HE-8 (induced by source paper "redundancy related bounds on generalized huffman codes"):
  with members:
    - "minimax trees in linear time"
    - "tight bounds on the redundancy of huffman codes"

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)