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: "virtual full duplex wireless broadcasting via compressed sensing"
  Abstract: A novel solution is proposed to undertake a frequent task in wireless networks, which is to let all nodes broadcast information to and receive information from their respective one-hop neighboring nodes. The contribution is two-fold. First, as each neighbor selects one message-bearing codeword from its unique codebook for transmission, it is shown that decoding their messages based on a superposition of those codewords through the multiaccess channel is fundamentally a problem of compressed sensing. In the case where each message consists of a small number of bits, an iterative algorithm based on belief propagation is developed for efficient decoding. Second, to satisfy the half-duplex constraint, each codeword consists of randomly distributed on-slots and off-slots. A node transmits during its on-slots, and listens to its neighbors only through its own off-slots. Over one frame interval, each node broadcasts a message to neighbors and simultaneously decodes neighbors' messages based on the superposed signals received through its own off-slots. Thus the solution fully exploits the multiaccess nature of the wireless medium and addresses the half-duplex constraint at the fundamental level. In a network consisting of Poisson distributed nodes, numerical results demonstrate that the proposed scheme often achieves several times the rate of slotted ALOHA and CSMA with the same packet error rate.

Connected through hyperedge HE-1 (induced by source paper "sparse ofdm a compressive sensing approach to asynchronous neighbor discovery"):
  with members:
    - "massive connectivity with massive mimo part i device activity detection and channel estimation"
    - "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
    - "detection and combining techniques for asynchronous random access with time diversity"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "probabilistic rateless multiple access for machine to machine communication"
    - "many access channels the gaussian case with random user activities"
    - "asynchronous code division random access using convex optimization"
    - "neighbor discovery in a wireless sensor network multipacket reception capability and physical layer signal processing"

Connected through hyperedge HE-2 (induced by source paper "multi antenna assisted virtual full duplex relaying with reliability aware iterative decoding"):
  with members:
    - "all digital self interference cancellation technique for full duplex systems"
    - "in band full duplex wireless challenges and opportunities"

Connected through hyperedge HE-3 (induced by source paper "capacity of gaussian many access channels"):
  with members:
    - "on or many access channels"
    - "sparse ofdm a compressive sensing approach to asynchronous neighbor discovery"
    - "identifying randomly activated users via sign compute resolve on graphs"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "many access for small packets based on precoding and sparsity aware recovery"
    - "many access channels the gaussian case with random user activities"
    - "many broadcast channels definition and capacity in the degraded case"
    - "sparse signal processing with linear and non linear observations a unified shannon theoretic approach"

Connected through hyperedge HE-4 (induced by source paper "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"):
  with members:
    - "full duplex mimo small cell networks performance analysis"
    - "outage analysis of full duplex architectures in cellular networks"
    - "asymptotic deployment gain a simple approach to characterize the sinr distribution in general cellular networks"
    - "the mean interference to signal ratio and its key role in cellular and amorphous networks"
    - "throughput analysis for wireless networks with full duplex radios"
    - "low complexity end to end performance optimization in mimo full duplex relay systems"
    - "hybrid full half duplex system analysis in heterogeneous wireless networks"
    - "pushing the limits of full duplex design and real time implementation"

Connected through hyperedge HE-5 (induced by source paper "many access for small packets based on precoding and sparsity aware recovery"):
  with members:
    - "capacity of gaussian many access channels"
    - "a novel uplink data transmission scheme for small packets in massive mimo system"
    - "many access channels the gaussian case with random user activities"
    - "scma codebook design"
    - "massive mimo for next generation wireless systems"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "near oracle performance of greedy block sparse estimation techniques from noisy measurements"
    - "structured compressed sensing from theory to applications"

Connected through hyperedge HE-6 (induced by source paper "hybrid full half duplex system analysis in heterogeneous wireless networks"):
  with members:
    - "throughput analysis for wireless networks with full duplex radios"
    - "modeling and efficient cancellation of nonlinear self interference in mimo full duplex transceivers"
    - "interference coordination random clustering and adaptive limited feedback"
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "in band full duplex wireless challenges and opportunities"
    - "fundamentals of heterogeneous cellular networks with energy harvesting"
    - "offloading in heterogeneous networks modeling analysis and design insights"
    - "analytical modeling of uplink cellular networks"

Connected through hyperedge HE-7 (induced by source paper "baseband and rf hardware impairments in full duplex wireless systems experimental characterisation and suppression"):
  with members:
    - "on phase noise suppression in full duplex systems"
    - "cancellation of power amplifier induced nonlinear self interference in full duplex transceivers"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "analysis of oscillator phase noise effects on self interference cancellation in full duplex ofdm radio transceivers"
    - "widely linear digital self interference cancellation in direct conversion full duplex transceiver"
    - "full duplex transceiver system calculations analysis of adc and linearity challenges"
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "full duplex cooperative cognitive radio with transmit imperfections"

Connected through hyperedge HE-8 (induced by source paper "throughput analysis for wireless networks with full duplex radios"):
  with members:
    - "pushing the limits of full duplex design and real time implementation"
    - "virtual full duplex wireless communication via rapid on off division duplex"
    - "neighbor discovery for wireless networks via compressed sensing"
    - "two way transmission capacity of wireless ad hoc networks"

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)