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: "construction algorithm for network error correcting codes attaining the singleton bound"
  Abstract: We give a centralized deterministic algorithm for constructing linear network error-correcting codes that attain the Singleton bound of network error-correcting codes. The proposed algorithm is based on the algorithm by Jaggi et al. We give estimates on the time complexity and the required symbol size of the proposed algorithm. We also estimate the probability of a random choice of local encoding vectors by all intermediate nodes giving a network error-correcting codes attaining the Singleton bound. We also clarify the relationship between the robust network coding and the network error-correcting codes with known locations of errors.

Connected through hyperedge HE-1 (induced by source paper "adversarial network coding"):
  with members:
    - "equivalence for networks with adversarial state"
    - "multiple access network information flow and correction codes"
    - "polytope codes against adversaries in networks"
    - "on metrics for error correction in network coding"
    - "adversarial models and resilient schemes for network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (induced by source paper "a matroidal framework for network error correcting codes"):
  with members:
    - "refined coding bounds and code constructions for coherent network error correction"
    - "scalar linear solvability of matroidal networks associated with representable matroids"
    - "network error correction with unequal link capacities"

Connected through hyperedge HE-3 (induced by source paper "refined coding bounds and code constructions for coherent network error correction"):
  with members:
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-4 (induced by source paper "network codes resilient to jamming and eavesdropping"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "universal secure error correcting schemes for network coding"
    - "on wiretap networks ii"
    - "a rank metric approach to error control in random network coding"
    - "security for wiretap networks via rank metric codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-5 (induced by source paper "construction of network error correction codes in packet networks"):
  with members:
    - "refined coding bounds and code constructions for coherent network error correction"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "network error correcting codes using small fields"):
  with members:
    - "refined coding bounds and code constructions for coherent network error correction"
    - "construction of network error correction codes in packet networks"
    - "wireless network information flow"

Connected through hyperedge HE-7 (induced by source paper "on metrics for error correction in network coding"):
  with members:
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-8 (induced by source paper "block network error control codes and syndrome based complete maximum likelihood decoding"):
  with members:
    - "coding for errors and erasures in random network coding"

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)