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: "ordered tomlinson harashima precoding in g fast downstream"
  Abstract: G.fast is an upcoming next generation DSL standard envisioned to use bandwidth up to 212 MHz. Far-end crosstalk (FEXT) at these frequencies greatly overcomes direct links. Its cancellation based on non-linear Tomlinson-Harashima Precoding (THP) proved to show significant advantage over standard linear precoding. This paper proposes a novel THP structure in which ordering of successive interference pre-cancellation can be optimized for downstream with non-cooperating receivers. The optimized scheme is compared to existing THP structure denoted as equal-rate THP which is widely adopted in wireless downlink. Structure and performance of both methods differ significantly favoring the proposed scheme. The ordering that maximizes the minimum rate (max-min fairness) for each tone of the discrete multi-tone modulation is the familiar V-BLAST ordering. However, V-BLAST does not lead to the global maximum when applied independently on each tone. The proposed novel Dynamic Ordering (DO) strategy takes into account asymmetric channel statistics to yield the highest minimum aggregated rate.

Connected through hyperedge HE-1 (induced by source paper "non orthogonal embb urllc radio access for cloud radio access networks with analog fronthauling"):
  with members:
    - "coexistence of urllc and embb services in the c ran uplink an information theoretic study"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "network slicing based 5g and future mobile networks mobility resource management and challenges"
    - "on the transport capability of lan cables in all analog mimo roc fronthaul"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "joint scheduling of urllc and embb traffic in 5g wireless networks"
    - "non orthogonal multiple access in multi cell networks theory performance and practical challenges"
    - "the dispersion of nearest neighbor decoding for additive non gaussian channels"

Connected through hyperedge HE-2 (induced by source paper "signal processing for gigabit rate wireline communications"):
  with members:
    - "deep lms for gigabit transmission over unshielded twisted pair cables"
    - "fifty years of mimo detection the road to large scale mimos"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "finite word length effects on transmission rate in zero forcing linear precoding for multichannel dsl"

Connected through hyperedge HE-3 (induced by source paper "on the transport capability of lan cables in all analog mimo roc fronthaul"):
  with members:
    - "five disruptive technology directions for 5g"

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)