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: "bandwidth analysis of multiport radio frequency systems"
  Abstract: When multiple radio-frequency sources are connected to multiple loads through a passive multiport matching network, perfect power transfer to the loads across all frequencies is generally impossible. In this two-part paper, we provide analyses of bandwidth over which power transfer is possible. Our principal tools include broadband multiport matching upper bounds, presented herein, on the integral over all frequency of the logarithm of a suitably defined power loss ratio. In general, the larger the integral, the larger the bandwidth over which power transfer can be accomplished. We apply these bounds in several ways: We show how the number of sources and loads, and the coupling between loads, affect achievable bandwidth. We analyze the bandwidth of networks constrained to have certain architectures. We characterize systems whose bandwidths scale as the ratio between the numbers of loads and sources. #R##N#The first part of the paper presents the bounds and uses them to analyze loads whose frequency responses can be represented by analytical circuit models. The second part analyzes the bandwidth of realistic loads whose frequency responses are available numerically. We provide applications to wireless transmitters where the loads are antennas being driven by amplifiers. The derivations of the bounds are also included.

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)