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: "on the capacity of bandlimited optical intensity channels with gaussian noise"
  Abstract: We determine lower and upper bounds on the capacity of bandlimited optical intensity channels (BLOIC) with white Gaussian noise. Three types of input power constraints are considered: 1) only an average power constraint, 2) only a peak power constraint, and 3) an average and a peak power constraint. Capacity lower bounds are derived by a two-step process including 1) for each type of constraint, designing admissible pulse amplitude modulated input waveform ensembles, and 2) lower bounding the maximum achievable information rates of the designed input ensembles. Capacity upper bounds are derived by exercising constraint relaxations and utilizing known results on discrete-time optical intensity channels. We obtain degrees-of-freedom-optimal (DOF-optimal) lower bounds which have the same pre-log factor as the upper bounds, thereby characterizing the high SNR capacity of BLOIC to within a finite gap. We further derive intersymbol-interference-free (ISI-free) signaling based lower bounds, which perform well for all practical SNR values. In particular, the ISI-free signaling based lower bounds outperform the DOF-optimal lower bound when the SNR is below 10 dB.

Connected through hyperedge HE-1 (induced by source paper "bounds on the capacity region of the optical intensity multiple access channel"):
  with members:
    - "on the capacity of mimo optical wireless channels"
    - "capacity bounds for discrete time amplitude constrained additive white gaussian noise channels"
    - "bandlimited intensity modulation"
    - "on the capacity of free space optical intensity channels"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-2 (induced by source paper "capacity bounds for bandlimited gaussian channels with peak to average power ratio constraint"):
  with members:
    - "capacity and degree of freedom of ofdm channels with amplitude constraint"
    - "bandlimited intensity modulation"

Connected through hyperedge HE-3 (induced by source paper "a comparative study of unipolar ofdm schemes in gaussian optical intensity channel"):
  with members:
    - "comparisons of spectrally enhanced asymmetrically clipped optical ofdm systems"
    - "spectrally and energy efficient ofdm see ofdm for intensity modulated optical wireless systems"
    - "evm and achievable data rate analysis of clipped ofdm signals in visible light communication"
    - "a general framework for transmission with transceiver distortion and some applications"
    - "flip ofdm for unipolar communication systems"
    - "on the capacity of free space optical intensity channels"

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)