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: "delivery time reduction for order constrained applications using binary network codes"
  Abstract: Consider a radio access network wherein a base-station is required to deliver a set of order-constrained messages to a set of users over independent erasure channels. This paper studies the delivery time reduction problem using instantly decodable network coding (IDNC). Motivated by time-critical and order-constrained applications, the delivery time is defined, at each transmission, as the number of undelivered messages. The delivery time minimization problem being computationally intractable, most of the existing literature on IDNC propose sub-optimal online solutions. This paper suggests a novel method for solving the problem by introducing the delivery delay as a measure of distance to optimality. An expression characterizing the delivery time using the delivery delay is derived, allowing the approximation of the delivery time minimization problem by an optimization problem involving the delivery delay. The problem is, then, formulated as a maximum weight clique selection problem over the IDNC graph wherein the weight of each vertex reflects its corresponding user and message's delay. Simulation results suggest that the proposed solution achieves lower delivery and completion times as compared to the best-known heuristics for delivery time reduction.

Connected through hyperedge HE-1 (induced by source paper "a tutorial on clique problems in communications and signal processing"):
  with members:
    - "eptas for max clique on disks and unit balls"
    - "enhanced uplink resource allocation in non orthogonal multiple access systems"
    - "discovering patterns of interest in ip traffic using cliques in bipartite link streams"
    - "data dissemination using instantly decodable binary codes in fog radio access networks"
    - "on multiaspect graphs"
    - "distributed hybrid scheduling in multi cloud networks using conflict graphs"
    - "resilient backhaul network design using hybrid radio free space optical technology"
    - "rate aware instantly decodable network codes"

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)