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: "the parameters of minimal linear codes"
  Abstract: Let $k\leq n$ be two positive integers and $q$ a prime power. The basic question in minimal linear codes is to determine if there exists an $[n,k]_q$ minimal linear code. The first objective of this paper is to present a new sufficient and necessary condition for linear codes to be minimal. Using this condition, it is easy to construct minimal linear codes or to prove some linear codes are minimal. The second objective of this paper is to use the new sufficient and necessary condition to partially give an answer to the basic question in minimal linear codes. The third objective of this paper is to present four classes of minimal linear codes, which generalize the results about the binary case given in [X. Li and Q. Yue, Des. Codes Cryptogr., 2019]. One can find that our method is much easier and more effective.

Connected through hyperedge HE-1 (induced by source paper "minimal linear codes constructed from functions"):
  with members:
    - "minimal linear codes from characteristic functions"
    - "minimal linear codes over finite fields"
    - "two new families of two weight codes"
    - "complete weight enumerators of a family of three weight linear codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from a generic construction"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from weakly regular bent functions"

Connected through hyperedge HE-2 (induced by source paper "full characterization of minimal linear codes as cutting blocking sets"):
  with members:
    - "an inductive construction of minimal codes"
    - "minimal linear codes arising from blocking sets"
    - "minimal linear codes from characteristic functions"
    - "minimal linear codes over finite fields"
    - "a new class of three weight linear codes from weakly regular plateaued functions"
    - "it is indeed a fundamental construction of all linear codes"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"

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)