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: "channels with cost constraints strong converse and dispersion"
  Abstract: This paper shows the strong converse and the dispersion of memoryless channels with cost constraints and performs refined analysis of the third order term in the asymptotic expansion of the maximum achievable channel coding rate, showing that it is equal to $\frac 1 2 \frac {\log n}{n}$ in most cases of interest. The analysis is based on a non-asymptotic converse bound expressed in terms of the distribution of a random variable termed the $\mathsf b$-tilted information density, which plays a role similar to that of the $\mathsf d$-tilted information in lossy source coding. We also analyze the fundamental limits of lossy joint-source-channel coding over channels with cost constraints.

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"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "second and third order asymptotics of the continuous time poisson channel"):
  with members:
    - "the stochastic calculus approach to multi receiver poisson channels"
    - "fine asymptotics for universal one to one compression of parametric sources"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "asymptotics and non asymptotics for universal fixed to variable source coding"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-3 (induced by source paper "the augustin capacity and center"):
  with members:
    - "the renyi capacity and center"
    - "the sphere packing bound for memoryless channels"
    - "the augustin center and the sphere packing bound for memoryless channels"
    - "exponent function for stationary memoryless channels with input cost at rates above the capacity"
    - "the sphere packing bound via augustin s method"
    - "constant compositions in the sphere packing bound for classical quantum channels"
    - "renyi divergence and kullback leibler divergence"
    - "on pinsker s and vajda s type inequalities for csiszar s f divergences"

Connected through hyperedge HE-4 (induced by source paper "second order region for gray wyner network"):
  with members:
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "interactive communication for data exchange"
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "information complexity density and simulation of protocols"
    - "strong converse and second order asymptotics of channel resolvability"
    - "secret key agreement general capacity and second order asymptotics"

Connected through hyperedge HE-5 (induced by source paper "on the throughput of channels that wear out"):
  with members:
    - "energy harvesting transmitters that heat up throughput maximization under temperature constraints"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "dissipation of information in channels with input constraints"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"
    - "an information theoretic characterization of channels that die"
    - "channels that heat up"

Connected through hyperedge HE-6 (induced by source paper "f divergence inequalities"):
  with members:
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "optimal quantization for distribution synthesis"
    - "e_ gamma resolvability"
    - "bounds between contraction coefficients"
    - "one shot mutual covering lemma and marton s inner bound with a common message"
    - "refinement of some moment inequalities"
    - "on the renyi divergence joint range of relative entropies and a channel coding theorem"
    - "resolvability in e γ with applications to lossy compression and wiretap channels"

Connected through hyperedge HE-7 (induced by source paper "non asymptotic achievable rates for energy harvesting channels using save and transmit"):
  with members:
    - "finite blocklength achievable rates for energy harvesting awgn channels with infinite buffer"
    - "capacity of the energy harvesting channel with a finite battery"
    - "energy harvesting wireless communications a review of recent advances"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "capacity of the awgn channel with random battery recharges"
    - "the third order term in the normal approximation for the awgn channel"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "binary energy harvesting channel with finite energy storage"

Connected through hyperedge HE-8 (induced by source paper "linear programming based converses for finite blocklength lossy joint source channel coding"):
  with members:
    - "generalized sphere packing bound"
    - "upper bounds on the size of grain correcting codes"
    - "correcting grain errors in magnetic media"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "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)