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: "on tightness of mutual dependence upperbound for secret key capacity of multiple terminals"
  Abstract: Csiszar and Narayan[3] defined the notion of secret key capacity for multiple terminals, characterized it as a linear program with Slepian-Wolf constraints of the related source coding problem of communication for omniscience, and upper bounded it by some information divergence expression from the joint to the product distribution of the private observations. This paper proves that the bound is tight for the important case when all users are active, using the polymatroidal structure[6] underlying the source coding problem. When some users are not active, the bound may not be tight. This paper gives a counter-example in which 3 out of the 6 terminals are active.

Connected through hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact exponent for soft covering"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"
    - "strong functional representation lemma and applications to coding theorems"

Connected through hyperedge HE-2 (induced by source paper "communication for generating correlation a survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact soft covering exponent"
    - "on exact and infty r enyi common informations"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"

Connected through hyperedge HE-3 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion"):
  with members:
    - "multiterminal secret key agreement with nearly no discussion"
    - "one shot perfect secret key agreement for finite linear sources"
    - "secrecy capacity under limited discussion rate for minimally connected hypergraphical sources"
    - "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources"
    - "multiterminal secret key agreement at asymptotically zero discussion rate"
    - "secret key agreement under discussion rate constraints"
    - "compressed secret key agreement maximizing multivariate mutual information per bit"
    - "on the optimality of secret key agreement via omniscience"

Connected through hyperedge HE-4 (induced by source paper "multiterminal secret key agreement with nearly no discussion"):
  with members:
    - "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources"
    - "multiterminal secret key agreement at asymptotically zero discussion rate"
    - "secret key agreement under discussion rate constraints"
    - "compressed secret key agreement maximizing multivariate mutual information per bit"
    - "on the optimality of secret key agreement via omniscience"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
    - "secret key generation with limited interaction"
    - "info clustering a mathematical theory for data clustering"

Connected through hyperedge HE-5 (induced by source paper "part i improving computational efficiency of communication for omniscience"):
  with members:
    - "part ii a practical approach for successive omniscience"
    - "improving computational efficiency of communication for omniscience and successive omniscience"
    - "secret key agreement under discussion rate constraints"
    - "a faster algorithm for asymptotic communication for omniscience"
    - "info clustering a mathematical theory for data clustering"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "efficient algorithms for the data exchange problem"
    - "coded cooperative data exchange in multihop networks"

Connected through hyperedge HE-6 (induced by source paper "part ii a practical approach for successive omniscience"):
  with members:
    - "part i improving computational efficiency of communication for omniscience"
    - "attaining fairness in communication for omniscience"
    - "improving computational efficiency of communication for omniscience and successive omniscience"
    - "successive local and successive global omniscience"
    - "a practical approach for successive omniscience"
    - "universal multiparty data exchange and secret key agreement"
    - "a faster algorithm for asymptotic communication for omniscience"
    - "iterative merging algorithm for cooperative data exchange"

Connected through hyperedge HE-7 (induced by source paper "attaining fairness in communication for omniscience"):
  with members:
    - "a faster algorithm for asymptotic communication for omniscience"
    - "fairest constant sum rate transmission for cooperative data exchange an m convex minimization approach"
    - "structured convex optimization under submodular constraints"
    - "coded cooperative data exchange in multihop networks"
    - "on coding for cooperative data exchange"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-8 (induced by source paper "improving computational efficiency of communication for omniscience and successive omniscience"):
  with members:
    - "a practical approach for successive omniscience"
    - "a faster algorithm for asymptotic communication for omniscience"
    - "iterative merging algorithm for cooperative data exchange"
    - "efficient algorithms for the data exchange problem"
    - "coded cooperative data exchange in multihop networks"
    - "on coding for cooperative data exchange"

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)