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 with physical layer network coding"
  Abstract: Leveraging recent progress in physical-layer network coding we propose a new approach to random access: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission, the receiver can thus obtain many linear combinations and eventually recover all original packets. This is by contrast to slotted ALOHA where packet collisions lead to complete erasures. The throughput of the proposed strategy is derived and shown to be significantly superior to the best known strategies, including multipacket reception.

Connected through hyperedge HE-1 (induced by source paper "random access for massive machine type communications"):
  with members:
    - "beamwidth control for noma in hybrid mmwave communication systems"
    - "design of non orthogonal beamspace multiple access for cellular internet of things"
    - "on the performance gain of noma over oma in uplink single cell systems"
    - "multi beam noma for hybrid mmwave systems"
    - "joint pilot and payload power control for uplink mimo noma with mrc sic receivers"
    - "reliability based windowed decoding for spatially coupled ldpc codes"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "a multi beam noma framework for hybrid mmwave systems"

Connected through hyperedge HE-2 (induced by source paper "towards massive connectivity support for scalable mmtc communications in 5g networks"):
  with members:
    - "a random access protocol for pilot allocation in crowded massive mimo systems"
    - "compressive coded random access for massive mtc traffic in 5g systems"
    - "reliable and efficient access for alarm initiated and regular m2m traffic in ieee 802 11ah systems"
    - "massive machine type communication mmtc access with integrated authentication"
    - "reliable recovery of hierarchically sparse signals and application in machine type communications"
    - "pulse shaped ofdm for 5g systems"
    - "coded pilot access a random access solution for massive mimo systems"
    - "random access for massive mimo systems with intra cell pilot contamination"

Connected through hyperedge HE-3 (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 an information theoretic perspective"
    - "an overview of the transmission capacity of wireless networks"

Connected through hyperedge HE-4 (induced by source paper "practical power balanced non orthogonal multiple access"):
  with members:
    - "power domain non orthogonal multiple access noma in 5g systems potentials and challenges"
    - "dynamic user clustering and power allocation for uplink and downlink non orthogonal multiple access noma systems"
    - "network coded multiple access with high order modulations"
    - "coded random access applying codes on graphs to design random access protocols"
    - "network coded multiple access"
    - "reliable physical layer network coding"

Connected through hyperedge HE-5 (induced by source paper "a pseudo bayesian approach to sign compute resolve slotted aloha"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "characterization of coded random access with compressive sensing based multi user detection"
    - "sign compute resolve for random access"
    - "bounded contention coding for wireless networks in the high snr regime"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-6 (induced by source paper "physical layer network coding with multiple antennas an enabling technology for smart cities"):
  with members:
    - "complex linear physical layer network coding"
    - "an algebraic approach to physical layer network coding"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"

Connected through hyperedge HE-7 (induced by source paper "sign compute resolve for tree splitting random access"):
  with members:
    - "identifying randomly activated users via sign compute resolve on graphs"
    - "coded random access applying codes on graphs to design random access protocols"
    - "many access channels the gaussian case with random user activities"
    - "sign compute resolve for random access"
    - "coded splitting tree protocols"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"
    - "collision helps algebraic collision recovery for wireless erasure networks"

Connected through hyperedge HE-8 (induced by source paper "performance analysis of csma with multi packet reception the inhomogeneous case"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "multiple access via compute and forward"
    - "sign compute resolve for random access"
    - "successive integer forcing and its sum rate optimality"
    - "asynchronous physical layer network coding with quasi cyclic codes"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward on a multiaccess relay channel coding and symmetric rate optimization"
    - "compute and forward harnessing interference through structured codes"

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)