{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LZ32VKBBMUJCHAZZ7VGQKZW4WS","short_pith_number":"pith:LZ32VKBB","schema_version":"1.0","canonical_sha256":"5e77aaa8216512238339fd4d0566dcb481304f360919f6f38959f2cf7f840c25","source":{"kind":"arxiv","id":"1611.00128","version":3},"attestation_state":"computed","paper":{"title":"A Certifiably Correct Algorithm for Synchronization over the Special Euclidean Group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Afonso S. Bandeira, David M. Rosen, John J. Leonard, Luca Carlone","submitted_at":"2016-11-01T04:54:35Z","abstract_excerpt":"Many geometric estimation problems take the form of synchronization over the special Euclidean group: estimate the values of a set of poses given noisy measurements of a subset of their pairwise relative transforms. This problem is typically formulated as a maximum-likelihood estimation that requires solving a nonconvex nonlinear program, which is computationally intractable in general. Nevertheless, in this paper we present an algorithm that is able to efficiently recover certifiably globally optimal solutions of this estimation problem in a non-adversarial noise regime. The crux of our appro"},"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":"1611.00128","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-01T04:54:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"79f04d1c435479c21c636481ffac11296d5f3a1757a9dd91e8c9dce0415b6bd0","abstract_canon_sha256":"6d9fd2a31cc72ed0a894380e5b847f8a6d8b78204289187b6caf3e9c6f90152c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:59.314212Z","signature_b64":"q5cTM7VwAtBmy2Gvh/2RHCTP9v7PMswKLUl7LzqwVcmPJfliMF01Sh70ZSaYs8i8Rq6z6xdvaR1U7dmhCKRRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e77aaa8216512238339fd4d0566dcb481304f360919f6f38959f2cf7f840c25","last_reissued_at":"2026-05-18T00:50:59.313685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:59.313685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Certifiably Correct Algorithm for Synchronization over the Special Euclidean Group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Afonso S. Bandeira, David M. Rosen, John J. Leonard, Luca Carlone","submitted_at":"2016-11-01T04:54:35Z","abstract_excerpt":"Many geometric estimation problems take the form of synchronization over the special Euclidean group: estimate the values of a set of poses given noisy measurements of a subset of their pairwise relative transforms. This problem is typically formulated as a maximum-likelihood estimation that requires solving a nonconvex nonlinear program, which is computationally intractable in general. Nevertheless, in this paper we present an algorithm that is able to efficiently recover certifiably globally optimal solutions of this estimation problem in a non-adversarial noise regime. The crux of our appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00128","kind":"arxiv","version":3},"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":"1611.00128","created_at":"2026-05-18T00:50:59.313770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00128v3","created_at":"2026-05-18T00:50:59.313770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00128","created_at":"2026-05-18T00:50:59.313770+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZ32VKBBMUJC","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZ32VKBBMUJCHAZZ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZ32VKBB","created_at":"2026-05-18T12:30:29.479603+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/LZ32VKBBMUJCHAZZ7VGQKZW4WS","json":"https://pith.science/pith/LZ32VKBBMUJCHAZZ7VGQKZW4WS.json","graph_json":"https://pith.science/api/pith-number/LZ32VKBBMUJCHAZZ7VGQKZW4WS/graph.json","events_json":"https://pith.science/api/pith-number/LZ32VKBBMUJCHAZZ7VGQKZW4WS/events.json","paper":"https://pith.science/paper/LZ32VKBB"},"agent_actions":{"view_html":"https://pith.science/pith/LZ32VKBBMUJCHAZZ7VGQKZW4WS","download_json":"https://pith.science/pith/LZ32VKBBMUJCHAZZ7VGQKZW4WS.json","view_paper":"https://pith.science/paper/LZ32VKBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00128&json=true","fetch_graph":"https://pith.science/api/pith-number/LZ32VKBBMUJCHAZZ7VGQKZW4WS/graph.json","fetch_events":"https://pith.science/api/pith-number/LZ32VKBBMUJCHAZZ7VGQKZW4WS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZ32VKBBMUJCHAZZ7VGQKZW4WS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZ32VKBBMUJCHAZZ7VGQKZW4WS/action/storage_attestation","attest_author":"https://pith.science/pith/LZ32VKBBMUJCHAZZ7VGQKZW4WS/action/author_attestation","sign_citation":"https://pith.science/pith/LZ32VKBBMUJCHAZZ7VGQKZW4WS/action/citation_signature","submit_replication":"https://pith.science/pith/LZ32VKBBMUJCHAZZ7VGQKZW4WS/action/replication_record"}},"created_at":"2026-05-18T00:50:59.313770+00:00","updated_at":"2026-05-18T00:50:59.313770+00:00"}