{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AJ3XOPGRAMU5BJBYQO344H4IOZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"95a09b9daf644171ee5103085da1883972e240428395f7782c73aac19ff2a514","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T15:02:16Z","title_canon_sha256":"e31e9f006a1c2517fef2f412984eb21274c3e86a9c9509427e611d79170ad90e"},"schema_version":"1.0","source":{"id":"2605.16027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16027","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16027v1","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16027","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"AJ3XOPGRAMU5","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_16","alias_value":"AJ3XOPGRAMU5BJBY","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_8","alias_value":"AJ3XOPGR","created_at":"2026-05-20T00:01:49Z"}],"graph_snapshots":[{"event_id":"sha256:a5630ad3afb504d0d601feded31d863419d35cde16d63ce4a2a33a10fe2ac3bd","target":"graph","created_at":"2026-05-20T00:01:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that the usual rates of convergence can be achieved with minimal assumptions on the covariate supports. These assumptions are replaced with conditions on the source and target distributions, among which a measure of the transferability between the two probability measures."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"A finite transferability measure exists between the source and target probability measures that is sufficient to control the bias and variance terms arising in the nearest-neighbour estimator."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Nearest-neighbour matching achieves usual convergence rates under general transferability conditions on source-target distribution pairs, relaxing compact support and bounded density assumptions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Nearest-neighbour matching achieves usual convergence rates on unbounded supports via a transferability measure between source and target distributions."}],"snapshot_sha256":"404fe5f33575537a8a01389920db7a26d88f32ee39dea0efb3c01af02cd66cd9"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"effd4e960a2b89e6f025abfdc33ccdc9bea585703f7a42a0f3f42b05b1124b26"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:01:33.547989Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.990802Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:42.153567Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.546334Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16027/integrity.json","findings":[],"snapshot_sha256":"66097df739bc8543d634bea7059eef7378da8245c0e9ba1ef0cd6eb5be16a808","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Expectations of multivariate functions with missing labels occur in various fields such as transfer learning and average treatment effects. Although non-parametric estimators based on nearest-neighbour matching are frequently used in this context, the existing literature assumes that the covariates live in some well-shaped compact subset of $\\R^d$, with densities that are bounded away from zero. In this paper, we show that the usual rates of convergence can be achieved with minimal assumptions on the covariate supports. These assumptions are replaced with conditions on the source and target di","authors_text":"Simon Viel","cross_cats":["stat.TH"],"headline":"Nearest-neighbour matching achieves usual convergence rates on unbounded supports via a transferability measure between source and target distributions.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T15:02:16Z","title":"Nearest-Neighbour Matching on Unbounded Supports and Covariate Shift Transfer"},"references":{"count":33,"internal_anchors":0,"resolved_work":33,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Convergence rate for Nearest Neighbour matching: geometry of the domain and higher-order regularity , author=. 2025 , journal=","work_id":"fdc6cd63-957d-4f53-825c-b9088271f494","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"The Annals of Statistics , volume=","work_id":"83c9dac3-5416-4dac-97e7-69363fd261bc","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Journal of Machine Learning Research , volume=","work_id":"ed06d104-a97d-456f-85ed-a76f005e56d0","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Large sample properties of matching estimators for average treatment effects , author=. Econometrica , volume=","work_id":"88700ca9-92d4-4b55-9686-33a98147a643","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"On the failure of the bootstrap for matching estimators , author=. Econometrica , volume=","work_id":"0ad2c67e-1eb4-4be0-bff0-cd22770457c9","year":null}],"snapshot_sha256":"acd2993ed49accf5ab286914208157e4dfc4e13162f95cd4183c9fb4777d9bf0"},"source":{"id":"2605.16027","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:50:16.350896Z","id":"ca6a36ec-8101-4a68-a6d8-5696d199b70c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Nearest-neighbour matching achieves usual convergence rates under general transferability conditions on source-target distribution pairs, relaxing compact support and bounded density assumptions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Nearest-neighbour matching achieves usual convergence rates on unbounded supports via a transferability measure between source and target distributions.","strongest_claim":"We show that the usual rates of convergence can be achieved with minimal assumptions on the covariate supports. These assumptions are replaced with conditions on the source and target distributions, among which a measure of the transferability between the two probability measures.","weakest_assumption":"A finite transferability measure exists between the source and target probability measures that is sufficient to control the bias and variance terms arising in the nearest-neighbour estimator."}},"verdict_id":"ca6a36ec-8101-4a68-a6d8-5696d199b70c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e1cbfbb751e4bacd2950a399cbc3e2a6de9d0ac2c612289607fac20f657aeddb","target":"record","created_at":"2026-05-20T00:01:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"95a09b9daf644171ee5103085da1883972e240428395f7782c73aac19ff2a514","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T15:02:16Z","title_canon_sha256":"e31e9f006a1c2517fef2f412984eb21274c3e86a9c9509427e611d79170ad90e"},"schema_version":"1.0","source":{"id":"2605.16027","kind":"arxiv","version":1}},"canonical_sha256":"0277773cd10329d0a43883b7ce1f887676533ded33d9a29ec281d746fd4fa30c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0277773cd10329d0a43883b7ce1f887676533ded33d9a29ec281d746fd4fa30c","first_computed_at":"2026-05-20T00:01:49.856403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:49.856403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ywv9QF9Gz3nV1kChGRHLrXsgU4pC5pCh3udE9KzyE+MW4CzeG0Pa0T84orPxh4PYtu05W9ueku8UZTOjvy6lCA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:49.856973Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1cbfbb751e4bacd2950a399cbc3e2a6de9d0ac2c612289607fac20f657aeddb","sha256:a5630ad3afb504d0d601feded31d863419d35cde16d63ce4a2a33a10fe2ac3bd"],"state_sha256":"42e094facbfeb7d53a1e42e0eb930e39567a5a0e2e1b0d7c89bd547618f0e729"}