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: "prioritized random mac optimization via graph based analysis"
  Abstract: Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access control protocols. The IRSA schemes have been mostly analyzed for theoretical scenarios for homogenous sources, where they are shown to substantially improve the system performance compared to classical slotted ALOHA protocols. In this work, we consider generic systems where sources in different importance classes compete for a common channel. We propose a new prioritized IRSA algorithm and derive the probability to correctly resolve collisions for data from each source class. We then make use of our theoretical analysis to formulate a new optimization problem for selecting the transmission strategies of heterogenous sources. We optimize both the replication probability per class and the source rate per class, in such a way that the overall system utility is maximized. We then propose a heuristic-based algorithm for the selection of the transmission strategy, which is built on intrinsic characteristics of the iterative decoding methods adopted for recovering from collisions. Experimental results validate the accuracy of the theoretical study and show the gain of well-chosen prioritized transmission strategies for transmission of data from heterogenous classes over shared wireless channels.

Connected through hyperedge HE-1 (induced by source paper "unequal error protection in coded slotted aloha"):
  with members:
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "broadcast coded slotted aloha for vehicular communications a finite frame length analysis"
    - "broadcast coded slotted aloha a finite frame length analysis"
    - "aloha random access that operates as a rateless code"
    - "coded slotted aloha with varying packet loss rate across users"
    - "high throughput random access via codes on graphs coded slotted aloha"

Connected through hyperedge HE-2 (induced by source paper "random multiple access for m2m communications with qos guarantees"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "probabilistic rateless multiple access for machine to machine communication"
    - "exploiting capture effect in frameless aloha for massive wireless random access"
    - "aloha random access that operates as a rateless code"
    - "fundamentals of throughput maximization with random arrivals for m2m communications"
    - "frameless aloha protocol for wireless networks"

Connected through hyperedge HE-3 (induced by source paper "on the capacity region of aloha protocol for the internet of things"):
  with members:
    - "design of a scalable hybrid mac protocol for heterogeneous m2m networks"
    - "frameless aloha protocol for wireless networks"

Connected through hyperedge HE-4 (induced by source paper "finite length performance of random slotted aloha strategies"):
  with members:
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "aloha random access that operates as a rateless code"

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)