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 "optimality of network coding in packet networks"):
  Abstract: We resolve the question of optimality for a well-studied packetized implementation of random linear network coding, called PNC. In PNC, in contrast to the classical memoryless setting, nodes store received information in memory to later produce coded packets that reflect this information. PNC is known to achieve order optimal stopping times for the many-to-all multicast problem in many settings. #R##N#We give a reduction that captures exactly how PNC and other network coding protocols use the memory of the nodes. More precisely, we show that any such protocol implementation induces a transformation which maps an execution of the protocol to an instance of the classical memoryless setting. This allows us to prove that, for any (non-adaptive dynamic) network, PNC converges with high probability in optimal time. In other words, it stops at exactly the first time in which in hindsight it was possible to route information from the sources to each receiver individually. #R##N#Our technique also applies to variants of PNC, in which each node uses only a finite buffer. We show that, even in this setting, PNC stops exactly within the time in which in hindsight it was possible to route packets given the memory constraint, i.e., that the memory used at each node never exceeds its buffer size. This shows that PNC, even without any feedback or explicit memory management, allows to keep minimal buffer sizes while maintaining its capacity achieving performance.

Includes members:
  Member "one packet suffices highly efficient packetized network coding with finite memory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure multi source multicast")
  Member "analyzing network coding gossip made easy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "synchronous transmissions in low power wireless a survey of communication protocols and network services")
  Member "algebraic gossip on arbitrary networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analyzing network coding gossip made easy")
  Member "arq for network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tiny codes for guaranteeable delay")
  Member "efficient operation of coded packet networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "congestion control and routing over challenged networks")
  Member "on coding for reliable communication over packet networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adaptive causal network coding with feedback")

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)