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: "minimal linear codes over finite fields"
  Abstract: As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that $w_{\min}/w_{\max}> (q-1)/q$ is a sufficient condition for a linear code over the finite field $\gf(q)$ to be minimal, where $q$ is a prime power, $w_{\min}$ and $w_{\max}$ denote the minimum and maximum nonzero weights in the code, respectively. The first objective of this paper is to present a sufficient and necessary condition for linear codes over finite fields to be minimal. The second objective of this paper is to construct an infinite family of ternary minimal linear codes satisfying $w_{\min}/w_{\max}\leq 2/3$. To the best of our knowledge, this is the first infinite family of nonbinary minimal linear codes violating Ashikhmin and Barg's condition.

Connected through hyperedge HE-1 (induced by source paper "minimal linear codes constructed from functions"):
  with members:
    - "the parameters of minimal linear codes"
    - "minimal linear codes from characteristic functions"
    - "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 "a geometric characterization of minimal codes and their asymptotic performance"):
  with members:
    - "an inductive construction of minimal codes"
    - "minimal linear codes arising from blocking sets"
    - "full characterization of minimal linear codes as cutting blocking sets"
    - "group codes over fields are asymptotically good"
    - "several classes of minimal linear codes with few weights from weakly regular plateaued functions"
    - "long quasi polycyclic t cis codes"
    - "on self dual double circulant codes"
    - "linear codes from some 2 designs"

Connected through hyperedge HE-3 (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"
    - "the parameters of minimal linear codes"
    - "minimal linear codes from characteristic functions"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "minimal linear codes from characteristic functions"):
  with members:
    - "minimal linear codes arising from blocking sets"
    - "euclidean and hermitian lcd mds codes"
    - "complementary dual algebraic geometry codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "towards secure two party computation from the wire tap channel"

Connected through hyperedge HE-5 (induced by source paper "an inductive construction of minimal codes"):
  with members:
    - "minimal linear codes arising from blocking sets"
    - "linear codes from some 2 designs"
    - "towards secure two party computation from the wire tap channel"
    - "secret sharing with a class of minimal linear codes"

Connected through hyperedge HE-6 (induced by source paper "minimal linear codes arising from blocking sets"):
  with members:
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "towards secure two party computation from the wire tap channel"

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)