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: "packet throughput analysis of static and dynamic tdd in small cell networks"
  Abstract: We develop an analytical framework for the perfor- mance comparison of small cell networks operating under static time division duplexing (S-TDD) and dynamic TDD (D-TDD). While in S-TDD downlink/uplink (DL/UL) cell transmissions are synchronized, in D-TDD each cell dynamically allocates resources to the most demanding direction. By leveraging stochastic geom- etry and queuing theory, we derive closed-form expressions for the UL and DL packet throughput, also capturing the impact of random traffic arrivals and packet retransmissions. Through our analysis, which is validated via simulations, we confirm that D-TDD outperforms S-TDD in DL, with the vice versa occurring in UL, since asymmetric transmissions reduce DL interference at the expense of an increased UL interference. We also find that in asymmetric scenarios, where most of the traffic is in DL, D-TDD provides a DL packet throughput gain by better controlling the queuing delay, and that such gain vanishes in the light-traffic regime.

Connected through hyperedge HE-1 (induced by source paper "sir coverage analysis in cellular networks with temporal traffic a stochastic geometry approach"):
  with members:
    - "cell edge aware precoding for downlink massive mimo cellular networks"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "spatiotemporal stochastic modeling of iot enabled cellular networks scalability and stability analysis"
    - "toward a tractable delay analysis in ultra dense networks"
    - "unified stochastic geometry modeling and analysis of cellular networks in los nlos and shadowed fading"
    - "the intensity matching approach a tractable stochastic geometry approximation to system level analysis of cellular networks"
    - "performance impact of los and nlos transmissions in dense cellular networks"
    - "towards 1 gbps ue in cellular systems understanding ultra dense small cell deployments"

Connected through hyperedge HE-2 (induced by source paper "delay analysis of random scheduling and round robin in small cell networks"):
  with members:
    - "sir coverage analysis in cellular networks with temporal traffic a stochastic geometry approach"
    - "ultra dense networks a new look at the proportional fair scheduler"
    - "spatiotemporal stochastic modeling of iot enabled cellular networks scalability and stability analysis"
    - "toward a tractable delay analysis in ultra dense networks"
    - "heterogeneous cellular networks with spatio temporal traffic delay analysis and scheduling"
    - "the meta distribution of the sir in poisson bipolar and cellular networks"
    - "study on scheduling techniques for ultra dense small cell networks"
    - "what will 5g be"

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)