{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Q6GFLPUTOX6UI36A5DFMXV6CX5","short_pith_number":"pith:Q6GFLPUT","schema_version":"1.0","canonical_sha256":"878c55be9375fd446fc0e8cacbd7c2bf4ecb0169d715f222d63be6dd1c93b1de","source":{"kind":"arxiv","id":"2309.14660","version":5},"attestation_state":"computed","paper":{"title":"CoFiI2P: Coarse-to-Fine Correspondences for Image-to-Point Cloud Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.CV","authors_text":"Bisheng Yang, Fangning Li, Fuxun Liang, Jianping Li, Shuhao Kang, Xianghong Zou, Xieyuanli Chen, Youqi Liao, Yuhao Li, Zhen Dong","submitted_at":"2023-09-26T04:32:38Z","abstract_excerpt":"Image-to-point cloud (I2P) registration is a fundamental task for robots and autonomous vehicles to achieve cross-modality data fusion and localization. Current I2P registration methods primarily focus on estimating correspondences at the point or pixel level, often neglecting global alignment. As a result, I2P matching can easily converge to a local optimum if it lacks high-level guidance from global constraints. To improve the success rate and general robustness, this paper introduces CoFiI2P, a novel I2P registration network that extracts correspondences in a coarse-to-fine manner. First, t"},"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":"2309.14660","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-09-26T04:32:38Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"bc4d9da4bf3daff9852e27a183b7d3e32d7622a821967c544dcc8385a44f1fc1","abstract_canon_sha256":"8fba16d6df8620041d881832e2e2541354aa2c10dd9683cd4e2aaea96407b5db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:00.869673Z","signature_b64":"HUqzoqZnyluYWS6Rm9DvyG4k67qGnRw0VrDVXWeiO1pAevqeQ4djxB7tegRWoOn9m6GD7faXDHD22QgIxfTNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"878c55be9375fd446fc0e8cacbd7c2bf4ecb0169d715f222d63be6dd1c93b1de","last_reissued_at":"2026-07-05T09:06:00.869239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:00.869239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoFiI2P: Coarse-to-Fine Correspondences for Image-to-Point Cloud Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.CV","authors_text":"Bisheng Yang, Fangning Li, Fuxun Liang, Jianping Li, Shuhao Kang, Xianghong Zou, Xieyuanli Chen, Youqi Liao, Yuhao Li, Zhen Dong","submitted_at":"2023-09-26T04:32:38Z","abstract_excerpt":"Image-to-point cloud (I2P) registration is a fundamental task for robots and autonomous vehicles to achieve cross-modality data fusion and localization. Current I2P registration methods primarily focus on estimating correspondences at the point or pixel level, often neglecting global alignment. As a result, I2P matching can easily converge to a local optimum if it lacks high-level guidance from global constraints. To improve the success rate and general robustness, this paper introduces CoFiI2P, a novel I2P registration network that extracts correspondences in a coarse-to-fine manner. First, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14660","kind":"arxiv","version":5},"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/2309.14660/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":"2309.14660","created_at":"2026-07-05T09:06:00.869295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14660v5","created_at":"2026-07-05T09:06:00.869295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14660","created_at":"2026-07-05T09:06:00.869295+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6GFLPUTOX6U","created_at":"2026-07-05T09:06:00.869295+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6GFLPUTOX6UI36A","created_at":"2026-07-05T09:06:00.869295+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6GFLPUT","created_at":"2026-07-05T09:06:00.869295+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21364","citing_title":"CA-I2P: Channel-Adaptive Registration Network with Global Optimal Selection","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5","json":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5.json","graph_json":"https://pith.science/api/pith-number/Q6GFLPUTOX6UI36A5DFMXV6CX5/graph.json","events_json":"https://pith.science/api/pith-number/Q6GFLPUTOX6UI36A5DFMXV6CX5/events.json","paper":"https://pith.science/paper/Q6GFLPUT"},"agent_actions":{"view_html":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5","download_json":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5.json","view_paper":"https://pith.science/paper/Q6GFLPUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14660&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6GFLPUTOX6UI36A5DFMXV6CX5/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6GFLPUTOX6UI36A5DFMXV6CX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5/action/storage_attestation","attest_author":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5/action/author_attestation","sign_citation":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5/action/citation_signature","submit_replication":"https://pith.science/pith/Q6GFLPUTOX6UI36A5DFMXV6CX5/action/replication_record"}},"created_at":"2026-07-05T09:06:00.869295+00:00","updated_at":"2026-07-05T09:06:00.869295+00:00"}