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: "further results on coding for reliable communication over packet networks"
  Abstract: In "On Coding for Reliable Communication over Packet Networks" (Lun, Medard, and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy wireline or wireless packet networks is presented. We extend that paper's results in two ways: First, we extend the network model to allow packets received on a link to arrive according to any process with an average rate, as opposed to the assumption of Poisson traffic with i.i.d. losses that was previously made. Second, in the case of Poisson traffic with i.i.d. losses, we derive error exponents that quantify the rate at which the probability of error decays with coding delay

Connected through hyperedge HE-1 (induced by source paper "reliability of relay networks under random linear network coding"):
  with members:
    - "reliability of multicast under random linear network coding"
    - "decoding delay performance of random linear network coding for broadcast"
    - "novel performance analysis of network coded communications in single relay networks"
    - "improved bounds on the decoding failure probability of network coding over multi source multi relay networks"
    - "performance analysis of random linear network coding in two source single relay networks"
    - "network coding meets multimedia a review"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-2 (induced by source paper "reliability of multicast under random linear network coding"):
  with members:
    - "reliability of broadcast communications under sparse random linear network coding"
    - "decoding delay performance of random linear network coding for broadcast"
    - "novel performance analysis of network coded communications in single relay networks"
    - "resource allocation frameworks for network coded layered multimedia multicast services"
    - "binary systematic network coding for progressive packet decoding"
    - "optimized network coded scalable video multicasting over embms networks"
    - "performance analysis of random linear network coding in two source single relay networks"
    - "rethinking the intercept probability of random linear network coding"

Connected through hyperedge HE-3 (induced by source paper "reduced complexity sum product algorithm for decoding network codes and in network function computation"):
  with members:
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-4 (induced by source paper "decoding network codes using the sum product algorithm"):
  with members:
    - "wet paper codes and the dual distance in steganography"
    - "decoding network codes by message passing"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-5 (induced by source paper "on the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks"):
  with members:
    - "constellation mapping for physical layer network coding with m qam modulation"

Connected through hyperedge HE-6 (induced by source paper "network coding as a wimax link reliability mechanism"):
  with members:
    - "modeling network coded tcp throughput a simple model and its validation"
    - "network coding meets tcp"
    - "an efficient network coding based retransmission algorithm for wireless multicast"
    - "arq for network coding"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-7 (induced by source paper "one packet suffices highly efficient packetized network coding with finite memory"):
  with members:
    - "analyzing network coding gossip made easy"
    - "arq for network coding"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-8 (induced by source paper "throughput delay analysis of random linear network coding for wireless broadcasting"):
  with members:
    - "on coding for reliable communication over packet networks"

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)