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: "wiretap channels implications of the more capable condition and cyclic shift symmetry"
  Abstract: Characterization of the rate-equivocation region of a general wiretap channel involves two auxiliary random variables: U, for rate splitting and V, for channel prefixing. Evaluation of regions involving auxiliary random variables is generally difficult. In this paper, we explore specific classes of wiretap channels for which the expression and evaluation of the rate-equivocation region are simpler. In particular, we show that when the main channel is more capable than the eavesdropping channel, V=X is optimal and the boundary of the rate-equivocation region can be achieved by varying U alone. Conversely, we show under a mild condition that if the main receiver is not more capable, then V=X is strictly suboptimal. Next, we focus on the class of cyclic shift symmetric wiretap channels. We explicitly determine the optimal selections of rate splitting U and channel prefixing V that achieve the boundary of the rate-equivocation region. We show that optimal U and V are determined via cyclic shifts of the solution of an auxiliary optimization problem that involves only one auxiliary random variable. In addition, we provide a sufficient condition for cyclic shift symmetric wiretap channels to have U=\phi as an optimal selection. Finally, we apply our results to the binary-input cyclic shift symmetric wiretap channels. We solve the corresponding constrained optimization problem by inspecting each point of the I(X;Y)-I(X;Z) function. We thoroughly characterize the rate-equivocation regions of the BSC-BEC and BEC-BSC wiretap channels. In particular, we find that U=\phi is optimal and the boundary of the rate-equivocation region is achieved by varying V alone for the BSC-BEC wiretap channel.

Connected through hyperedge HE-1 (induced by source paper "alignment of polarized sets"):
  with members:
    - "polar codes for broadcast channels"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "universal polar codes"
    - "on the construction of polar codes"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of the binary adversarial wiretap channel"):
  with members:
    - "sufficiently myopic adversaries are blind"
    - "semantic security capacity for wiretap channels of type ii"
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-3 (induced by source paper "polar coding for the general wiretap channel"):
  with members:
    - "polar codes for broadcast channels"
    - "polar codes for distributed hierarchical source coding"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "polar coding for interference networks"
    - "efficient one way secret key agreement and private channel coding via polarization"

Connected through hyperedge HE-4 (induced by source paper "broadcast channels with confidential messages by randomness constrained stochastic encoder"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "on secure communication with constrained randomization"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "capacity results for relay channels with confidential messages"
    - "3 receiver broadcast channels with common and confidential messages"
    - "capacity regions of two new classes of 2 receiver broadcast channels"
    - "secure multiplex coding to attain the channel capacity in wiretap 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)