AI 中文总结
针对昂贵黄金结果与廉价辅助观测的系统，提出RCShift方法，通过精确、近似和整数三种模式认证部分记录链接存储的充分性，在有限样本决策下平衡成本与精度，实现决策校准的测量设计。
AI 中文摘要
在黄金结果成本高昂而辅助观测成本较低的系统里，必须决定保留多少记录链接。完全配对保留每一个联合计数，而分离边际则不保留任何联合计数。这两种极端情况都未针对声明的有限样本决策进行校准。通用重构可以保留似然比族无法观测到的循环方向。族精确存储可能超出决策所需，因为经过认证的残差损失可能适合有限样本的容差范围。我们引入RCShift，它在声明的观测契约下认证两条通向充分性的路径。其精确模式通过似然比可见的循环方向刻画最小成本的族精确存储。其近似模式界定了反向Le Cam缺陷。其整数模式认证所选集合在指定规模和功效下是否保留完整实验的最小整数记录数。在秩二见证中，一个对齐计数器保留四条记录的最小值。一个等成本错位计数器和边际需要十一条记录，而通用重构需要两个计数器。一个局部扰动具有正的反向缺陷，但仍保留四条记录的最小值。经过证明校验的调度界限在黄金计算之前实例化契约，并在接受的树支撑上产生精确重构。RCShift将部分链接存储转化为针对声明族、成本、目标和常见严格正支撑的决策校准测量设计。
英文摘要
Systems with costly gold outcomes and cheaper auxiliary observations must decide how much record linkage to retain. Complete pairing retains every joint counter, while separate margins retain none. Neither endpoint is calibrated to a declared finite-sample decision. Universal reconstruction can retain cycle directions invisible to the likelihood-ratio family. Family-exact storage can exceed what the decision requires because certified residual loss may fit within finite-sample slack. We introduce RCShift, which certifies two routes to sufficiency under a declared observation contract. Its exact mode characterizes minimum-cost family-exact storage through LR-visible cycle directions. Its approximate mode bounds reverse Le Cam deficiency. Its integer mode certifies whether a chosen set preserves the full experiment's minimum integer record count at specified size and power. In a rank-two witness, one aligned counter preserves a four-record minimum. An equal-cost misaligned counter and the margins require eleven records, while universal reconstruction requires two counters. A local perturbation has positive reverse deficiency yet retains the four-record minimum. Proof-checked scheduling bounds instantiate the contract before gold computation and yield exact reconstruction on the admitted tree support. RCShift turns partial-linkage storage into decision-calibrated measurement design for the declared family, costs, target, and common strictly positive support.
