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: "distributed multi user secret sharing"
  Abstract: A distributed secret sharing system is considered that consists of a dealer, $n$ storage nodes, and $m$ users. Each user is given access to a certain subset of storage nodes where it can download the data. The dealer wants to securely convey a specific secret $s_j$ to user $j$ via storage nodes, for $j=1,2,\dots,m$, in such a way that no user gets any information about other users' secrets in an information-theoretic sense. To this end, we propose to study protocols where the dealer encodes secrets into several secret shares and loads them into the storage nodes. Given a certain number of storage nodes we find the maximum number of users that can be served in such protocols and construct schemes that achieve this. We further define two major properties for such distributed secret sharing systems; communication complexity is defined as the total amount of data that needs to be downloaded by users in order to reconstruct their secrets; and storage overhead is defined as the total amount of data loaded by the dealer into the storage nodes normalized by the total size of secrets. The minimum possible communication complexity and a lower bound on storage overhead are characterized given any $n$ and $m$. Furthermore, we construct distributed secret sharing protocols, under certain conditions on the system parameters, that achieve the minimum communication complexity and attain the lower bound on the storage overhead thereby providing schemes that are optimal in terms of both the communication complexity and storage overhead. It is shown how to modify the proposed protocols in order to construct schemes for any set of parameters while providing a nearly optimal storage overhead.

Connected through hyperedge HE-1 (induced by source paper "threshold secure coding with shared key"):
  with members:
    - "rate compatible polar codes for wireless channels"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the gaussian multiple access wire tap channel"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "secret key generation via pulse coupled synchronization"):
  with members:
    - "convergence results on pulse coupled oscillator protocols in locally connected networks"
    - "polar coding for secret key generation"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-3 (induced by source paper "physical layer secret key generation in static environments"):
  with members:
    - "a novel millimeter wave channel simulator and applications for 5g wireless communications"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "cooperative secret key generation from phase estimation in narrowband fading channels"

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)