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: "on coding for reliable communication over packet networks"
  Abstract: We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded packets. Rather, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of previously received packets. All coding and decoding operations have polynomial complexity. #R##N#We show that the scheme is capacity-achieving as long as packets received on a link arrive according to a process that has an average rate. Thus, packet losses on a link may exhibit correlation in time or with losses on other links. In the special case of Poisson traffic with i.i.d. losses, we give error exponents that quantify the rate of decay of the probability of error with coding delay. Our analysis of the scheme shows that it is not only capacity-achieving, but that the propagation of packets carrying "innovative" information follows the propagation of jobs through a queueing network, and therefore fluid flow models yield good approximations. We consider networks with both lossy point-to-point and broadcast links, allowing us to model both wireline and wireless packet networks.

Connected through hyperedge HE-1 (induced by source paper "adaptive causal network coding with feedback"):
  with members:
    - "resource allocation and harq optimization for urllc traffic in 5g wireless networks"
    - "tiny codes for guaranteeable delay"
    - "complete mdp convolutional codes"
    - "throughput maximization for delay sensitive random access communication"
    - "analysis of feedback error in automatic repeat request"
    - "low delay random linear coding over a stream"
    - "the effect of block wise feedback on the throughput delay trade off in streaming"
    - "an elias bound on the bhattacharyya distance of codes for channels with a zero error capacity"

Connected through hyperedge HE-2 (induced by source paper "adaptive causal network coding with feedback for multipath multi hop communications"):
  with members:
    - "adaptive causal network coding with feedback"
    - "tiny codes for guaranteeable delay"
    - "low delay random linear coding over a stream"
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"

Connected through hyperedge HE-3 (induced by source paper "random linear network coding on programmable switches"):
  with members:
    - "random linear network coding a free cipher"

Connected through hyperedge HE-4 (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"
    - "further results on coding for reliable communication over packet networks"

Connected through hyperedge HE-5 (induced by source paper "secure multi source multicast"):
  with members:
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "sufficiently myopic adversaries are blind"
    - "probability of partially solving random linear systems in network coding"
    - "probability of partially decoding network coded messages"
    - "can network coding bridge the digital divide in the pacific"
    - "weakly secure regenerating codes for distributed storage"
    - "network coding capacity regions via entropy functions"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-6 (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-7 (induced by source paper "decoding delay performance of random linear network coding for broadcast"):
  with members:
    - "resource allocation frameworks for network coded layered multimedia multicast services"
    - "binary systematic network coding for progressive packet decoding"
    - "rethinking the intercept probability of random linear network coding"

Connected through hyperedge HE-8 (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"
    - "further results 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)