{"as_of":"2026-08-10T06:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41efbcf4f19583f926562da3e833efaec3a1db75efd763688f6736917080fbd2","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T13:11:04.031819Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.02163/citation-record","integrity":"/paper/2502.02163/integrity","json":"/paper/2502.02163/citation-record.json","paper":"/paper/2502.02163"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.829010Z","title":"Spinnet: Learning a general surface descrip- tor for 3d point cloud registration","venue":null,"work_id":"c3ac8a40-11db-4155-9424-0e8f76813009","year":2021},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.844839Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:359ee7a891755b7632a0fc0615792fe9e18a275ab4116c683a917ab65982c3de","observation_id":"46b6b6b0-e3f1-44e6-85ad-7709f921220c","resolution":{"observed_at":"2026-08-09T13:11:04.832648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.818340Z","title":"Buffer: Balancing accuracy, efficiency, and general- izability in point cloud registration","venue":null,"work_id":"96dcda52-b428-48e5-a6c1-37f978da5297","year":2023},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.848589Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:14963279b20e0ec109feeaaa23fb999e5cae2a19b51bb43fdacab1ca7179de0e","observation_id":"6173317f-500c-4bb4-80d3-cb88af4c8c70","resolution":{"observed_at":"2026-08-09T13:11:04.822054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.807512Z","title":"Pointdsc: Robust point cloud registration using deep spatial consistency","venue":null,"work_id":"4e215212-0f42-4da5-8b8c-ba6855fb77a3","year":2021},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.851661Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:155baa7bf0458ad2c0b24ff3d604c109b4c74a5fc15e9c9c9aff7f3c26a05eed","observation_id":"48ae6c99-3a5f-4f04-8b2d-2e74f23db7d9","resolution":{"observed_at":"2026-08-09T13:11:04.811296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.796549Z","title":"Graph-cut ransac","venue":null,"work_id":"0af99e8a-dfd2-4885-ba59-1d0fb588579b","year":2018},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.854845Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:583eff9c85db6bbde367a15e138c46f1526b78429d7ab9d3a5cd549f4ba17005","observation_id":"215f8f46-490b-46b7-baf8-e6abb198317d","resolution":{"observed_at":"2026-08-09T13:11:04.800432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.783686Z","title":"Space-partitioning ransac","venue":null,"work_id":"68ec6801-542f-42c3-b540-37354b90d7f1","year":2022},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.857958Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:a1800c0b603583d5f88c5f25d09136b6e48660170ca72459320a4c97f3f53b90","observation_id":"a1e3d492-ae97-4d5b-8eb0-96159dc434b7","resolution":{"observed_at":"2026-08-09T13:11:04.787944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.772247Z","title":"Sc2- pcr: A second order spatial compatibility for efficient and ro- bust point cloud registration","venue":null,"work_id":"b3681e8f-73ab-4d88-9e5d-ddb0f76433fc","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.861066Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:0710e8a5774e4b24844732cbbd7f30e8ddd8f7ff9d03f32034c98e5e719e773d","observation_id":"f7954d4d-4158-425a-98ef-2f53532a0012","resolution":{"observed_at":"2026-08-09T13:11:04.776411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.748980Z","title":"Sc2-pcr++: Rethinking the generation and selection for effi- cient and robust point cloud registration.IEEE TPAMI, 2023","venue":null,"work_id":"23da9a2c-83df-4a27-bb51-f606d6ea2989","year":2023},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.867672Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:a6a30ee42c2c8f8ef73aef85623aa823b0da143144c5059633322b6c6919a4e2","observation_id":"6ffcd82e-1e26-44cf-8f6e-960bfcb63424","resolution":{"observed_at":"2026-08-09T13:11:04.752785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.737049Z","title":"Fully convolutional geometric features","venue":null,"work_id":"a35b7f9c-0a95-40d2-8a13-96f58776b7dd","year":2019},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.871030Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:e3cbf0f191cb062c9552114f24a7db4cf7aa6565b0316e412bcb0ec0a5528b8f","observation_id":"8842bffe-4c8c-4637-9046-8ce99613d963","resolution":{"observed_at":"2026-08-09T13:11:04.741066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.725435Z","title":"Deep global registration","venue":null,"work_id":"234394b0-7303-4867-a201-4ef4c9361d52","year":2020},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.874050Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:77566832e7ef4c63eb783ae428ae9811223fcb2670d8ed2e3fa92e6bb6010ef2","observation_id":"eec5b714-6716-40ed-8313-95d47352069e","resolution":{"observed_at":"2026-08-09T13:11:04.728932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.714566Z","title":"Point signatures: A new representation for 3d object recognition","venue":null,"work_id":"9195f6b1-3727-493a-b030-b63cb8dd510e","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.877048Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:d9febafeff796a9570e9f619fcbfbfa193732b002bb2b5cf2f8f516244a90081","observation_id":"f7ec2046-c1ae-4d63-a956-a608aedcdb06","resolution":{"observed_at":"2026-08-09T13:11:04.718624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.703805Z","title":"Optimal randomized ransac","venue":null,"work_id":"3fb4a15f-2536-4647-bb2a-44daefa7c2b8","year":2008},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.880436Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:5c72450dd7f516521441894672d8be169193b39d3c4edb8a5e385c49b3203b2d","observation_id":"af24da97-c77a-464b-b314-bff091724d4b","resolution":{"observed_at":"2026-08-09T13:11:04.707633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.690518Z","title":"Listing all maximal cliques in sparse graphs in near-optimal time","venue":null,"work_id":"36b2fb8f-f892-46f6-b29a-9edd3971cd28","year":2010},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.883581Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:0b0029e8e5bfc3b9775877245ef5c1297629e996268ee407a88f452f84b43b1c","observation_id":"bf8df32a-44c6-4806-b9f2-67b927967367","resolution":{"observed_at":"2026-08-09T13:11:04.694386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.678737Z","title":"Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography","venue":null,"work_id":"598dd3ad-93ce-48cc-b040-7fb8274f5f67","year":1981},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.887876Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:91a650975bbb859f38747f0290b9a2ff15fb2e3352a99d13ec3892286997b56d","observation_id":"48b1640e-02ca-46c5-915e-13b33dcf0959","resolution":{"observed_at":"2026-08-09T13:11:04.683041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.667008Z","title":null,"venue":null,"work_id":"15f15e8b-d281-44dd-8b53-c4180962ff67","year":1989},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.891534Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:47b5b0a4af4c9d895cef18c652cc0c9e621ecc768774fa47c2d3871daa39467d","observation_id":"219fe642-5f74-47ff-bf49-fabcf9ebbbc7","resolution":{"observed_at":"2026-08-09T13:11:04.671119Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.655600Z","title":"Are we ready for autonomous driving? the kitti vision benchmark suite","venue":null,"work_id":"11cc584d-5213-4cf6-a5c4-7e257239e9b5","year":2012},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.895184Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:44e7303a16b66e2f0b1d5d4d7304f1cb5c017eb7ae3e15cbf41cefb2ff506101","observation_id":"dd573198-69c6-4e8e-90a8-1dbb646bfe26","resolution":{"observed_at":"2026-08-09T13:11:04.660030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.644902Z","title":"Wegner, and Andreas Wieser","venue":null,"work_id":"367d91da-d90d-407d-bc74-aa99d76109d7","year":2019},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.898750Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:cabdc255b7fdb80b76a0ef5e9b6d5306b0b38a6289c6722337400a6a2b4efec8","observation_id":"9e465772-1414-4353-a458-d314016640e3","resolution":{"observed_at":"2026-08-09T13:11:04.648718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.633100Z","title":"Rotational projection statistics for 3d local surface description and object recognition","venue":null,"work_id":"325d2b45-7c33-499c-b2c4-4d806ecd0266","year":2013},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.901908Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:fdb7bf057a3a15053e83c67fdc56fd613909fb6012bff7421838029e62997232","observation_id":"26f7a449-d4c1-4174-9609-6e576d2484ce","resolution":{"observed_at":"2026-08-09T13:11:04.637265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.621681Z","title":"Randla-net: Efficient semantic segmentation of large-scale point clouds","venue":null,"work_id":"0dabb00c-de72-467b-a3f5-15699d3c16bc","year":2020},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.905172Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:177d6a97c7425724a82b927561e7b4ffd23dce34378d77c420563d5ce348ca63","observation_id":"898f1265-47f0-4eb2-b17b-6a1b3a0297a2","resolution":{"observed_at":"2026-08-09T13:11:04.625598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.610285Z","title":"Predator: Registration of 3d point clouds with low overlap","venue":null,"work_id":"dde2934f-9a89-4d9b-9d58-48f474d42075","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.909030Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:16f2436cec4d4058c5182e595cd3ecc01d4f129696a3b9c91e2add3792fe47cc","observation_id":"cbbb2bd9-1763-478a-a605-5c8fde49dc85","resolution":{"observed_at":"2026-08-09T13:11:04.614202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.02690","last_updated":"2021-03-05T05:59:07Z","snapshot_observed_at":"2026-08-04T03:43:34.316114Z","submitted_at":"2021-03-03T21:17:06Z","title":"A comprehensive survey on point cloud registration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.02690","snapshot_observed_at":"2026-08-09T13:11:03.912550Z","title":"A comprehensive survey on point cloud registration","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.912550Z"},"links":{"cited_paper":"/paper/2103.02690","citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:54dd4f6cd325529af90ae72fe37ce1b160ebfb0d70fd6bfdb6c80323a4cad984","observation_id":"f67df000-70d6-4182-bd08-734c502ae9d1","resolution":{"observed_at":"2026-08-09T13:11:03.912550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.598667Z","title":"Robust outlier rejection for 3d reg- istration with variational bayes","venue":null,"work_id":"ffb77895-eda4-47a5-b44e-6825eb98d296","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.916318Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:f2963ec736723cdeffefbfc371614714e3fc935ba00e5378dcda9d70e96d0762","observation_id":"df0bc46b-4ff7-48cc-b45b-1ad0aaf164c8","resolution":{"observed_at":"2026-08-09T13:11:04.602799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.587455Z","title":"Multiway point cloud mosaicking with diffusion and global optimization","venue":null,"work_id":"2daa4900-f22b-4151-ae54-c1b4bcd1dfb6","year":2024},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.919981Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:2e716fdd6e1e4f05c768349c3c7078daa4313425b29126eec040f7300a1f40b1","observation_id":"3b9627bb-7baa-4d2d-bef9-3095d6b39f4a","resolution":{"observed_at":"2026-08-09T13:11:04.591453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.573912Z","title":"Using spin im- ages for efficient object recognition in cluttered 3d scenes","venue":null,"work_id":"610c8c5d-02e9-4a41-a1ac-65a146dba732","year":1999},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.923564Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:5c8df75312674968225e6e9f94373f271f287c9994c2837898d4d4744b6dcbd6","observation_id":"edf0f2a9-1f08-44a7-929c-3e8797d56ef0","resolution":{"observed_at":"2026-08-09T13:11:04.579535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.562289Z","title":"A spectral technique for correspondence problems using pairwise constraints","venue":null,"work_id":"fda15a3d-f19d-49ed-aa6f-b8a0fa731bc0","year":2005},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.927014Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:6ec872924d8bd47e9519d5bc439e6950f13c6115bba8aa31eb451af3aa28e36c","observation_id":"f9ec6784-8098-4b0a-ac44-64eff213d6ef","resolution":{"observed_at":"2026-08-09T13:11:04.566541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.550578Z","title":"The 3d-3d registration problem revisited","venue":null,"work_id":"03c228e6-8064-42dc-afe3-89aab405f70c","year":2007},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.930554Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:9a5120b5ba3287e25aed83f1e59c3373caf9469108d2df9a038f614b66659c1b","observation_id":"3db42f6a-50e7-4fd8-8585-80d8caf6eacc","resolution":{"observed_at":"2026-08-09T13:11:04.554279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.538804Z","title":"Hregnet: A hierarchical net- work for large-scale outdoor lidar point cloud registration","venue":null,"work_id":"8bc5a94a-40b2-4735-8cac-ab7c047dbda9","year":2021},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.934108Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:f8287a4782f174f964af50c0ef263f058e6aeaa2a70d0a5b1538e674a98420fa","observation_id":"936064f6-dd49-45c5-a6c9-2d084f35f17a","resolution":{"observed_at":"2026-08-09T13:11:04.542819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.527371Z","title":"Branch- and-bound methods for euclidean registration problems","venue":null,"work_id":"8bd457ab-df0b-4a6a-b7f2-b97eb97a0eb8","year":2008},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.937978Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:d1e2c4b1fb1405dcf94da53cbed6bcc2fb31a733482d4229c4a1edd1673a7934","observation_id":"455827ea-6405-4b9c-96ab-e40b4c16e1af","resolution":{"observed_at":"2026-08-09T13:11:04.531396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.516734Z","title":"Dias Pais, Srikumar Ramalingam, Venu Madhav Govindu, Jacinto C","venue":null,"work_id":"8a628b77-da76-4a49-af06-008538345e2e","year":2020},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.941336Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:8bba8f0561b6454a9edbd88c8694ae1510c10dd47c657ca159be0439c60a5347","observation_id":"ef141e89-519e-4155-85fe-49ca04243ab8","resolution":{"observed_at":"2026-08-09T13:11:04.520093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:03.944743Z","title":"Geometric transformer for fast and ro- bust point cloud registration","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.944743Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:897719ee5d91e38202797c9689f15300c82e13d2db895959a2f4eb56522340b8","observation_id":"cc4ef6e0-3261-436e-a0e5-f3e9d0b4a17d","resolution":{"observed_at":"2026-08-09T13:11:03.944743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.499867Z","title":"Aligning point cloud views using persistent feature histograms","venue":null,"work_id":"45e46a2b-9efa-45c2-8332-6c5f9f46bd93","year":2008},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.948455Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:587d28d8faf1c37b595678b578b68c6a4becc09fa43fedefb23f14b14159756e","observation_id":"69da0028-3987-40cd-a412-a089c89da6d9","resolution":{"observed_at":"2026-08-09T13:11:04.503188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.489105Z","title":"Fast point feature histograms (fpfh) for 3d registration","venue":null,"work_id":"a3cf2ff7-d91e-49a8-b81a-8196ebc16107","year":2009},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.951837Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:ba055b4662c5536d94f93d4b096cdd2991fb5f0fb286aabbca67496c57c55b9d","observation_id":"fc5f0b46-e5f8-4759-b500-cf041ace3152","resolution":{"observed_at":"2026-08-09T13:11:04.493367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.477188Z","title":"Shot: Unique signatures of histograms for surface and tex- ture description","venue":null,"work_id":"ec5023b8-e6d5-4876-af1a-128b4303233a","year":2014},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.955314Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:a59b1be20110e839af23cafef3c0f56dbedd11a844308f448f77651b3900f897","observation_id":"6c96ddf5-f003-4a05-b01d-cfc633f6d3b0","resolution":{"observed_at":"2026-08-09T13:11:04.480830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.467170Z","title":"Ef- ficient ransac for point-cloud shape detection","venue":null,"work_id":"3135f3ab-5059-4bed-88c4-7ca20b32ffc5","year":2007},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.958781Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:f108a26af3b70c49733467ce47b9dd8bacff2c45128689ca9b545ec594782fb3","observation_id":"2c100ad9-21fb-4f49-91cf-28dfaa0f7b75","resolution":{"observed_at":"2026-08-09T13:11:04.471183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.456565Z","title":"Speal: Skeletal prior embedded attention learning for cross-source point cloud registration","venue":null,"work_id":"a6c52f7a-9f81-4508-80fc-5e5e1f7afefc","year":2024},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.961986Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:463cc9b9681b18cc782b47ba92c1434d34dcb6182a427f92c6afa627b161fb03","observation_id":"c7147ed5-9f26-4b6c-b434-cb22d8bf256d","resolution":{"observed_at":"2026-08-09T13:11:04.460351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.446303Z","title":"One-inlier is first: Towards efficient position encoding for point cloud registration","venue":null,"work_id":"121d93fb-11a8-40e5-9aca-ffaa37cf65e7","year":2022},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.965239Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:a615566c626636dcd5b453658286985d17068ed8b56977692382950e719c67c2","observation_id":"ff3ceb21-4dc8-432c-886c-be6287877e9f","resolution":{"observed_at":"2026-08-09T13:11:04.450072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.435709Z","title":"Teaser: Fast and certifiable point cloud registration","venue":null,"work_id":"9550d790-4930-411a-9034-186afcd04706","year":2020},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.968349Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:82f3579e406e6e1b054cc000c0d9f3b595c570bceb267c6c77be736231a1d543","observation_id":"931910b6-b25d-4192-8cf1-5d342880f3b0","resolution":{"observed_at":"2026-08-09T13:11:04.439512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.424601Z","title":"Mutual voting for ranking 3d correspon- dences","venue":null,"work_id":"9c7623d9-33f6-4d63-8687-c1f20700a6fb","year":2023},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.971299Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:73a54ac2dc7d52c608327f2c985d50c732972da26c31c30c6908f1cfc809ee26","observation_id":"5c6ab2cf-ee85-4b7d-aefe-afdd2e1a80e4","resolution":{"observed_at":"2026-08-09T13:11:04.428317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.413596Z","title":"Hunter: Exploring high-order consistency for point cloud registration with severe outliers","venue":null,"work_id":"1065db6e-54fc-4474-a95f-db8e6160299f","year":2023},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.974389Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:9e491ef40b7ca0524c9969436eb51cd9f767e312100896c5336dad3d49485e9b","observation_id":"cc894575-85bb-4dce-bac1-1e6e4b6fe90c","resolution":{"observed_at":"2026-08-09T13:11:04.417431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.402986Z","title":"Learning to find good correspondences","venue":null,"work_id":"f8a397f8-d0ed-4b11-ae2f-98dd82b7a9e3","year":2018},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.977494Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:25fa3b38fae3c2a56de17b94f4c222b767b213828366976de7596adc50599586","observation_id":"900a0821-0c91-4f5c-a612-36ea14ea5b83","resolution":{"observed_at":"2026-08-09T13:11:04.406947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.392098Z","title":"A survey on global lidar localization: Challenges, advances and open problems","venue":null,"work_id":"e531f53a-eb68-41d9-b40d-cdd4186a7208","year":2024},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.980660Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:978905b4289c70f6696cd352fecd3d21a23003b8fee3228614d92df94bad6638","observation_id":"6027d546-3eb9-4f55-8635-82b63df24f59","resolution":{"observed_at":"2026-08-09T13:11:04.396163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.380995Z","title":"Cofinet: Reliable coarse-to-fine correspondences for robust pointcloud registration","venue":null,"work_id":"dadcc1cf-507f-4b61-bc98-1645d3f52029","year":2021},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.983715Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:60d959d82733d245828f6d6757a4284a5632d70e0511040c30d06ec5e752420c","observation_id":"b4350625-dc86-438d-bf99-48a742e7d138","resolution":{"observed_at":"2026-08-09T13:11:04.385313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.366176Z","title":"Rotation-invariant transformer for point cloud matching","venue":null,"work_id":"ed4f16a7-51c9-4bf1-8511-ef98e579577a","year":2023},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.986954Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:336c157cf615d8f9cf93cff3c55bb2b7e112101d4e36ed72c026da7eecf4ecd6","observation_id":"22bf1d52-1070-477c-afbb-94213c0e2a5d","resolution":{"observed_at":"2026-08-09T13:11:04.372155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.355457Z","title":"Peal: Prior-embedded explicit attention learn- ing for low-overlap point cloud registration","venue":null,"work_id":"7b9ab9df-7dde-4695-a6cc-7ade4071f050","year":2023},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.990334Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:f60c886ce12b7f4d14ded7de78d2fa336eaa418a2294ba74843f06596ddde49d","observation_id":"017e7741-5d28-45a0-9e5b-b19db72c228b","resolution":{"observed_at":"2026-08-09T13:11:04.359329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.04557","last_updated":"2024-04-06T08:51:07Z","snapshot_observed_at":"2026-07-06T17:56:27.818353Z","submitted_at":"2024-04-06T08:51:07Z","title":"Learning Instance-Aware Correspondences for Robust Multi-Instance Point Cloud Registration in Cluttered Scenes","version":1},"cited_work":{"arxiv_id":"2404.04557","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.04557","snapshot_observed_at":"2026-08-09T13:11:04.229512Z","title":"Learning Instance-Aware Correspondences for Robust Multi-Instance Point Cloud Registration in Cluttered Scenes","venue":"cs.CV","work_id":"d774ab52-4ccf-4551-beaa-374eef4fc442","year":2024},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.993510Z"},"links":{"cited_paper":"/paper/2404.04557","citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:53eda7663ceff30757fc5162e64f22c056ad9e10a918b58837966ffa578007dc","observation_id":"705176a4-26e4-4edb-a0eb-f4ee41a98285","resolution":{"observed_at":"2026-08-09T13:11:04.233661Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.344725Z","title":"3dmatch: Learning local geometric descriptors from rgb-d reconstruc- tions","venue":null,"work_id":"e171d50d-1040-46e3-b8da-e11e29698510","year":2017},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.996947Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:9015b507550bb0a086d89071d42951629812d482b8b388e8c2bce006eab160fe","observation_id":"05813b77-6f13-44a4-bf38-9139effd136f","resolution":{"observed_at":"2026-08-09T13:11:04.348442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.333511Z","title":"3d registration with maximal cliques","venue":null,"work_id":"3ecafaf5-c48b-43bc-a612-014220403ea1","year":2023},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.999977Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:c67288b3a7bcbe2f3b7d1358cefef1dbd5d7be16eeffe5fc38d9b44dbccfb815","observation_id":"8d3c0b62-6752-4330-8ab4-c118bb84790f","resolution":{"observed_at":"2026-08-09T13:11:04.337530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.322590Z","title":"Fastmac: Stochastic spectral sampling of correspondence graph","venue":null,"work_id":"57336418-79b7-4a61-b2c9-c4c0d3355296","year":2024},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.003260Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:358f445af6e00dcdc9f83782d9b48ebc9ecc0abb6712a3fe3ae9253860b94f20","observation_id":"c9f98ac7-c2d5-43a7-b077-b050b27210ed","resolution":{"observed_at":"2026-08-09T13:11:04.326525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.310768Z","title":"Spherenet: Learning a noise-robust and general descriptor for point cloud registration","venue":null,"work_id":"ac4e2dbd-e187-45f7-8a1b-2d8465ca303d","year":2024},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.006581Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:1b4fbf447dc8f653ccdd81f0129f6f068b16772621c0539ee6f7716169678ee0","observation_id":"60ec4ed9-21e2-4956-858c-ee232be70515","resolution":{"observed_at":"2026-08-09T13:11:04.315027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.299739Z","title":"Proof of Theorem 1 Theorem 1","venue":null,"work_id":"77c2761a-2264-4b5d-b1ed-dc335b09d815","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.009569Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:806d9a306571d52d5fadca78c093485b968d8d2ed3d0e9e7b1540415866cd230","observation_id":"c75b046c-0742-4697-ac8c-772fcc2ab01a","resolution":{"observed_at":"2026-08-09T13:11:04.303122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.287733Z","title":"Point-level Pose Refinement Pose refinement is crucial for achieving accurate pose esti- mation","venue":null,"work_id":"38f66e0b-b77e-4f64-b2b8-ba7a8e598a0d","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.013376Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:9da6fc732a74c730bdab39f687250dd761d22869d28fff14217f947d6df13fa1","observation_id":"da849914-7c34-4646-9a19-a780be25c50b","resolution":{"observed_at":"2026-08-09T13:11:04.292096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.275322Z","title":"It represents the number of correct correspondences in the final correspondences, reflecting our ability to generate inliers","venue":null,"work_id":"fd773957-08c2-4705-a768-034dfc2f64fc","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.017291Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:c227f2207e70270c06ee44bcc0f12eebe68d38c2faa0e840b913c2753f98396f","observation_id":"537b7b27-725a-476c-9ad1-9cf538cd1fa1","resolution":{"observed_at":"2026-08-09T13:11:04.279458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.263863Z","title":null,"venue":null,"work_id":"d2f4bf14-aa0b-450a-8dd4-396390626ce8","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.021057Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:012a2fc8f8717cc40d4c43bb86ba606f757cae2f13fe7bb820054a9638a2b632","observation_id":"59280c73-a0a3-447e-a57e-581b4d288a93","resolution":{"observed_at":"2026-08-09T13:11:04.267481Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2522.0926","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.211285Z","title":null,"venue":null,"work_id":"09c598d2-14df-4bb4-a381-8724554ec754","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.024748Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:89425d3e68cad175eaf8ac9da094ef8b540a282ba4e27eda7aac93d43b206052","observation_id":"ce2bca57-1d6d-48a7-9d0c-36ffa8d95456","resolution":{"observed_at":"2026-08-09T13:11:04.216751Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3684.77250","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.134874Z","title":"Ablation study on prior-guided local grouping","venue":null,"work_id":"cbdac3a5-6ae7-4bc8-9764-d1231e9ddd45","year":1924},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.028205Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:c62f868774fa7e02dac29b0d1a6cc24c6e78e596b2d3cc4bd290f6889e90a754","observation_id":"f8aa68d1-14de-40e4-bb2a-5ff965e1f2e4","resolution":{"observed_at":"2026-08-09T13:11:04.142744Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.252497Z","title":null,"venue":null,"work_id":"797e3cb9-0f30-4718-9c7f-c69ec30aa7ed","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:04.031819Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:998e7e8495b246354f0590cdde50fc589472ef0270225ec0f1239e4319b53554","observation_id":"bb25bcc9-3b3b-4425-ae69-2098ca2a2c8b","resolution":{"observed_at":"2026-08-09T13:11:04.256123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:11:04.760275Z","title":null,"venue":null,"work_id":"fc0d822c-a7ca-42ba-af0c-5006cea38214","year":null},"citing_paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-09T13:11:03.864692Z"},"links":{"citing_paper":"/paper/2502.02163"},"observation_digest":"sha256:4c26c36b215b1600dd16387e1a059ece08ec1ba974d8964164ac95c082f7a399","observation_id":"8e03075a-6563-4d42-8e56-9a02cca92f0f","resolution":{"observed_at":"2026-08-09T13:11:04.764511Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.02163","last_updated":"2025-02-09T08:30:56Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-09T13:03:57.320342Z","submitted_at":"2025-02-04T09:38:45Z","title":"Progressive Correspondence Regenerator for Robust 3D Registration"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":1,"unresolved":4,"verified_exact":2,"verified_fuzzy":47},"total_outbound_references":56},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2502.02163."}