human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast"):
  Abstract: We consider broadcasting a block of packets to multiple wireless receivers under random packet erasures using instantly decodable network coding (IDNC). The sender first broadcasts each packet uncoded once, then generates coded packets according to receivers’ feedback about their missing packets. We focus on strict IDNC (S-IDNC), where each coded packet includes at most one missing packet of every receiver. But, we will also study its relation with generalized IDNC (G-IDNC), where this condition is relaxed. We characterize two fundamental performance limits of S-IDNC: (1) the number of transmissions to complete the broadcast, which measures throughput and (2) average packet decoding delay, which measures how fast each packet is decoded at each receiver on average. We derive a closed-form expression for the expected minimum number of transmissions in terms of the number of packets and receivers and the erasure probability. We prove that it is NP-hard to minimize the average packet decoding delay of S-IDNC. We also prove that the graph models of S- and G-IDNC share the same chromatic number. Next, we design efficient S-IDNC transmission schemes and coding algorithms with full/intermittent receiver feedback. We present simulation results to corroborate the developed theory and compare our schemes with existing ones.

Includes members:
  Member "content aware instantly decodable network coding over wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "device to device networking meets cellular via network coding")
  Member "coding opportunity densification strategies for instantly decodable network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "completion delay minimization for instantly decodable network codes")
  Member "throughput delay analysis of random linear network coding for wireless broadcasting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "delay complexity trade off of random linear network coding in wireless broadcast")
  Member "broadcasting in time division duplexing a random linear network coding approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks")
  Member "effective delay control in online network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reliability of multicast under random linear network coding")
  Member "informed network coding for minimum decoding delay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks")
  Member "arq for network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tiny codes for guaranteeable delay")

Question: Please tell me which class the source paper 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)