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: "binary systematic network coding for progressive packet decoding"
  Abstract: We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional network coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve the theoretical optimal performance. Furthermore, we demonstrate that systematic network codes equipped with the proposed algorithm are good candidates for progressive packet recovery owing to their overall decoding delay characteristics.

Connected through hyperedge HE-1 (induced by source paper "on the probability of partial decoding in sparse network coding"):
  with members:
    - "reliability of broadcast communications under sparse random linear network coding"
    - "analysis and optimization of sparse random linear network coding for reliable multicast services"
    - "probability of partially decoding network coded messages"
    - "feedback based online network coding"
    - "intermediate performance of rateless codes"

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"
    - "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"
    - "network coding meets multimedia a review"

Connected through hyperedge HE-3 (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"
    - "rethinking the intercept probability of random linear network coding"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-4 (induced by source paper "analysis and optimization of sparse random linear network coding for reliable multicast services"):
  with members:
    - "resource allocation frameworks for network coded layered multimedia multicast services"
    - "lte enhancements for public safety and security communications to support group multimedia communications"
    - "ultra reliable communication in 5g wireless systems"
    - "network coding meets multimedia a review"
    - "effective delay control in online network coding"

Connected through hyperedge HE-5 (induced by source paper "on locality of generalized reed muller codes over the broadcast erasure channel"):
  with members:
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "isn t hybrid arq sufficient"
    - "novel polynomial basis and its application to reed solomon erasure codes"
    - "network coding meets tcp"

Connected through hyperedge HE-6 (induced by source paper "probability of partially solving random linear systems in network coding"):
  with members:
    - "a matroid framework for noncoherent random network communications"
    - "constant rank codes and their connection to constant dimension codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-7 (induced by source paper "performance analysis of random linear network coding in two source single relay networks"):
  with members:
    - "network coding over a noisy relay a belief propagation approach"

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)