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: "improved finite blocklength converses for slepian wolf coding via linear programming"
  Abstract: A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength point- to-point coding problems from [3] is employed. However, a direct application of this framework demands a complicated analysis for the Slepian-Wolf problem. An analytically simpler approach is presented wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength metaconverses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for Slepian-Wolf coding is obtained by an appropriate combination of these converses.

Connected through hyperedge HE-1 (induced by source paper "minimax theorems for finite blocklength lossy joint source channel coding over an avc"):
  with members:
    - "finite blocklength and dispersion bounds for the arbitrarily varying channel"
    - "shannon meets von neumann a minimax theorem for channel coding in the presence of a jammer"
    - "linear programming based converses for finite blocklength lossy joint source channel coding"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-2 (induced by source paper "fundamental limits of lossless data compression with side information"):
  with members:
    - "lossless source coding in the point to point multiple access and random access scenarios"
    - "on the dispersions of three network information theory problems"
    - "reference based genome compression"
    - "second order slepian wolf coding theorems for non mixed and mixed sources"

Connected through hyperedge HE-3 (induced by source paper "strong converse using change of measure arguments"):
  with members:
    - "a new proof of nonsignalling multiprover parallel repetition theorem"
    - "communication for generating correlation a survey"
    - "communication for generating correlation a unifying survey"
    - "second order region for gray wyner network"
    - "strong converses are just edge removal properties"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "wiretap channel capacity secrecy criteria strong converse and phase change"
    - "linear programming based converses for finite blocklength lossy joint source channel 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)