{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YROXF4THSH2ISQUJYPFQH2KMAJ","short_pith_number":"pith:YROXF4TH","schema_version":"1.0","canonical_sha256":"c45d72f26791f4894289c3cb03e94c027dc21184c2f79f34cfdbbce911f52642","source":{"kind":"arxiv","id":"2506.11547","version":1},"attestation_state":"computed","paper":{"title":"Linearly Solving Robust Rotation Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.CV","authors_text":"Tianyu Huang, Yinlong Liu, Zhi-Xin Yang","submitted_at":"2025-06-13T08:00:03Z","abstract_excerpt":"Rotation estimation plays a fundamental role in computer vision and robot tasks, and extremely robust rotation estimation is significantly useful for safety-critical applications. Typically, estimating a rotation is considered a non-linear and non-convex optimization problem that requires careful design. However, in this paper, we provide some new perspectives that solving a rotation estimation problem can be reformulated as solving a linear model fitting problem without dropping any constraints and without introducing any singularities. In addition, we explore the dual structure of a rotation"},"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":"2506.11547","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-06-13T08:00:03Z","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"title_canon_sha256":"cd2a2c59d355b205b57115541efb9ecf28a3399e1ee073ed30a4f5d1e64e9f74","abstract_canon_sha256":"9c43256be7fc06947532ce4eb11846802260ee28efff926d7155efa74a78c8d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:06.487014Z","signature_b64":"aNoG1AnDhLJ1uqLkd4fCSck4rM1NLQmx7LxmqhHF/DGOarNMGh088P80ADoT0cwfq1Zk0JdQoKx0HHr3/i99CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c45d72f26791f4894289c3cb03e94c027dc21184c2f79f34cfdbbce911f52642","last_reissued_at":"2026-07-05T11:21:06.486571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:06.486571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linearly Solving Robust Rotation Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.CV","authors_text":"Tianyu Huang, Yinlong Liu, Zhi-Xin Yang","submitted_at":"2025-06-13T08:00:03Z","abstract_excerpt":"Rotation estimation plays a fundamental role in computer vision and robot tasks, and extremely robust rotation estimation is significantly useful for safety-critical applications. Typically, estimating a rotation is considered a non-linear and non-convex optimization problem that requires careful design. However, in this paper, we provide some new perspectives that solving a rotation estimation problem can be reformulated as solving a linear model fitting problem without dropping any constraints and without introducing any singularities. In addition, we explore the dual structure of a rotation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11547","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/2506.11547/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":"2506.11547","created_at":"2026-07-05T11:21:06.486627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.11547v1","created_at":"2026-07-05T11:21:06.486627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11547","created_at":"2026-07-05T11:21:06.486627+00:00"},{"alias_kind":"pith_short_12","alias_value":"YROXF4THSH2I","created_at":"2026-07-05T11:21:06.486627+00:00"},{"alias_kind":"pith_short_16","alias_value":"YROXF4THSH2ISQUJ","created_at":"2026-07-05T11:21:06.486627+00:00"},{"alias_kind":"pith_short_8","alias_value":"YROXF4TH","created_at":"2026-07-05T11:21:06.486627+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/YROXF4THSH2ISQUJYPFQH2KMAJ","json":"https://pith.science/pith/YROXF4THSH2ISQUJYPFQH2KMAJ.json","graph_json":"https://pith.science/api/pith-number/YROXF4THSH2ISQUJYPFQH2KMAJ/graph.json","events_json":"https://pith.science/api/pith-number/YROXF4THSH2ISQUJYPFQH2KMAJ/events.json","paper":"https://pith.science/paper/YROXF4TH"},"agent_actions":{"view_html":"https://pith.science/pith/YROXF4THSH2ISQUJYPFQH2KMAJ","download_json":"https://pith.science/pith/YROXF4THSH2ISQUJYPFQH2KMAJ.json","view_paper":"https://pith.science/paper/YROXF4TH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.11547&json=true","fetch_graph":"https://pith.science/api/pith-number/YROXF4THSH2ISQUJYPFQH2KMAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YROXF4THSH2ISQUJYPFQH2KMAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YROXF4THSH2ISQUJYPFQH2KMAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YROXF4THSH2ISQUJYPFQH2KMAJ/action/storage_attestation","attest_author":"https://pith.science/pith/YROXF4THSH2ISQUJYPFQH2KMAJ/action/author_attestation","sign_citation":"https://pith.science/pith/YROXF4THSH2ISQUJYPFQH2KMAJ/action/citation_signature","submit_replication":"https://pith.science/pith/YROXF4THSH2ISQUJYPFQH2KMAJ/action/replication_record"}},"created_at":"2026-07-05T11:21:06.486627+00:00","updated_at":"2026-07-05T11:21:06.486627+00:00"}