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: "source coding for quasiarithmetic penalties"
  Abstract: Whereas Huffman coding finds a prefix code minimizing mean codeword length for a given finite-item probability distribution, quasiarithmetic or quasilinear coding problems have the goal of minimizing a generalized mean of the form rho-1(Sigmaipirho(li )), where li denotes the length of the ith codeword, p i denotes the corresponding probability, and rho is a monotonically increasing cost function. Such problems, proposed by Campbell, have a number of diverse applications. Several cost functions are shown here to yield quasiarithmetic problems with simple redundancy bounds in terms of a generalized entropy. A related property, also shown here, involves the existence of optimal codes: For "well-behaved" cost functions, optimal codes always exist for (possibly infinite-alphabet) sources having finite generalized entropy. An algorithm is introduced for finding binary codes optimal for convex cost functions. This algorithm, which can be extended to other minimization utilities, can be performed using quadratic time and linear space. This reduces the computational complexity of a problem involving minimum delay in a queue, allows combinations of previously considered problems to be optimized, and greatly expands the set of problems solvable in quadratic time and linear space

Connected through hyperedge HE-1 (induced by source paper "timely lossless source coding for randomly arriving symbols"):
  with members:
    - "timeliness in lossless block coding"
    - "timely updates over an erasure channel"
    - "status updates through m g 1 1 queues with harq"
    - "update or wait how to keep your data fresh"
    - "optimizing data freshness throughput and delay in multi server information update systems"

Connected through hyperedge HE-2 (induced by source paper "optimal source codes for timely updates"):
  with members:
    - "timeliness in lossless block coding"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "guessing revisited a large deviations approach"

Connected through hyperedge HE-3 (induced by source paper "optimal compression for two field entries in fixed width memories"):
  with members:
    - "on the problem of optimal path encoding for software defined networks"
    - "compressing ip forwarding tables towards entropy bounds and beyond"

Connected through hyperedge HE-4 (induced by source paper "optimal prefix codes for infinite alphabets with nonlinear costs"):
  with members:
    - "a general framework for codes involving redundancy minimization"

Connected through hyperedge HE-5 (induced by source paper "reserved length prefix coding"):
  with members:
    - "d ary bounded length huffman coding"

Connected through hyperedge HE-6 (induced by source paper "infinite alphabet prefix codes optimal for beta exponential penalties"):
  with members:
    - "a general framework for codes involving redundancy minimization"

Connected through hyperedge HE-7 (induced by source paper "alphabetic coding with exponential costs"):
  with members:
    - "optimal prefix codes for infinite alphabets with nonlinear costs"
    - "a general framework for codes involving redundancy minimization"
    - "renyi to renyi source coding under siege"

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)