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 tight upper bound for the third order asymptotics for most discrete memoryless channels"
  Abstract: This paper shows that the logarithm of the e-error capacity (average error probability) for n uses of a discrete memoryless channel (DMC) is upper bounded by the normal approximation plus a third-order term that does not exceed [ 1/ 2] logn +O(1) if the e-dispersion of the channel is positive. This matches a lower bound by Y. Polyanskiy (2010) for DMCs with positive reverse dispersion. If the e-dispersion vanishes, the logarithm of the e-error capacity is upper bounded by n times the capacity plus a constant term except for a small class of DMCs and e ≥ [ 1/ 2].

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 "on exact asymptotics of the error probability in channel coding symmetric channels"):
  with members:
    - "a new method for employing feedback to improve coding performance"
    - "the sphere packing bound for dspcs with feedback a la augustin"
    - "exact asymptotics for the random coding error probability"
    - "the saddlepoint approximation unified random coding asymptotics for fixed and varying rates"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "refinement of the random coding bound"
    - "a derivation of the asymptotic random coding prefactor"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"

Connected through hyperedge HE-3 (induced by source paper "fast harq over finite blocklength codes a technique for low latency reliable communication"):
  with members:
    - "mimo channel modeling and capacity analysis for 5g millimeter wave wireless systems"
    - "modelling decoding errors in harq"
    - "green communication via power optimized harq protocols"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "millimeter wave channel modeling and cellular capacity evaluation"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-4 (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"
    - "channels with cost constraints strong converse and dispersion"
    - "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-5 (induced by source paper "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "two measures of dependence"
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "universal channel coding for exponential family of channels"
    - "universal channel coding for general output alphabet"
    - "converses for secret key agreement and secure computing"
    - "encoding tasks and renyi entropy"

Connected through hyperedge HE-6 (induced by source paper "semi finite length analysis for information theoretic tasks"):
  with members:
    - "physical layer security for rf satellite channels in the finite length regime"
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "non asymptotic and asymptotic analyses of information processing on markov chains"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "information spectrum approach to second order coding rate in channel coding"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-7 (induced by source paper "algorithmic aspects of optimal channel coding"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "information spectrum approach to second order coding rate in channel coding"
    - "approximation thresholds for combinatorial optimization problems"

Connected through hyperedge HE-8 (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"
    - "channels with cost constraints strong converse and dispersion"
    - "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"

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)