{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RK2SE6WELSXPJ42C4XYKRL75W7","short_pith_number":"pith:RK2SE6WE","schema_version":"1.0","canonical_sha256":"8ab5227ac45caef4f342e5f0a8affdb7e523eaab4d8b6b9f30f27d1d2d7034be","source":{"kind":"arxiv","id":"1705.01362","version":2},"attestation_state":"computed","paper":{"title":"Rotation Averaging and Strong Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anders Eriksson, Carl Olsson, Fredrik Kahl, Tat-Jun Chin","submitted_at":"2017-05-03T11:17:18Z","abstract_excerpt":"In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of computer vision applications. In its conventional form, rotation averaging is stated as a minimization over multiple rotation constraints. As these constraints are non-convex, this problem is generally considered challenging to solve globally. We show how to circumvent this difficulty through the use of Lagrangian duality. While such an approach is well-known it is normally not guaranteed to provide a tight relaxation. Based on spectral graph theory, we analyt"},"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":"1705.01362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-03T11:17:18Z","cross_cats_sorted":[],"title_canon_sha256":"221b3f6c986047219630a2944a89bd9b66d7a4fb25af9e734e2e3afcbd67fcf6","abstract_canon_sha256":"8901b86928d8f58e975101d2f913831929c8d242d10a98a023307bf3549703bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:18.769351Z","signature_b64":"c3MBVzWDkJkw3SZ/3ypnHN+xzXTeFH5aotTyMeAITLvAQTStajRVDGxIEO3GHklyBBiQKKp+BQxty1mpJNCVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ab5227ac45caef4f342e5f0a8affdb7e523eaab4d8b6b9f30f27d1d2d7034be","last_reissued_at":"2026-05-18T00:29:18.768690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:18.768690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rotation Averaging and Strong Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anders Eriksson, Carl Olsson, Fredrik Kahl, Tat-Jun Chin","submitted_at":"2017-05-03T11:17:18Z","abstract_excerpt":"In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of computer vision applications. In its conventional form, rotation averaging is stated as a minimization over multiple rotation constraints. As these constraints are non-convex, this problem is generally considered challenging to solve globally. We show how to circumvent this difficulty through the use of Lagrangian duality. While such an approach is well-known it is normally not guaranteed to provide a tight relaxation. Based on spectral graph theory, we analyt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01362","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1705.01362","created_at":"2026-05-18T00:29:18.768794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01362v2","created_at":"2026-05-18T00:29:18.768794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01362","created_at":"2026-05-18T00:29:18.768794+00:00"},{"alias_kind":"pith_short_12","alias_value":"RK2SE6WELSXP","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RK2SE6WELSXPJ42C","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RK2SE6WE","created_at":"2026-05-18T12:31:39.905425+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/RK2SE6WELSXPJ42C4XYKRL75W7","json":"https://pith.science/pith/RK2SE6WELSXPJ42C4XYKRL75W7.json","graph_json":"https://pith.science/api/pith-number/RK2SE6WELSXPJ42C4XYKRL75W7/graph.json","events_json":"https://pith.science/api/pith-number/RK2SE6WELSXPJ42C4XYKRL75W7/events.json","paper":"https://pith.science/paper/RK2SE6WE"},"agent_actions":{"view_html":"https://pith.science/pith/RK2SE6WELSXPJ42C4XYKRL75W7","download_json":"https://pith.science/pith/RK2SE6WELSXPJ42C4XYKRL75W7.json","view_paper":"https://pith.science/paper/RK2SE6WE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01362&json=true","fetch_graph":"https://pith.science/api/pith-number/RK2SE6WELSXPJ42C4XYKRL75W7/graph.json","fetch_events":"https://pith.science/api/pith-number/RK2SE6WELSXPJ42C4XYKRL75W7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RK2SE6WELSXPJ42C4XYKRL75W7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RK2SE6WELSXPJ42C4XYKRL75W7/action/storage_attestation","attest_author":"https://pith.science/pith/RK2SE6WELSXPJ42C4XYKRL75W7/action/author_attestation","sign_citation":"https://pith.science/pith/RK2SE6WELSXPJ42C4XYKRL75W7/action/citation_signature","submit_replication":"https://pith.science/pith/RK2SE6WELSXPJ42C4XYKRL75W7/action/replication_record"}},"created_at":"2026-05-18T00:29:18.768794+00:00","updated_at":"2026-05-18T00:29:18.768794+00:00"}