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: "an enhanced multiple random access scheme for satellite communications"
  Abstract: In this paper, we introduce Multi-Slots Coded ALOHA (MuSCA) as a multiple random access method for satellite communications. This scheme can be considered as a generalization of the Contention Resolution Diversity Slotted Aloha (CRDSA) mechanism. Instead of transmitting replicas, this system replaces them by several parts of a single word of an error correcting code. It is also different from Coded Slotted ALOHA (CSA) as the assumption of destructive collisions is not adopted. In MuSCA, the entity in charge of the decoding mechanism collects all bursts of the same user (including the interfered slots) before decoding and implements a successive interference cancellation (SIC) process to remove successfully decoded signals. Simulations show that for a frame of 100 slots, the achievable total normalized throughput is greater than 1.25 and 1.4 for a frame of 500 slots, resulting in a gain of 80% and 75% with respect to CRDSA and CSA respectively. This paper is a first analysis of the proposed scheme and opens several perspectives.

Connected through hyperedge HE-1 (induced by source paper "estimation of timing offsets and phase shifts between packet replicas in marsala random access"):
  with members:
    - "improved channel estimation for interference cancellation in random access methods for satellite communications"

Connected through hyperedge HE-2 (induced by source paper "performance evaluation of marsala with synchronisation errors in satellite communications"):
  with members:
    - "improved channel estimation for interference cancellation in random access methods for satellite communications"

Connected through hyperedge HE-3 (induced by source paper "random access with physical layer network coding"):
  with members:
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "sliding window based contention resolution diversity slotted aloha"
    - "random access an information theoretic perspective"
    - "a network coded diversity protocol for collision recovery in slotted aloha networks"
    - "frameless aloha protocol for wireless networks"
    - "reliable physical layer network coding"
    - "high throughput random access via codes on graphs coded slotted aloha"
    - "collision helps algebraic collision recovery for wireless erasure networks"

Connected through hyperedge HE-4 (induced by source paper "a network coded diversity protocol for collision recovery in slotted aloha networks"):
  with members:
    - "asynchronous physical layer network coding"
    - "reliable physical layer network coding"
    - "collision codes decoding superimposed bpsk modulated wireless transmissions"
    - "physical layer network coding"

Connected through hyperedge HE-5 (induced by source paper "multi slot coded aloha with irregular degree distribution"):
  with members:
    - "a cooperative network coding strategy for the interference relay channel"
    - "high throughput random access via codes on graphs coded slotted aloha"
    - "physical layer network coding"

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)