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: "lossy joint source channel coding in the finite blocklength regime"
  Abstract: This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the non-asymptotic regime. A joint source-channel code maps a block of $k$ source symbols onto a length$-n$ channel codeword, and the fidelity of reproduction at the receiver end is measured by the probability $\epsilon$ that the distortion exceeds a given threshold $d$. For memoryless sources and channels, it is demonstrated that the parameters of the best joint source-channel code must satisfy $nC - kR(d) \approx \sqrt{nV + k \mathcal V(d)} Q(\epsilon)$, where $C$ and $V$ are the channel capacity and channel dispersion, respectively; $R(d)$ and $\mathcal V(d)$ are the source rate-distortion and rate-dispersion functions; and $Q$ is the standard Gaussian complementary cdf. Symbol-by-symbol (uncoded) transmission is known to achieve the Shannon limit when the source and channel satisfy a certain probabilistic matching condition. In this paper we show that even when this condition is not satisfied, symbol-by-symbol transmission is, in some cases, the best known strategy in the non-asymptotic regime.

Connected through hyperedge HE-1 (induced by source paper "finite sample analysis of image registration"):
  with members:
    - "estimators for multivariate information measures in general probability spaces"
    - "end to end unsupervised deformable image registration with a convolutional neural network"
    - "a deep metric for multimodal registration"
    - "fundamental limits in multi image alignment"
    - "demystifying fixed k nearest neighbor information estimators"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "asymptotics and non asymptotics for universal fixed to variable source coding"
    - "channels with cost constraints strong converse and dispersion"

Connected through hyperedge HE-2 (induced by source paper "leveraging linear quadratic regulator cost and energy consumption for ultra reliable and low latency iot control systems"):
  with members:
    - "twin timescale radio resource management for ultra reliable and low latency vehicular networks"
    - "ultra reliable and low latency communications for connected vehicles challenges and solutions"
    - "wireless network design for control systems a survey"
    - "high reliability and low latency for vehicular networks challenges and solutions"
    - "on the feasibility of wireless energy transfer using massive antenna arrays"
    - "rate cost tradeoffs in control"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "source channel coding under energy delay and buffer constraints"

Connected through hyperedge HE-3 (induced by source paper "one shot approach to lossy source coding under average distortion constraints"):
  with members:
    - "achievable and converse bounds over a general channel and general decoding metric"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-4 (induced by source paper "polar codes simplicity random codes durability"):
  with members:
    - "reed muller codes polarize"
    - "ar i kan meets shannon polar codes with near optimal convergence to channel capacity"
    - "explicit polar codes with small scaling exponent"
    - "on the capacity of channels with deletions and states"
    - "polar codes for the deletion channel weak and strong polarization"
    - "polar like codes and asymptotic tradeoff among block length code rate and error probability"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"

Connected through hyperedge HE-5 (induced by source paper "lossless source coding in the point to point multiple access and random access scenarios"):
  with members:
    - "random access channel coding in the finite blocklength regime"
    - "on the calculation of the minimax converse of the channel coding problem"
    - "on the dispersions of three network information theory problems"
    - "variable length compression allowing errors"
    - "random access an information theoretic perspective"
    - "second order slepian wolf coding theorems for non mixed and mixed sources"
    - "fixed length lossy compression in the finite blocklength regime"
    - "network coding is zero error always possible"

Connected through hyperedge HE-6 (induced by source paper "a lower bound on the expected distortion of joint source channel coding"):
  with members:
    - "sequential empirical coordination under an output entropy constraint"
    - "a source channel separation theorem with application to the source broadcast problem"
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "moderate deviations in channel coding"
    - "the dispersion of joint source channel coding"

Connected through hyperedge HE-7 (induced by source paper "the dispersion of the gauss markov source"):
  with members:
    - "second order region for gray wyner network"
    - "on the dispersions of three network information theory problems"
    - "fixed length lossy compression in the finite blocklength regime"
    - "the dispersion of lossy source coding"
    - "the dispersion of joint source channel coding"
    - "a note on rate distortion functions for nonstationary gaussian autoregressive processes"

Connected through hyperedge HE-8 (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"
    - "improved finite blocklength converses for slepian wolf coding via linear programming"
    - "linear programming based converses for finite blocklength lossy joint source channel coding"
    - "fixed length lossy compression in the finite blocklength regime"

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)