In this paper, we establish the second-order randomized identification capacity (RID capacity) of the Additive White Gaussian Noise Channel (AWGNC). On the one hand, we obtain a refined version of Hayashi's theorem to prove the achievability part. On the other, we investigate the relationship between identification and channel resolvability, then we propose a finer quantization method to prove the converse part. Consequently, the second-order RID capacity of the AWGNC has the same form as the second-order transmission capacity. The only difference is that the maximum number of messages in RID scales double exponentially in the blocklength.

翻译：本文建立了加性高斯白噪声信道（AWGNC）的二阶随机化识别容量（RID容量）。一方面，我们通过对林（Hayashi）定理的精细化版本证明可达性部分；另一方面，通过探究识别与信道可解性之间的关系，提出一种更精细的量化方法以证明其逆命题。由此可得，AWGNC的二阶RID容量与二阶传输容量具有相同形式，唯一区别在于RID中最大消息数随分组长度呈双指数增长。