{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ABSDZGBLUZBL2THYMJJKNWBA4D","short_pith_number":"pith:ABSDZGBL","schema_version":"1.0","canonical_sha256":"00643c982ba642bd4cf86252a6d820e0df7049587f13c0652b54b9e158d50a3c","source":{"kind":"arxiv","id":"2411.15271","version":1},"attestation_state":"computed","paper":{"title":"EADReg: Probabilistic Correspondence Generation with Efficient Autoregressive Diffusion Model for Outdoor Point Cloud Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Hesheng Wang, Jiuming Liu, Junyi Ma, Lihao Liu, Linrui Gong, Yaonan Wang","submitted_at":"2024-11-22T13:03:54Z","abstract_excerpt":"Diffusion models have shown the great potential in the point cloud registration (PCR) task, especially for enhancing the robustness to challenging cases. However, existing diffusion-based PCR methods primarily focus on instance-level scenarios and struggle with outdoor LiDAR points, where the sparsity, irregularity, and huge point scale inherent in LiDAR points pose challenges to establishing dense global point-to-point correspondences. To address this issue, we propose a novel framework named EADReg for efficient and robust registration of LiDAR point clouds based on autoregressive diffusion "},"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":"2411.15271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-11-22T13:03:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1a2421d76d3b16a39f24c58d3118657a5a91f1827b1d5b43aecd20105af12e03","abstract_canon_sha256":"6844542c36ef9df91c2a3c76262940d50ce58b568c07e1fdfb0e2da732cd4afd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:32.222534Z","signature_b64":"q+CeOWj2O6tWrXYjBeHNyN4F5LoigDq4TVdqLPtn8A5l3xByHrmC2/PhJduvOddL9pcxzmqGnOvFHAL4Y5WhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00643c982ba642bd4cf86252a6d820e0df7049587f13c0652b54b9e158d50a3c","last_reissued_at":"2026-07-05T09:39:32.222056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:32.222056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EADReg: Probabilistic Correspondence Generation with Efficient Autoregressive Diffusion Model for Outdoor Point Cloud Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Hesheng Wang, Jiuming Liu, Junyi Ma, Lihao Liu, Linrui Gong, Yaonan Wang","submitted_at":"2024-11-22T13:03:54Z","abstract_excerpt":"Diffusion models have shown the great potential in the point cloud registration (PCR) task, especially for enhancing the robustness to challenging cases. However, existing diffusion-based PCR methods primarily focus on instance-level scenarios and struggle with outdoor LiDAR points, where the sparsity, irregularity, and huge point scale inherent in LiDAR points pose challenges to establishing dense global point-to-point correspondences. To address this issue, we propose a novel framework named EADReg for efficient and robust registration of LiDAR point clouds based on autoregressive diffusion "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15271","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/2411.15271/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":"2411.15271","created_at":"2026-07-05T09:39:32.222112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15271v1","created_at":"2026-07-05T09:39:32.222112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15271","created_at":"2026-07-05T09:39:32.222112+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABSDZGBLUZBL","created_at":"2026-07-05T09:39:32.222112+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABSDZGBLUZBL2THY","created_at":"2026-07-05T09:39:32.222112+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABSDZGBL","created_at":"2026-07-05T09:39:32.222112+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00582","citing_title":"Safe and Efficient Lane-Changing for Autonomous Vehicles: An Improved Double Quintic Polynomial Approach with Time-to-Collision Evaluation","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D","json":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D.json","graph_json":"https://pith.science/api/pith-number/ABSDZGBLUZBL2THYMJJKNWBA4D/graph.json","events_json":"https://pith.science/api/pith-number/ABSDZGBLUZBL2THYMJJKNWBA4D/events.json","paper":"https://pith.science/paper/ABSDZGBL"},"agent_actions":{"view_html":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D","download_json":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D.json","view_paper":"https://pith.science/paper/ABSDZGBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15271&json=true","fetch_graph":"https://pith.science/api/pith-number/ABSDZGBLUZBL2THYMJJKNWBA4D/graph.json","fetch_events":"https://pith.science/api/pith-number/ABSDZGBLUZBL2THYMJJKNWBA4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D/action/storage_attestation","attest_author":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D/action/author_attestation","sign_citation":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D/action/citation_signature","submit_replication":"https://pith.science/pith/ABSDZGBLUZBL2THYMJJKNWBA4D/action/replication_record"}},"created_at":"2026-07-05T09:39:32.222112+00:00","updated_at":"2026-07-05T09:39:32.222112+00:00"}