{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UV532JBZ3APPBPO7WYPZJ3CBRY","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":"31dd38f0dd774c7b3515af9d4819a1283c7616fa54f19bde95cb3af91e3e3fc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T06:39:36Z","title_canon_sha256":"4af3475c19f0123bf07fc82df00131d750b0cda969b06ed8510a37e270c5159e"},"schema_version":"1.0","source":{"id":"2605.14444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14444","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14444v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14444","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"UV532JBZ3APP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"UV532JBZ3APPBPO7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"UV532JBZ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:7f88f2ea2fc8b6d69fefc95bf49083d68e3d962e863f7b740a42a64eda582f3e","target":"graph","created_at":"2026-05-17T23:39:06Z","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":"the row-sum method achieves exact recovery under a broader range of dimensional scalings. In particular, when the dimension is comparable to the sample size, exact recovery is possible even when the inlier fraction vanishes, with the number of inliers as small as order √n, up to logarithmic factors."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The inlier recovery guarantees rely on the Gram-matrix overlap producing a sufficiently structured signal that separates inliers from outliers, which implicitly assumes specific statistical models for noise and outlier distribution that are not detailed in the abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Gram-matrix overlap turns inlier identification into a structured recovery problem, enabling exact recovery with as few as order sqrt(n) inliers when dimension matches sample size."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The row-sum method recovers exact inlier matches from Gram-matrix overlaps even when inliers drop to order sqrt(n) and their fraction vanishes."}],"snapshot_sha256":"4334fefd3ba54ccaded40af6de1fc219ef9c5d138ccc18bc71513f40a45e6251"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Robust point-set registration in the presence of noise and outliers is challenging because the matched points (inliers) must be identified before reliable alignment can be performed. Existing robust registration methods typically optimize over the transformation space and are often designed for regimes with a nonvanishing fraction of inliers. In this paper, we study the inlier recovery problem arising in robust registration by comparing two datasets through the Hadamard product of their Gram matrices. This formulation converts the inlier identification into a structured recovery problem and av","authors_text":"Ruizi Wu, Wanjie Wang, YueHaw Khoo","cross_cats":[],"headline":"The row-sum method recovers exact inlier matches from Gram-matrix overlaps even when inliers drop to order sqrt(n) and their fraction vanishes.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T06:39:36Z","title":"Inlier Recovery for Robust Registration via Gram-Matrix Overlap"},"references":{"count":29,"internal_anchors":1,"resolved_work":29,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Finding a large hidden clique in a random graph.Random Structures & Algorithms, 13(3–4):457–466, 1998","work_id":"317afa88-a0e4-4153-a234-e7ba901e6497","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Community detection in dense random networks.The Annals of Statistics, 42(3):940–969, 2014","work_id":"1c7a40dc-ded3-4260-b9da-ba46706922ff","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"K. S. Arun, T. S. Huang, and S. D. Blostein. Least-squares fitting of two 3-d point sets.IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-9(5):698–700, 1987","work_id":"362a34f8-d6fa-484d-baae-0467090ef190","year":1987},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Maximizing robustness of point-set registration by leveraging non-convexity.arXiv preprint arXiv:2004.08772, 2020","work_id":"0c69ac8c-6db5-4039-9139-2621dedca311","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jos´ e Neira, Ian Reid, and John J. Leonard. Past, present, and future of simultaneous localization and mapping: Toward the ","work_id":"e1a0e40a-bbdb-474d-ab62-fe4c3f5cc9eb","year":2016}],"snapshot_sha256":"1f653279628b65c5251fd5d7f2a3e55a8f5fba808b048a0d2067e4c329206099"},"source":{"id":"2605.14444","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:01:34.869079Z","id":"2a8aef02-5271-49f4-a25c-854ddb42cf92","model_set":{"reader":"grok-4.3"},"one_line_summary":"Gram-matrix overlap turns inlier identification into a structured recovery problem, enabling exact recovery with as few as order sqrt(n) inliers when dimension matches sample size.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The row-sum method recovers exact inlier matches from Gram-matrix overlaps even when inliers drop to order sqrt(n) and their fraction vanishes.","strongest_claim":"the row-sum method achieves exact recovery under a broader range of dimensional scalings. In particular, when the dimension is comparable to the sample size, exact recovery is possible even when the inlier fraction vanishes, with the number of inliers as small as order √n, up to logarithmic factors.","weakest_assumption":"The inlier recovery guarantees rely on the Gram-matrix overlap producing a sufficiently structured signal that separates inliers from outliers, which implicitly assumes specific statistical models for noise and outlier distribution that are not detailed in the abstract."}},"verdict_id":"2a8aef02-5271-49f4-a25c-854ddb42cf92"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:48051d529ca854f279c381414696a5c3490f6a2f447142efc7063e691958c198","target":"record","created_at":"2026-05-17T23:39:06Z","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":"31dd38f0dd774c7b3515af9d4819a1283c7616fa54f19bde95cb3af91e3e3fc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T06:39:36Z","title_canon_sha256":"4af3475c19f0123bf07fc82df00131d750b0cda969b06ed8510a37e270c5159e"},"schema_version":"1.0","source":{"id":"2605.14444","kind":"arxiv","version":1}},"canonical_sha256":"a57bbd2439d81ef0bddfb61f94ec418e2738092bcf7e41b72862698080ac62cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a57bbd2439d81ef0bddfb61f94ec418e2738092bcf7e41b72862698080ac62cb","first_computed_at":"2026-05-17T23:39:06.978891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:06.978891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MRZbSjscEq9/SvSOgVEJ/zfhgMvaut13NSm3Ijr9QwH1/41LYaHPuFW57BbYD7LlcN6TVHPtcHBuHcrZ9qjOCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:06.979715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48051d529ca854f279c381414696a5c3490f6a2f447142efc7063e691958c198","sha256:7f88f2ea2fc8b6d69fefc95bf49083d68e3d962e863f7b740a42a64eda582f3e"],"state_sha256":"bff5a31fcd64eb520f736f9e43225c8314af51197431e60381480e83f69cde0c"}