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: "random access an information theoretic perspective"
  Abstract: This paper considers a random access system where each sender is in one of two possible states, active or not active, and the states are only known to the common receiver. Active senders encode data into independent information streams, a subset of which is decoded depending on the collective interference. An information-theoretic formulation of the problem is presented and the set of achievable rates is characterized with a guaranteed gap to optimality. Inner and outer bounds on the capacity region of a two-sender system are tight in the case of a binary-expansion deterministic channel and differ by less than one bit in the case of a Gaussian channel. In systems with an arbitrary number of senders, the symmetric scenario of equal access probabilities and received power constraints is studied and the system throughput, i.e., the maximum achievable expected sum rate, is characterized. It is shown that a simple coding scheme where active senders transmit a single message is optimum for a binary-expansion deterministic channel and achieves within one bit of the optimum in the case of a Gaussian channel. Finally, a comparison with the slotted ALOHA protocol is provided, showing that encoding rate adaptation at the transmitters achieves constant (rather than zero) throughput as the number of users tends to infinity.

Connected through hyperedge HE-1 (induced by source paper "interference prediction in wireless networks stochastic geometry meets recursive filtering"):
  with members:
    - "auto correlation and coherence time of interference in poisson networks"
    - "temporal correlation of interference and outage in mobile networks over one dimensional finite regions"
    - "interference functionals in poisson networks"
    - "rethinking the role of interference in wireless networks"
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "dual branch mrc receivers under spatial interference correlation and nakagami fading"
    - "resource optimization in device to device cellular systems using time frequency hopping"
    - "diversity polynomials for the analysis of temporal correlations in wireless networks"

Connected through hyperedge HE-2 (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"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "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-3 (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"
    - "second order rate region of constant composition codes for the multiple access channel"

Connected through hyperedge HE-4 (induced by source paper "maximum sum rate of slotted aloha with successive interference cancellation"):
  with members:
    - "noma based random access with multichannel aloha"
    - "maximum sum rate of slotted aloha with capture"
    - "coded random access applying codes on graphs to design random access protocols"
    - "aloha random access that operates as a rateless code"
    - "random access with physical layer network coding"
    - "an overview of the transmission capacity of wireless networks"

Connected through hyperedge HE-5 (induced by source paper "asynchronous transmission over gaussian interference channels with stochastic data arrival"):
  with members:
    - "a relay can increase degrees of freedom in bursty mimo interference networks"
    - "optimal sequential frame synchronization"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "maximum sum rate of slotted aloha with capture"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "managing interference correlation through random medium access"
    - "aloha random access that operates as a rateless code"
    - "adaptive spatial aloha fairness and stochastic geometry"
    - "random access with physical layer network coding"
    - "an overview of the transmission capacity of wireless networks"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"

Connected through hyperedge HE-7 (induced by source paper "on two pair two way relay channel with an intermittently available relay"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "approximate capacity region of the two user miso broadcast channels with delayed csit"
    - "topological interference management with alternating connectivity"
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "wireless network information flow a deterministic approach"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "a generalized channel coding theory for distributed communication"):
  with members:
    - "random access and source channel coding error exponents for multiple access channels"
    - "error performance of channel coding in random access communication"
    - "a new approach to random access reliable communication and reliable collision detection"

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)