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: "informed network coding for minimum decoding delay"
  Abstract: Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become problematic for delay-sensitive applications such as real-time media streaming. Motivated by this observation, we consider several algorithms that minimize the decoding delay and analyze their performance by means of simulation. The algorithms differ both in the required information about the state of the neighborspsila buffers and in the way this knowledge is used to decide which packets to combine through coding operations. Our results show that a greedy algorithm, whose encodings maximize the number of nodes at which a coded packet is immediately decodable significantly outperforms existing network coding protocols.

Connected through hyperedge HE-1 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks"):
  with members:
    - "on coding for cooperative data exchange"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "random linear network coding for time division duplexing when to stop talking and start listening"
    - "random linear network coding a free cipher"
    - "opportunistic network coding for video streaming over wireless"

Connected through hyperedge HE-2 (induced by source paper "on the packet decoding delay of linear network coded wireless broadcast"):
  with members:
    - "performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast"
    - "on deterministic linear network coded broadcast and its relation to matroid theory"
    - "completion delay minimization for instantly decodable network codes"
    - "on coding for cooperative data exchange"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-3 (induced by source paper "performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast"):
  with members:
    - "content aware instantly decodable network coding over wireless networks"
    - "coding opportunity densification strategies for instantly decodable network coding"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "effective delay control in online network coding"
    - "arq for network coding"

Connected through hyperedge HE-4 (induced by source paper "coded retransmission in wireless networks via abstract mdps theory and algorithms"):
  with members:
    - "arq for network coding"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (induced by source paper "on minimizing the average packet decoding delay in wireless network coded broadcast"):
  with members:
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "effective delay control in online network coding"

Connected through hyperedge HE-6 (induced by source paper "distributed rate allocation in inter session network coding"):
  with members:
    - "decoding delay minimization in inter session network coding"
    - "network coding meets multimedia a review"
    - "network coding for multiple unicasts an interference alignment approach"

Connected through hyperedge HE-7 (induced by source paper "on improving the balance between the completion time and decoding delay in instantly decodable network coded systems"):
  with members:
    - "instantly decodable versus random linear network coding a comparative framework for throughput and decoding delay performance"
    - "completion delay minimization for instantly decodable network codes"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"

Connected through hyperedge HE-8 (induced by source paper "from instantly decodable to random linear network coding"):
  with members:
    - "on throughput and decoding delay performance of instantly decodable network coding"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"

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)