让下一篇重要论文，不再错过。

原文摘要

We give a unified framework for one-sided testability (constant-query testing) of metric families. For a broad class of families defined by fixed local predicates, we prove that testability is equivalent to two structural properties: \emph{packing amplification}, which turns many edge-disjoint local violations into a positive density of violations, and \emph{completion stability}, which allows locally consistent partial matrices with few missing entries to be cheaply completed. This characterization yields a common proof strategy and simpler proofs of classical testability results for ultrametrics, tree pseudometrics, Euclidean pseudometrics in fixed dimension, and several others. Our framework also gives new quantitative bounds for metric testing: a nonadaptive one-sided upper bound for matrices with entries in the bounded range $[1,C]$, and two-sided nonadaptive and adaptive lower bounds for general metrics.