{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NT34AMVUBXT7I3WRHZMM4MB3B6","short_pith_number":"pith:NT34AMVU","schema_version":"1.0","canonical_sha256":"6cf7c032b40de7f46ed13e58ce303b0f90b9f6f31c504bf8eb51c074250056c0","source":{"kind":"arxiv","id":"2508.02339","version":1},"attestation_state":"computed","paper":{"title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Alan T. Asbeck, Anik Sarker","submitted_at":"2025-08-04T12:21:05Z","abstract_excerpt":"Existing methods for rotation estimation between two spherical ($\\mathbb{S}^2$) patterns typically rely on spherical cross-correlation maximization between two spherical function. However, these approaches exhibit computational complexities greater than cubic $O(n^3)$ with respect to rotation space discretization and lack extensive evaluation under significant outlier contamination. To this end, we propose a rotation estimation algorithm between two spherical patterns with linear time complexity $O(n)$. Unlike existing spherical-function-based methods, we explicitly represent spherical pattern"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.02339","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-08-04T12:21:05Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"a46242fd636c0675eae763a010d900b5cec7991eb4f5e97d8722a4b4a1807f6a","abstract_canon_sha256":"8d0dbb6c174844a7676edb6a249a970e8c9d24d064f09b2e8de2ae09a29a23f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:12.639876Z","signature_b64":"BWRufUTAfsbTKJeyhYwrP9OBrRrVJ+yr08tMyI0tYrxQl13DKv77Bd4G2DYE/fkJER4ch74DQyI01mmpvG0TDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cf7c032b40de7f46ed13e58ce303b0f90b9f6f31c504bf8eb51c074250056c0","last_reissued_at":"2026-07-05T11:48:12.639302Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:12.639302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Alan T. Asbeck, Anik Sarker","submitted_at":"2025-08-04T12:21:05Z","abstract_excerpt":"Existing methods for rotation estimation between two spherical ($\\mathbb{S}^2$) patterns typically rely on spherical cross-correlation maximization between two spherical function. However, these approaches exhibit computational complexities greater than cubic $O(n^3)$ with respect to rotation space discretization and lack extensive evaluation under significant outlier contamination. To this end, we propose a rotation estimation algorithm between two spherical patterns with linear time complexity $O(n)$. Unlike existing spherical-function-based methods, we explicitly represent spherical pattern"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02339","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.02339/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.02339","created_at":"2026-07-05T11:48:12.639392+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.02339v1","created_at":"2026-07-05T11:48:12.639392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02339","created_at":"2026-07-05T11:48:12.639392+00:00"},{"alias_kind":"pith_short_12","alias_value":"NT34AMVUBXT7","created_at":"2026-07-05T11:48:12.639392+00:00"},{"alias_kind":"pith_short_16","alias_value":"NT34AMVUBXT7I3WR","created_at":"2026-07-05T11:48:12.639392+00:00"},{"alias_kind":"pith_short_8","alias_value":"NT34AMVU","created_at":"2026-07-05T11:48:12.639392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6","json":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6.json","graph_json":"https://pith.science/api/pith-number/NT34AMVUBXT7I3WRHZMM4MB3B6/graph.json","events_json":"https://pith.science/api/pith-number/NT34AMVUBXT7I3WRHZMM4MB3B6/events.json","paper":"https://pith.science/paper/NT34AMVU"},"agent_actions":{"view_html":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6","download_json":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6.json","view_paper":"https://pith.science/paper/NT34AMVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.02339&json=true","fetch_graph":"https://pith.science/api/pith-number/NT34AMVUBXT7I3WRHZMM4MB3B6/graph.json","fetch_events":"https://pith.science/api/pith-number/NT34AMVUBXT7I3WRHZMM4MB3B6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6/action/storage_attestation","attest_author":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6/action/author_attestation","sign_citation":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6/action/citation_signature","submit_replication":"https://pith.science/pith/NT34AMVUBXT7I3WRHZMM4MB3B6/action/replication_record"}},"created_at":"2026-07-05T11:48:12.639392+00:00","updated_at":"2026-07-05T11:48:12.639392+00:00"}