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: "towards secure two party computation from the wire tap channel"
  Abstract: We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of binary intersecting codes or $q$-ary minimal codes, which are also studied in this paper.

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"
    - "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"

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"
    - "minimal linear codes over finite fields"
    - "long quasi polycyclic t cis codes"
    - "on self dual double circulant codes"

Connected through hyperedge HE-3 (induced by source paper "the parameters of minimal linear codes"):
  with members:
    - "two new families of two weight 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"
    - "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"
    - "minimal linear codes over finite fields"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "an inductive construction of minimal codes"):
  with members:
    - "minimal linear codes arising from blocking sets"
    - "minimal linear codes over finite fields"
    - "linear codes from some 2 designs"
    - "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:
    - "minimal linear codes over finite fields"
    - "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.CR(Cryptography and Security)