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 derivation of the asymptotic random coding prefactor"
  Abstract: This paper studies the subexponential prefactor to the random-coding bound for a given rate. Using a refinement of Gallager's bounding techniques, an alternative proof of a recent result by Altu\u{g} and Wagner is given, and the result is extended to the setting of mismatched decoding.

Connected through hyperedge HE-1 (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"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "refinement of the random coding bound"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"

Connected through hyperedge HE-2 (induced by source paper "the sphere packing bound via augustin s method"):
  with members:
    - "the renyi capacity and center"
    - "the sphere packing bound for memoryless channels"
    - "the sphere packing bound for dspcs with feedback a la augustin"
    - "the augustin capacity and center"
    - "the augustin center and the sphere packing bound for memoryless channels"
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "f divergence inequalities"
    - "exact asymptotics for the random coding error probability"

Connected through hyperedge HE-3 (induced by source paper "asymptotic estimates in information theory with non vanishing error probabilities"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "the third order term in the normal approximation for the awgn channel"
    - "strong converse and second order asymptotics of channel resolvability"
    - "channels with cost constraints strong converse and dispersion"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"

Connected through hyperedge HE-4 (induced by source paper "the third order term in the normal approximation for the awgn channel"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "refinement of the random coding bound"
    - "the third order term in the normal approximation for singular channels"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"
    - "a finite blocklength perspective on gaussian multi access channels"
    - "refinement of the sphere packing bound asymmetric channels"

Connected through hyperedge HE-5 (induced by source paper "expurgated random coding ensembles exponents refinements and connections"):
  with members:
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "refinement of the random coding bound"
    - "error exponents of optimum decoding for the interference channel"
    - "error exponents of erasure list decoding revisited via moments of distance enumerators"

Connected through hyperedge HE-6 (induced by source paper "the saddlepoint approximation unified random coding asymptotics for fixed and varying rates"):
  with members:
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "refinement of the random coding bound"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-7 (induced by source paper "mismatched decoding error exponents second order rates and saddlepoint approximations"):
  with members:
    - "expurgated random coding ensembles exponents refinements and connections"
    - "multiuser coding techniques for mismatched decoding"
    - "a general formula for the mismatch capacity"
    - "refinement of the random coding bound"
    - "on achievable rates for channels with mismatched decoding"
    - "moderate deviations in channel coding"
    - "refinement of the sphere packing bound asymmetric channels"
    - "error exponent for multiple access channels lower bounds"

Connected through hyperedge HE-8 (induced by source paper "refinement of the random coding bound"):
  with members:
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "the third order term in the normal approximation for singular channels"
    - "moderate deviations in channel coding"
    - "refinement of the sphere packing bound asymmetric channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)