{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G6DRLQL6TGWO27YGLE43KF5GGK","short_pith_number":"pith:G6DRLQL6","schema_version":"1.0","canonical_sha256":"378715c17e99aced7f065939b517a63287f6d6e22767a335bc069e29962f83a3","source":{"kind":"arxiv","id":"2407.16151","version":1},"attestation_state":"computed","paper":{"title":"Optimal camera-robot pose estimation in linear time from points and lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Biqiang Mu, Chulin Dai, Guangyang Zeng, Guodong Shi, Junfeng Wu, Qingcheng Zeng, Yuchen Song","submitted_at":"2024-07-23T03:27:27Z","abstract_excerpt":"Camera pose estimation is a fundamental problem in robotics. This paper focuses on two issues of interest: First, point and line features have complementary advantages, and it is of great value to design a uniform algorithm that can fuse them effectively; Second, with the development of modern front-end techniques, a large number of features can exist in a single image, which presents a potential for highly accurate robot pose estimation. With these observations, we propose AOPnP(L), an optimal linear-time camera-robot pose estimation algorithm from points and lines. Specifically, we represent"},"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":"2407.16151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-07-23T03:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"2eb49a1613b3b9e07b269145b95ca797f174c8382f91d9fde654394100a89bb2","abstract_canon_sha256":"6c0a407e1240b6508237d798a9ee9d1763da65a00cfe00789ed385c0fff12cfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:27.926574Z","signature_b64":"bRS1s6hw5HIFwUEpfjG2ShYJrljhXhzdKQAIsv9enDn7gdqeYyKmCpmNnSxZjzFGPbRMe+OgKHK2Q44SvBMLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"378715c17e99aced7f065939b517a63287f6d6e22767a335bc069e29962f83a3","last_reissued_at":"2026-07-05T08:47:27.926091Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:27.926091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal camera-robot pose estimation in linear time from points and lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Biqiang Mu, Chulin Dai, Guangyang Zeng, Guodong Shi, Junfeng Wu, Qingcheng Zeng, Yuchen Song","submitted_at":"2024-07-23T03:27:27Z","abstract_excerpt":"Camera pose estimation is a fundamental problem in robotics. This paper focuses on two issues of interest: First, point and line features have complementary advantages, and it is of great value to design a uniform algorithm that can fuse them effectively; Second, with the development of modern front-end techniques, a large number of features can exist in a single image, which presents a potential for highly accurate robot pose estimation. With these observations, we propose AOPnP(L), an optimal linear-time camera-robot pose estimation algorithm from points and lines. Specifically, we represent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.16151","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/2407.16151/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":"2407.16151","created_at":"2026-07-05T08:47:27.926153+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.16151v1","created_at":"2026-07-05T08:47:27.926153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.16151","created_at":"2026-07-05T08:47:27.926153+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6DRLQL6TGWO","created_at":"2026-07-05T08:47:27.926153+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6DRLQL6TGWO27YG","created_at":"2026-07-05T08:47:27.926153+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6DRLQL6","created_at":"2026-07-05T08:47:27.926153+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17521","citing_title":"BESTAnP: Bi-Step Efficient and Statistically Optimal Estimator for Acoustic-n-Point Problem","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK","json":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK.json","graph_json":"https://pith.science/api/pith-number/G6DRLQL6TGWO27YGLE43KF5GGK/graph.json","events_json":"https://pith.science/api/pith-number/G6DRLQL6TGWO27YGLE43KF5GGK/events.json","paper":"https://pith.science/paper/G6DRLQL6"},"agent_actions":{"view_html":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK","download_json":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK.json","view_paper":"https://pith.science/paper/G6DRLQL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.16151&json=true","fetch_graph":"https://pith.science/api/pith-number/G6DRLQL6TGWO27YGLE43KF5GGK/graph.json","fetch_events":"https://pith.science/api/pith-number/G6DRLQL6TGWO27YGLE43KF5GGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK/action/storage_attestation","attest_author":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK/action/author_attestation","sign_citation":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK/action/citation_signature","submit_replication":"https://pith.science/pith/G6DRLQL6TGWO27YGLE43KF5GGK/action/replication_record"}},"created_at":"2026-07-05T08:47:27.926153+00:00","updated_at":"2026-07-05T08:47:27.926153+00:00"}