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: "second order rate region of constant composition codes for the multiple access channel"
  Abstract: This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's combinatorial central limit theorem, an inner bound on the set of locally achievable second-order coding rates is given for each point on the boundary of the capacity region. It is shown that the inner bound for constant-composition random coding includes that recovered by i.i.d. random coding, and that the inclusion may be strict. The inner bound is extended to the Gaussian multiple-access channel via an increasingly fine quantization of the inputs.

Connected through hyperedge HE-1 (induced by source paper "gaussian multiple and random access in the finite blocklength regime"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "lossless source coding in the point to point multiple access and random access scenarios"
    - "random access channel coding in the finite blocklength regime"
    - "capacity of gaussian many access channels"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "many access channels the gaussian case with random user activities"
    - "on the dispersions of three network information theory problems"

Connected through hyperedge HE-2 (induced by source paper "random access channel coding in the finite blocklength regime"):
  with members:
    - "lossless source coding in the point to point multiple access and random access scenarios"
    - "capacity of gaussian many access channels"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "many access channels the gaussian case with random user activities"
    - "on the dispersions of three network information theory problems"
    - "aloha random access that operates as a rateless code"
    - "random access an information theoretic perspective"

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

Connected through hyperedge HE-4 (induced by source paper "a proof of the strong converse theorem for gaussian multiple access channels"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "a case where interference does not affect the channel dispersion"
    - "on the dispersions of three network information theory problems"
    - "a finite blocklength perspective on gaussian multi access channels"
    - "information spectrum approach to second order coding rate in channel coding"
    - "simple channel coding bounds"

Connected through hyperedge HE-5 (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-6 (induced by source paper "second order asymptotics for the gaussian mac with degraded message sets"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "on the dispersions of three network information theory problems"
    - "second order asymptotics for the discrete memoryless mac with degraded message sets"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "second order resolvability intrinsic randomness and fixed length source coding for mixed sources information spectrum approach"
    - "non asymptotic and second order achievability bounds for coding with side information"
    - "a finite blocklength perspective on gaussian multi access channels"

Connected through hyperedge HE-7 (induced by source paper "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"):
  with members:
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "optimum power control at finite blocklength"
    - "variations on a theme by schalkwijk and kailath"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-8 (induced by source paper "a case where interference does not affect the channel dispersion"):
  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"
    - "second order coding rates for channels with state"
    - "on the dispersions of three network information theory problems"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "non asymptotic and second order achievability bounds for coding with side information"
    - "a finite blocklength perspective on gaussian multi access channels"
    - "lossy joint source channel coding 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)