{"as_of":"2026-08-18T12:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3550e5eced613487051cc82d4f28a69ac794147b5793caa1970bf0f788cd4191","coverage":[{"denominator":91,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":91,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:33:47.873101Z","state":"measured"},{"denominator":91,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":91,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2508.02339/citation-record","integrity":"/paper/2508.02339/integrity","json":"/paper/2508.02339/citation-record.json","paper":"/paper/2508.02339"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.561011Z","title":"Outlier-robust estimation: Hardness, mini- mally tuned algorithms, and applications.IEEE Transactions on Robotics, 38(1):281–301, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.561011Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:b4c8c40f91f63fd91dbe3e080d503f599c68f05b2623423f02c6d36698fb95e9","observation_id":"42a651ee-a4c0-4f86-b158-f7c7b646b61d","resolution":{"observed_at":"2026-08-15T18:33:47.561011Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.565596Z","title":"Pointnetlk: Robust & efficient point cloud registration using pointnet","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.565596Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:73e26816c5c97241d5b794f59f32226a9ac4a103dac0476a0ff1090850e5c30b","observation_id":"32b78ae6-5eb9-4f60-a9b3-9cf9768483af","resolution":{"observed_at":"2026-08-15T18:33:47.565596Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.569060Z","title":"Least-squares fitting of two 3-d point sets","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.569060Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:bbefcea4fd496464223a9d86f56ecf1b6a66b78427fe0f94c4e47386e21d122d","observation_id":"55d952e2-a91c-4fd7-b214-47bc6b3fd589","resolution":{"observed_at":"2026-08-15T18:33:47.569060Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.572597Z","title":"Pointdsc: Ro- bust point cloud registration using deep spatial consistency","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.572597Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:47a5ce9650f77c9aaa0add12587fcefef2881fedd5de2d840721066405cffd9d","observation_id":"751d1a22-ebbe-423a-b670-13563d9c4725","resolution":{"observed_at":"2026-08-15T18:33:47.572597Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.576545Z","title":"Reagent: Point cloud registration using imitation and rein- forcement learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.576545Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:2c86defbf5f5c0dc9e16a4c6dd0773952e49df6afcf9d4f6f9400f83dd16461e","observation_id":"dbe4cad8-13d7-4adc-9897-c1634f311348","resolution":{"observed_at":"2026-08-15T18:33:47.576545Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.580019Z","title":"Globally optimal inlier set maximization with unknown rotation and focal length","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.580019Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:36af419223085fda28d7c75a201123e589b092800fdf85d760af7ef1fb629848","observation_id":"f8be7ea6-8d0a-46fc-a254-410d147bc7e4","resolution":{"observed_at":"2026-08-15T18:33:47.580019Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.583991Z","title":"Phaser: A robust and correspondence- free global pointcloud registration","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.583991Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:0af8eb45dfad5eff5b8ea2566172ede50335409123295b2e0f0b02084da43ad7","observation_id":"0068502a-ca37-4061-834a-f6114b156cd4","resolution":{"observed_at":"2026-08-15T18:33:47.583991Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.586678Z","title":"Method for registration of 3-d shapes","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.586678Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:e25b7fcc561968fccb5189a1b9c62dd9429a372c1a622789a7c230049021968f","observation_id":"716326d0-6a5e-4e03-8968-0b593626d664","resolution":{"observed_at":"2026-08-15T18:33:47.586678Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.589730Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.589730Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:35233fc05a48e0462f16f00ef1391764c342bcf2af2be40be80019843f4f400d","observation_id":"7a256f8c-a556-4b07-a0e2-34c23ac02283","resolution":{"observed_at":"2026-08-15T18:33:47.589730Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.592554Z","title":"Guaranteed outlier removal for point cloud registration with correspondences","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.592554Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:2bde159f15f8ee7a3c39d44dc82408217c2158892a1b630d80e71f4b0b80ce91","observation_id":"d1108e16-da3c-43ce-9f7a-b7d5940e6709","resolution":{"observed_at":"2026-08-15T18:33:47.592554Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.595571Z","title":"Gogma: Globally- optimal gaussian mixture alignment","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.595571Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:cba8a8dbd354b262c3e86c4d47bb9e83fef96e23c1a261b951a1af9b612f95a2","observation_id":"d1be9d71-ad3a-4a09-adbe-7d7ee6181964","resolution":{"observed_at":"2026-08-15T18:33:47.595571Z","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-15T18:33:48.696629Z","title":"Spherical correla- tion as a similarity measure for 3-d radiation patterns of mu- sical instruments","venue":null,"work_id":"c8ea202d-35a6-49a9-b89b-aa7e2b167289","year":2023},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.598229Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:a3e8022281f103904e1ca535cf6e425e53cf9f7d8346adc2fb3ee6a9b4edd1d5","observation_id":"4049c216-50ad-4069-b10f-e24bc93cd40a","resolution":{"observed_at":"2026-08-15T18:33:48.700221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.687020Z","title":"A total least-squares es- timate for attitude determination","venue":null,"work_id":"f6e8a33a-a180-4e77-ab82-a6999fd46b49","year":2019},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.601268Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:750a25fbfbafbf5eb49cff698be059ac6c65d7f66c875416ff191fab1022a3ee","observation_id":"d171375e-1d77-44c4-9a17-b1c0f0822c0f","resolution":{"observed_at":"2026-08-15T18:33:48.690458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.677472Z","title":"The trimmed iterative closest point algorithm","venue":null,"work_id":"de9dfed0-d617-4ef2-8d23-db1918c8c83b","year":2002},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.603864Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:d2f4aa622bd8e4fa104f627c4aca29f0cd29dfd548bd93c00ebffdabf6a9e76a","observation_id":"5c6e711b-2f54-4132-95ae-0e5705a78fc9","resolution":{"observed_at":"2026-08-15T18:33:48.680767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.667194Z","title":"Guaranteed outlier removal with mixed integer linear programs","venue":null,"work_id":"caf4fbd2-49df-41a3-94a5-f60bc1acd201","year":2016},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.606487Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:c18da6375fc30fa69a07ba07da539ed3e09a392d634879bf069c8084cf9e5242","observation_id":"99e52d20-d9f4-4841-8b58-f28dd4c8526b","resolution":{"observed_at":"2026-08-15T18:33:48.671210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.657047Z","title":"Star tracking using an event camera","venue":null,"work_id":"569b509b-a391-4f8a-85f9-8e9edab4b5d3","year":2019},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.609853Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:29975792404b368459409522648b4fc735e2ac22d9b145dca32ba3141114a664","observation_id":"4e6e93ab-4538-4a7a-b3f3-e23547f8aefd","resolution":{"observed_at":"2026-08-15T18:33:48.660593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.647790Z","title":"Fully convolutional geometric features","venue":null,"work_id":"5bac1b58-ca15-42fb-a340-284ec3085335","year":2019},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.613345Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:8690691f32e36376985638b4bf84cb8ff1d0766b484586b7462902cd3c2e2ffa","observation_id":"2d9a87d5-2e25-4f90-bfa3-d13412d058c5","resolution":{"observed_at":"2026-08-15T18:33:48.651294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.638201Z","title":"Deep global registration","venue":null,"work_id":"0e67ff6b-4070-4d49-aa1b-d6e9896841b3","year":2020},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.616756Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:14a162a75ad8ec23acfcb01e77a4fe213862cc1390e2b5a71b3d5646a80e7352","observation_id":"943c292a-d329-4819-aa98-7613e79768d1","resolution":{"observed_at":"2026-08-15T18:33:48.641514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.628529Z","title":"A new point matching algorithm for non-rigid registration","venue":null,"work_id":"5697d325-2474-4cdf-8958-2f5d8d50bf01","year":2003},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.620859Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:5111e1ce7f00cf2928e29df864a84084961d026f45b24555029c601961e052d7","observation_id":"1d45024c-41de-41ad-b446-44e80fe0b2a0","resolution":{"observed_at":"2026-08-15T18:33:48.631968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.10130","last_updated":"2018-02-25T13:43:49Z","snapshot_observed_at":"2026-08-14T19:50:35.166135Z","submitted_at":"2018-01-30T18:28:30Z","title":"Spherical CNNs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.10130","snapshot_observed_at":"2026-08-15T18:33:47.624405Z","title":"Spherical cnns","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.624405Z"},"links":{"cited_paper":"/paper/1801.10130","citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:01ad994989d4c42e74ef674790413f4b61648531b93067276b95a30fc6bf72b3","observation_id":"27e67e7e-e2e9-488d-adb5-b7bff600307a","resolution":{"observed_at":"2026-08-15T18:33:47.624405Z","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-15T18:33:48.618301Z","title":"Model globally, match locally: Efficient and robust 3d object recognition","venue":null,"work_id":"74d84f21-7e7a-4680-aa39-35bf136918cd","year":2010},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.628861Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:7fb11dd02b38aac77222789f140d91cff996698e0f6c33a08e97cdf5164d43cf","observation_id":"5add4419-f5a4-4c7a-81a3-a50a482748cd","resolution":{"observed_at":"2026-08-15T18:33:48.622435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05420","last_updated":"2023-06-08T17:59:08Z","snapshot_observed_at":"2026-08-16T15:25:23.035175Z","submitted_at":"2023-06-08T17:59:08Z","title":"Scaling Spherical CNNs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05420","snapshot_observed_at":"2026-08-15T18:33:47.632109Z","title":"Scaling spherical cnns","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.632109Z"},"links":{"cited_paper":"/paper/2306.05420","citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:4cbedca5401a1d55cfb23ae85e31dc09840f0a3c28c52d4059ffa7256396e00a","observation_id":"643869c2-18e1-4a60-b742-b97d6bf93f94","resolution":{"observed_at":"2026-08-15T18:33:47.632109Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:33:47.635802Z","title":"Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography.Communications of the ACM, 24(6):381–395, 1981","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.635802Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:0a453c3ecdcd55d1bd43cd43f26fda34a68df499eae729e596007469a6da2979","observation_id":"f8173540-d1ca-46d2-87ea-58d856e255ad","resolution":{"observed_at":"2026-08-15T18:33:47.635802Z","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-15T18:33:48.602920Z","title":"Linear- matrix-inequality-based solution to wahba’s problem","venue":null,"work_id":"dbb1e968-dfe3-4169-be56-becf2085cdf0","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.639454Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:7fd2c6bb087ce3f805f29a8cf47eac44e317e51fb6d0bd162b38c48fdbe3b6af","observation_id":"0ba7c447-589d-4b53-9c02-27a3fff8b34b","resolution":{"observed_at":"2026-08-15T18:33:48.606689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.642891Z","title":"Vision meets robotics: The kitti dataset","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.642891Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:754cb70ddbd958c6df7c12b510cee9e1e989298f2eaee1863ad2f169f6d96e9d","observation_id":"bad934c3-b06a-48da-a135-97f145ba7c90","resolution":{"observed_at":"2026-08-15T18:33:47.642891Z","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-15T18:33:48.586611Z","title":"Procrustes prob- lems","venue":null,"work_id":"462674be-6941-4a8f-bc71-7096e0cbd15e","year":2004},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.646511Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:d959234201af289363202de44ee3996e333868fedf5032e40ab291c8f17aa19c","observation_id":"4afe0686-1190-4f4c-8a86-f85009e22924","resolution":{"observed_at":"2026-08-15T18:33:48.590202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.576620Z","title":"Shape registration with spherical cross correlation","venue":null,"work_id":"059e0467-bd10-4d51-b454-675e8f6c85d4","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.649793Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:b685f6e992e54548a1f2982ae6144d534312558deebba109eab2313818c10d62","observation_id":"8f7bf700-57ad-4f5b-aaf7-d014c2b977b9","resolution":{"observed_at":"2026-08-15T18:33:48.580124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.567023Z","title":"Global optimization through rotation space search","venue":null,"work_id":"a9a819aa-e3c9-4df2-8c88-f078a7bed31d","year":2009},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.655637Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:07495db0d09a000264ba54b2bf78cbf4c665d4c73b4ff5c86c298964681eb190","observation_id":"b86d6830-8ff3-434d-b3d3-2d198973c8e8","resolution":{"observed_at":"2026-08-15T18:33:48.570386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.557298Z","title":null,"venue":null,"work_id":"b939f956-06aa-4209-b7ac-4136fb9a6768","year":1984},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.660501Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:08b60c3c1a05cc1fc295fdff2adc98712610df26ceba686902f36cb0424ad253","observation_id":"0f4aa31c-56bb-40c6-8cec-2c737a2e9749","resolution":{"observed_at":"2026-08-15T18:33:48.560986Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.546861Z","title":"Closed-form solution of absolute orien- tation using unit quaternions","venue":null,"work_id":"217d4c1a-4b99-48bb-aeba-d1832a4f257a","year":1987},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.664907Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:d0fc4d9ebcabe6aa8f36666d0e7148c409696ba81457ea9825c374c130027e51","observation_id":"4ac743bc-fffc-4914-a973-833c9b54a499","resolution":{"observed_at":"2026-08-15T18:33:48.550604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.535808Z","title":"Closed-form solution of absolute orientation using orthonormal matrices","venue":null,"work_id":"335f7eb2-8a46-41f7-9dbd-06c1e81f1e4a","year":1988},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.668352Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:19bfd302aaf07b32c117c2affd8f75421884cdf4c735244f07dd40681d40dee5","observation_id":"707b1bdc-37a5-4b86-8019-d745e1f56a59","resolution":{"observed_at":"2026-08-15T18:33:48.539690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.672000Z","title":"Predator: Registration of 3d point clouds with low overlap","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.672000Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:39e7a7df1dd7a07c270bfd9db485c8759bd5d968b19d7bde82b11b594931520f","observation_id":"b6bf4d54-18a2-489f-b019-a71dd3b458a1","resolution":{"observed_at":"2026-08-15T18:33:47.672000Z","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-15T18:33:48.519992Z","title":"Robust point set registra- tion using gaussian mixture models","venue":null,"work_id":"184d0d97-5ea1-48ee-a65e-07d8f49115d1","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.675538Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:814ac3d18fe1914b6d2d681c67c4d179c77f65e35840a6d432fbc001a63bd0f4","observation_id":"631493cf-1fe5-41ed-a932-bf4c5fa72095","resolution":{"observed_at":"2026-08-15T18:33:48.524129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.510092Z","title":"A solution for the best rotation to re- late two sets of vectors","venue":null,"work_id":"7d070047-b4a9-4638-9c5b-1c545cdc6c67","year":1976},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.679126Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:972a8c6973840ebe3f8e1ef4d56cebd569923f8150b4304581a6f4a09b8932d0","observation_id":"f82d443e-9b9d-402a-9962-bbb0a1c2637f","resolution":{"observed_at":"2026-08-15T18:33:48.513824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.500150Z","title":"Closed-form solutions for estimating a rigid motion from plane correspondences extracted from point clouds","venue":null,"work_id":"0a9ecbb5-380d-4d54-88ee-f80c4f3a2f52","year":2016},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.683041Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:b38dd516e25ef7e032faf60c31ef932812db026f0ea9d3106d49c9bde2870c51","observation_id":"3ad2049a-f68d-4b8f-a055-ed2dd7616649","resolution":{"observed_at":"2026-08-15T18:33:48.503700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.490132Z","title":"A time delay estimator based on the signal integral: Theoretical performance and testing on ECG signals","venue":null,"work_id":"0b08d262-6a21-44b5-80cd-1bc688354948","year":1994},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.686382Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:dd94b8b2851dcce32d0be80ab6eae298d75b0674745108606fdbfbcd2a9bdb84","observation_id":"48dc92e8-a476-4dd2-844a-a1f2b43857e5","resolution":{"observed_at":"2026-08-15T18:33:48.493711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.480730Z","title":"Modern directional statistics","venue":null,"work_id":"8c49947b-84fd-4f83-8992-ffe755deb749","year":2017},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.690066Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:53c92993e3ff74158fa644ec883bc9680c51e04b4cf8dd35675466609dedefd4","observation_id":"50730314-898f-4502-b90f-a4c55dd00dd8","resolution":{"observed_at":"2026-08-15T18:33:48.484066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.470995Z","title":"Weak sharp minima on riemannian manifolds","venue":null,"work_id":"18e8fd78-f607-43a7-8ba4-16896fc4dd4c","year":2011},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.693331Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:9cfbaa2f7b5e51cfc6c0de2437bb9bb33da8f92e5a33bfb46e14502eb60ce088","observation_id":"568056f1-3ef9-430b-9cda-354bcf32ef6a","resolution":{"observed_at":"2026-08-15T18:33:48.474698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.461265Z","title":"The 3d-3d registration problem revisited","venue":null,"work_id":"246af669-bc4f-4f36-9d9b-96809aa93914","year":2007},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.696576Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:840fb7029c2f27c417a574dfda455fd92802cdcad418dba98b007cae4677caaf","observation_id":"6e958214-6795-4bc4-aa85-232a102f9f69","resolution":{"observed_at":"2026-08-15T18:33:48.464746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.450804Z","title":"Gesac: Robust graph enhanced sample consensus for point cloud registra- tion","venue":null,"work_id":"2d791834-13a9-470a-940e-ba7fb3ec4f7e","year":2020},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.699893Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:791dea50e27dabbe760774ebcf57f7276aabb87005ed64f5d6444ca623303d58","observation_id":"08c70ffb-86b6-4091-adef-38bfbaee55ce","resolution":{"observed_at":"2026-08-15T18:33:48.454536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.439930Z","title":"Point cloud reg- istration based on one-point ransac and scale-annealing bi- weight estimation","venue":null,"work_id":"2187fd2d-aabc-4475-9302-6d1cb4d6621c","year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.702520Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:fc57df8ceed666dea435feb327c23844c2fe95423ffeff413fea26231af4a479","observation_id":"76145724-9ad0-4359-a1c4-15d2be4c6a41","resolution":{"observed_at":"2026-08-15T18:33:48.444018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.429997Z","title":"An efficient globally optimal algorithm for asymmetric point matching","venue":null,"work_id":"685c4dc5-45c6-4823-a7e1-eac098506e47","year":2016},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.705253Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:71c0087d03bd935f5f69e81d1b38c595fb7275ed9283a001ac57e3544f8d19ff","observation_id":"4c72413b-4956-4fda-9e33-2c27c0560ec8","resolution":{"observed_at":"2026-08-15T18:33:48.433592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.419720Z","title":"Self-localization of mobile robots using a single catadioptric camera with line feature extraction","venue":null,"work_id":"e582f4e0-3159-41aa-be3f-f8b3678dfbb8","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.708182Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:2c1273d3d9480b5269f476eadbd92cd5f7f121b814db772908768a2921e8e2c4","observation_id":"08ffa8e2-d6e9-4e5f-b4c3-bc4e3d828353","resolution":{"observed_at":"2026-08-15T18:33:48.423958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.409735Z","title":"Efficient global point cloud registration by matching rotation invariant features through translation search","venue":null,"work_id":"21ecdc8d-1fb9-4265-8c8d-f40a6e440139","year":2018},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.710990Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:8c9b9e9abb80c9dd9e53bbee3cfa18184249a006826e83644bfb554ead40cdbc","observation_id":"a88ff31f-8487-44ee-9493-a8629764193b","resolution":{"observed_at":"2026-08-15T18:33:48.413244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.399840Z","title":"Fast and accurate registration of structured point clouds with small overlaps","venue":null,"work_id":"e699072a-74d3-4279-b88e-b404905db70e","year":2016},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.713790Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:b8f1bfdb2e0eba9af8cd1db93c7c388c2d3056a418ebb1542f4e6d54f6c18068","observation_id":"141ec8cf-a4bb-4349-a475-5008efe11f16","resolution":{"observed_at":"2026-08-15T18:33:48.403515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.389996Z","title":"Direct 3d-rotation estimation from spherical images via a generalized shift the- orem","venue":null,"work_id":"06ffdc9f-6c53-4c40-bd0a-1f5e721b1e14","year":2003},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.716490Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:10bc036bc83f0e3bf5962a6fb53602ca4f2741b1d5de56e74ed540b915947bf8","observation_id":"1f3eb1d9-88d8-4197-8bad-65906ec92dea","resolution":{"observed_at":"2026-08-15T18:33:48.393609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.379136Z","title":"Rotation recovery from spherical images without correspondences.IEEE trans- actions on pattern analysis and machine intelligence, 28(7): 1170–1175, 2006","venue":null,"work_id":"e91a5403-385c-49da-8574-12689f04a64d","year":2006},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.719126Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:7533dfe9bf71f9ffba01e0ac838298e137ad228ff46c62b6e401b3c07a8b2baa","observation_id":"9afd3d2d-f9fe-4903-a326-08ed54656f84","resolution":{"observed_at":"2026-08-15T18:33:48.383399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.369079Z","title":"Ro- tation estimation from spherical images","venue":null,"work_id":"d1effdbd-5098-4350-b66b-caa2fccf5e28","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.722010Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:3923db52662d1669c33fbdd51679b7eca530765e86b914c04299f43e12a82031","observation_id":"a88843ec-63b5-4a05-a794-ace9edebb14a","resolution":{"observed_at":"2026-08-15T18:33:48.372957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.349703Z","title":"Fully automatic registration of 3d point clouds","venue":null,"work_id":"2f9bf9b4-80bf-47a4-810d-c45a365d66ee","year":2006},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.728779Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:2503f84aec7bb8ae66402c1e0761bc6043673f277a09ede85c772ef5d456156b","observation_id":"8f636d4a-6f17-40f5-be98-0d9b7ac737d0","resolution":{"observed_at":"2026-08-15T18:33:48.352979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.340337Z","title":"Directional statistics","venue":null,"work_id":"0442d8a2-459d-43b7-ae01-20ec81948e06","year":2009},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.732201Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:07d806a023a48155728c3e2efc22f7bbabd639c94dfb965bc1ed47d6f3d50935","observation_id":"9cd290bc-9935-4bfa-ad64-2eb192712d8a","resolution":{"observed_at":"2026-08-15T18:33:48.343662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.331065Z","title":"Attitude determination using vector ob- servations and the singular value decomposition","venue":null,"work_id":"f10bd057-b945-4d45-8e89-b1da65af6366","year":1988},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.735608Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:fa1020dbe2b9300c8189751e9b833aa9dcb1c1b91715776ccc31d3502c1143ff","observation_id":"3726ddd8-010d-436c-a961-89bf8bb69e24","resolution":{"observed_at":"2026-08-15T18:33:48.334387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.321670Z","title":"Point set registration: Coherent point drift","venue":null,"work_id":"95e58fef-906b-4b59-9cb0-0a4a1395c57e","year":2010},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.739747Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:5f2c05c8229009a1691ce0bfbadce2ff7cd9bc560980a01bf7935a4cf131146b","observation_id":"22aebaef-321a-4404-a7a7-b942abb50187","resolution":{"observed_at":"2026-08-15T18:33:48.325055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.01534","last_updated":"2020-02-27T05:13:59Z","snapshot_observed_at":"2026-08-14T17:20:59.544753Z","submitted_at":"2019-02-05T04:06:26Z","title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.01534","snapshot_observed_at":"2026-08-15T18:33:47.743430Z","title":"A practical maximum clique algorithm for matching with pairwise constraints","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.743430Z"},"links":{"cited_paper":"/paper/1902.01534","citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:f5f4889825d2d7ea7d87ffe4bba3f9fda30c1990ea144ce5e5df509c51ec8841","observation_id":"56d51c14-14e0-4a79-ae19-fd4ad92328a9","resolution":{"observed_at":"2026-08-15T18:33:47.743430Z","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-15T18:33:48.312363Z","title":"Guaranteed outlier re- moval for rotation search","venue":null,"work_id":"8a82845c-a86d-482b-b605-57e734564922","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.747506Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:e2f14e5f26c32d71e3792f76ee0a4e03490e85b5248d607f5441122c9388ca7b","observation_id":"6ce88cb9-be78-4c12-a7d9-9dba2768b6a2","resolution":{"observed_at":"2026-08-15T18:33:48.315882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.303337Z","title":"Fast rotation search with stereographic projections for 3d regis- tration","venue":null,"work_id":"8dbc5eb7-3db0-4032-89a6-5fa6d224a9ca","year":2014},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.752077Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:486ec5b0fad164d63242ab912edf1c1627b766fe663de8e940c6492743f2aeb8","observation_id":"b3686516-cd0b-468f-89b2-8078e8f4924e","resolution":{"observed_at":"2026-08-15T18:33:48.306724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.293841Z","title":"Arcs: Accurate rotation and correspondence search","venue":null,"work_id":"c6c4a7cb-6d0b-4933-9670-822003ee44c3","year":2022},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.758664Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:68a7fcef234ab1a28eb56bc212d0ddebf1209a82fb740a157e720e1b994cb814","observation_id":"0e6079e4-931f-48d7-9e93-1d25b5a8c1a9","resolution":{"observed_at":"2026-08-15T18:33:48.297261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.283929Z","title":"Learning general and dis- tinctive 3d local deep descriptors for point cloud registration","venue":null,"work_id":"d4f24391-2a9a-4a12-b7e4-826404e52a7e","year":2022},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.763006Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:dfe9af798fc9415a70eafdbaae326cfec1d589de14fee02cd44e4ac7e87a46ae","observation_id":"bb1fa8ce-2059-4f97-96e9-08126d5f5d8e","resolution":{"observed_at":"2026-08-15T18:33:48.287686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.274465Z","title":"Spherical parametrization and remeshing","venue":null,"work_id":"345c6727-1907-4f3c-89ca-3695690ae4a0","year":2003},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.766897Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:489601a2644441edc2bcdadb6678424a2b79d0c85ba78e04575d8ab9a3a92418","observation_id":"ee41d574-b54e-4c9d-ba4e-4a308d81831e","resolution":{"observed_at":"2026-08-15T18:33:48.278167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.263195Z","title":"Efficient variants of the icp algorithm","venue":null,"work_id":"a30df0cf-f904-4309-af1f-3494f39e9fa4","year":2001},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.770520Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:b9c560d629ffad7328fc004abfef4f80abfb2e8bfa5931b8a86907155d393662","observation_id":"bb0ba179-a216-4c2c-96df-1ec35c458610","resolution":{"observed_at":"2026-08-15T18:33:48.267111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.252151Z","title":"Fast point feature histograms (fpfh) for 3d registration","venue":null,"work_id":"10255146-83b1-457b-884f-e1c79323cf7c","year":2009},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.774437Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:0a7ccac4513955a841bb4d04a2495390c8c55d105b748ca444caed4d03a980a7","observation_id":"ab02edd9-47cb-4300-904f-5530bf1af329","resolution":{"observed_at":"2026-08-15T18:33:48.256281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.241262Z","title":"Learning3D: A Modern Library for Deep Learn- ing on 3D Point Clouds Data","venue":null,"work_id":"57eb36e6-05e2-447c-9c85-c7b443d0c02f","year":2020},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.778060Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:06a06e50c18b61ed8c43442a85c0fff2e89fa18ef3196c4306bc11c3b04cc31a","observation_id":"28e83951-2a80-463e-a201-4fba61aef359","resolution":{"observed_at":"2026-08-15T18:33:48.244735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.07906","last_updated":"2019-11-04T04:52:47Z","snapshot_observed_at":"2026-08-17T01:31:12.752439Z","submitted_at":"2019-08-21T15:10:24Z","title":"PCRNet: Point Cloud Registration Network using PointNet Encoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.07906","snapshot_observed_at":"2026-08-15T18:33:47.781675Z","title":"Pcrnet: Point cloud registration network using point- net encoding","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.781675Z"},"links":{"cited_paper":"/paper/1908.07906","citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:5ee63112ea55d69446b13d209dbdd13e7af024bb64ac6f0b5a310c868d35b964","observation_id":"0a5adb7f-9ca5-4d7a-bb46-13e3bcb44aac","resolution":{"observed_at":"2026-08-15T18:33:47.781675Z","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-15T18:33:48.230292Z","title":"Semidefinite descriptions of the convex hull of rotation ma- trices","venue":null,"work_id":"8dc48076-fa9f-4e57-9745-515cdecc3f49","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.785565Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:b7ff86a9445dded0c635caee82f87c7c160dcdef8e1ad6770470b8fd321b1fa0","observation_id":"1eb89ddb-b0fb-4038-9a06-f3e82834b5f5","resolution":{"observed_at":"2026-08-15T18:33:48.233789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.217440Z","title":"A generalized solution of the orthog- onal procrustes problem","venue":null,"work_id":"6bf0239f-b197-42bf-b583-605049db8451","year":1966},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.789041Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:073daf92e6d3290882c6bef7e2b02a53077411b710ba3418f748f0c692f55006","observation_id":"7a2d0914-b9de-48ae-9d13-c7afcb9c1224","resolution":{"observed_at":"2026-08-15T18:33:48.222550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.205889Z","title":"Robin: a graph-theoretic approach to reject outliers in robust estima- tion using invariants","venue":null,"work_id":"78eac91c-47e4-44d9-8345-5ab0cfb8d36d","year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.793155Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:647ca41ec7aa1099fd4c6694e8121afbb85cd2f1613c9469bff04016d72d8fbe","observation_id":"ee140365-ed08-4c97-964d-69a31b5217e6","resolution":{"observed_at":"2026-08-15T18:33:48.209747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.193867Z","title":"Normalized cross- correlation for spherical images","venue":null,"work_id":"339c5685-716b-4849-9472-3f9bcef3842e","year":2004},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.796441Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:1b4cc2fba6d40e6632691d1625f7f81980eadaf2ba437b9a65e97343b62ad2f2","observation_id":"34a9cdda-37c7-4157-840d-548bac3b0b27","resolution":{"observed_at":"2026-08-15T18:33:48.198407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.181922Z","title":"Efficient global point cloud alignment us- ing bayesian nonparametric mixtures","venue":null,"work_id":"d53f69f1-9249-47e0-8117-5638250d035a","year":2017},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.799922Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:f00b41ec2a301287c26e36548c1151d928f92a659e15d249c2f8f8baa359769f","observation_id":"b53a73e9-3fbf-44ac-9468-c280f666b225","resolution":{"observed_at":"2026-08-15T18:33:48.185622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.171735Z","title":"Ransic: Fast and highly robust estimation for rota- tion search and point cloud registration using invariant com- patibility","venue":null,"work_id":"c3696d1a-c5b2-404b-bc30-45d300d19810","year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.803437Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:ebc6783d30d446494acc751bd190f53ce4b13e19882bd5bff274fd5452faeddd","observation_id":"f938f1c7-7a2c-4c6f-90f9-b549fef0d158","resolution":{"observed_at":"2026-08-15T18:33:48.175519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.161666Z","title":"Peng, and Luca Carlone","venue":null,"work_id":"ec3eedb1-cbe8-4dbc-b0be-9693a401ba29","year":2023},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.806896Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:9dbc8ed15438790926d3886fe4c3b7fada67a891a4e968b8f4e04e6169313541","observation_id":"189cf120-1fbd-4f3b-b8c0-7ce31d8e85e2","resolution":{"observed_at":"2026-08-15T18:33:48.164639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.152530Z","title":"Per- formance evaluation of 3d keypoint detectors","venue":null,"work_id":"7b707dfc-c323-400a-967f-4a88a3af9f0b","year":2013},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.810206Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:e3c59b48cde851772c2436664451d3b622e6ca83db62212291aa9df313483978","observation_id":"12b55012-7893-4200-8e86-93726633573b","resolution":{"observed_at":"2026-08-15T18:33:48.155746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.143058Z","title":"A least squares estimate of satellite attitude","venue":null,"work_id":"78e9d912-fa92-4373-a37a-dfcce3038b3f","year":1965},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.813275Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:f04b9281d14784e011c9d89e5c3f84aba2fc5dbf99cd7acb22af3b3c36be0b68","observation_id":"a7cc230b-a1fc-4b82-b242-f10d0d42fe51","resolution":{"observed_at":"2026-08-15T18:33:48.146280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.132346Z","title":"3d shapenets: A deep representation for volumetric shapes","venue":null,"work_id":"4707c69d-e75a-4261-9d15-2d3b750877fb","year":1912},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.816421Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:ad3dee4b900f336d9c983d8a9d0f2777be719a767e7abf1ac4d5aa2db12c81a1","observation_id":"f5b51c3c-9eee-4da9-a849-6327277d1df2","resolution":{"observed_at":"2026-08-15T18:33:48.136195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.120733Z","title":"A quaternion-based certifi- ably optimal solution to the wahba problem with outliers","venue":null,"work_id":"81d38017-c484-4115-a496-fb78dcd40b35","year":2019},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.819514Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:1fa476e1d3913f54a11a666dee8d592708e54c788ec4f93795742823dbdac3ab","observation_id":"132b66b2-ef94-4a81-ac2a-c9e420dd90eb","resolution":{"observed_at":"2026-08-15T18:33:48.124617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.109046Z","title":"Graduated non-convexity for robust spatial perception: From non-minimal solvers to global outlier re- jection","venue":null,"work_id":"1260e2de-7f9c-4e59-a292-d8ab4285c2b5","year":2020},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.822862Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:8a52bf98ab49c6854c67af915fa60b596db6db96fc12d2d19e3a6f33c843d38f","observation_id":"5ee2f94e-2061-4531-abe0-259a7dd34c27","resolution":{"observed_at":"2026-08-15T18:33:48.113020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.098640Z","title":"Teaser: Fast and certifiable point cloud registration","venue":null,"work_id":"89e5e83c-99a4-49c3-8a1a-106ada5ab919","year":2020},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.826279Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:bc59bc7d834df8f6edae0d6df0f7bc4075b2eaf1cd6f1458844c36629bc96509","observation_id":"b9b83ae4-c3f4-42aa-bd8c-aad7346f0c94","resolution":{"observed_at":"2026-08-15T18:33:48.102405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.088467Z","title":"Go-icp: A globally optimal solution to 3d icp point- set registration","venue":null,"work_id":"5d560d63-2f72-41cb-871f-ca1643694409","year":2015},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.829806Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:edf9ea5c31dba43c53ec8f1011b884cbf84b531882aafcb4c0e8040cd6a651fc","observation_id":"70a6902e-cd37-49ca-af53-e6bcbf7c0e6f","resolution":{"observed_at":"2026-08-15T18:33:48.092061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.077863Z","title":"Rpm-net: Robust point matching using learned features","venue":null,"work_id":"92f8b4e2-1177-4c1e-a560-c2e922ca4a21","year":2020},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.833071Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:ef3131726fd68e424ac727493e701a35c89aea8f8ddbd88fb9895d689fd99c7f","observation_id":"1fd7263d-e22f-457f-ab2d-3879a6602fb4","resolution":{"observed_at":"2026-08-15T18:33:48.081474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.066841Z","title":"EGST: Enhanced geometric structure transformer for point cloud registration","venue":null,"work_id":"583ddc1b-04e9-49d0-bec6-0df1b046b0e7","year":2024},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.835769Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:402c51f19cfefe04b34d4ed580711082e2d9d75cd9bcbdf6a2286bc7413ae347","observation_id":"79adb5e1-6b1b-42ce-a8f6-2bd306a37bec","resolution":{"observed_at":"2026-08-15T18:33:48.071091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.838483Z","title":"3dmatch: Learning local geometric descriptors from rgb-d reconstruc- tions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.838483Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:84ed2efee446ef15dd8fcebf50327fa7bc6927dee93e6b13f3b1d79612e8abac","observation_id":"2c6eeb08-c986-4505-8c76-6a092f727755","resolution":{"observed_at":"2026-08-15T18:33:47.838483Z","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-15T18:33:48.048705Z","title":"Unsupervised learning for spherical surface registration","venue":null,"work_id":"1db44c14-8d16-4383-83d4-9eb9f2f2a9dc","year":2020},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.841123Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:56eeded9fc584d41e0afd6fe175445d3a126ab4c34697b46dc9ad039a5a70f0e","observation_id":"e29047b5-9130-47e1-870d-fb3d60a78a2a","resolution":{"observed_at":"2026-08-15T18:33:48.052747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.038171Z","title":"S3reg: superfast spherical surface registration based on deep learn- ing","venue":null,"work_id":"55d0a92e-803c-451f-bb28-dd48a4406a6b","year":1964},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.843872Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:36bcff2154368974f4318f33c79e8d5ea5a8b23322592df76ecbc76d0f20de93","observation_id":"1e76b651-91f3-48d3-b3bb-774d64f204d2","resolution":{"observed_at":"2026-08-15T18:33:48.041846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.028417Z","title":"Centroidreg: A global-to-local framework for partial point cloud registration","venue":null,"work_id":"7c49bc92-fab9-472c-bc5b-04845bcfd13d","year":2021},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.846520Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:6c1e76bd900398691b6c8c12bbd067f6495f013410f41496715f9d430f3decb7","observation_id":"3cbb6247-f989-43c7-a7a2-73d1ef34036b","resolution":{"observed_at":"2026-08-15T18:33:48.031795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.017989Z","title":"special orthogonal group","venue":null,"work_id":"3e2df3a5-ada1-47e7-b310-cf3474d01dc8","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.849133Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:e745d9795dc7341c6ef47941df8c29ce62e8b40b9610d3972c273ae847b61e11","observation_id":"891abf0b-23a8-46f2-a0f5-f7a33934c0d9","resolution":{"observed_at":"2026-08-15T18:33:48.021641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.007556Z","title":"Our method is analogous to this idea in the spherical domain, where the azimuthal shift—after mean alignment and projec- tion—corresponds to a 1D phase shift","venue":null,"work_id":"f3a76ec6-6c0e-4e3e-8de7-ea7b1898e6db","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.852622Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:a7d7ef1166a51a76710b7f184692de748a88d17d0c1275541a50118f475cee36","observation_id":"d7d0e4a3-53b7-4a3b-8370-891e69e948c7","resolution":{"observed_at":"2026-08-15T18:33:48.010818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.995191Z","title":"Ro- bust Vector Alignment Dataset","venue":null,"work_id":"c1b87609-17ec-48c7-9059-487d19726c21","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.855822Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:761d6b4972221c622bc33b2f7f7470b73588bdd529a628e7df3ff42dfb8f902e","observation_id":"b36675f4-9678-4c98-a20f-715db3e2a180","resolution":{"observed_at":"2026-08-15T18:33:47.999266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.983321Z","title":"Dataset Preparation From the ModelNet40 dataset [72], we selected 166 ob- jects from 35 object classes","venue":null,"work_id":"31041d12-addb-46a4-a1f6-4ebbb6d1fa56","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.859764Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:e5553087213e472e56b2283fa10cd44aa941a868a34d2d1122a256348e323da2","observation_id":"e067a4c6-cf7a-4b2f-a26d-c2036535659e","resolution":{"observed_at":"2026-08-15T18:33:47.987173Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.971839Z","title":null,"venue":null,"work_id":"da161e2c-7cd9-48aa-bcb9-63daaff8759b","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.863137Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:b4dca0607e25812dbcf113bbb135d3042f897b5dc455fdfba79a00da5a5fdd01","observation_id":"a9d87206-6ea6-42ea-9df4-d060a29a1329","resolution":{"observed_at":"2026-08-15T18:33:47.975552Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.960746Z","title":null,"venue":null,"work_id":"b66b241d-3341-4cd9-b3b7-752d576d0584","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.866452Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:2f5817f2df7d35ea633beeba8421168344b65dfa04b8236e9322e8083620a183","observation_id":"81d38a10-b742-4e89-b168-c1c388f2cee4","resolution":{"observed_at":"2026-08-15T18:33:47.964116Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.950462Z","title":"No correlation and No Noise","venue":null,"work_id":"161cb97f-c29f-4bdb-b29c-06c72c0d4510","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.869912Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:84c3f4b5cc331fc1157c0a4b186408babad8726bc116eb62edeaea7c2d42c8b9","observation_id":"907e42ea-79d6-472c-bf28-59b831db6e43","resolution":{"observed_at":"2026-08-15T18:33:47.953973Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:47.937594Z","title":"5.3 in the main text), the choice of threshold value is crucial","venue":null,"work_id":"3c94b667-514e-46da-af95-198ba4d39925","year":null},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.873101Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:17c2499dfbd1046a84d4e2097d64b64f3ade5ba6c4a2e99291a8331918018106","observation_id":"4244e3c8-dde8-4132-80c4-536395784921","resolution":{"observed_at":"2026-08-15T18:33:47.943432Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:33:48.359057Z","title":"IEEE, 2004","venue":null,"work_id":"7f0f46f8-f764-4e75-be5f-fd6b2d0a1662","year":2004},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.724914Z"},"links":{"citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:423f4d7b6916f68ed77ac2a0cc3f26ac3e0ee753457ff8e3385b4f2b19b8aa0f","observation_id":"b09b8e50-cf5f-4cc4-a4bc-31f6be4c1d92","resolution":{"observed_at":"2026-08-15T18:33:48.363087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration"},"reference_resolution":{"displayed":91,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":66},"total_outbound_references":91},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 91 of 91 outbound references and 0 inbound Pith citation observations for arXiv:2508.02339."}