{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4ZYIKQYRL7RG47RKBNVSKEQPTX","short_pith_number":"pith:4ZYIKQYR","schema_version":"1.0","canonical_sha256":"e6708543115fe26e7e2a0b6b25120f9df7b7ce53091cff651e39ebeca5701c19","source":{"kind":"arxiv","id":"1211.2441","version":4},"attestation_state":"computed","paper":{"title":"Exact and Stable Recovery of Rotations for Robust Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amit Singer, Lanhui Wang","submitted_at":"2012-11-11T17:44:34Z","abstract_excerpt":"The synchronization problem over the special orthogonal group $SO(d)$ consists of estimating a set of unknown rotations $R_1,R_2,...,R_n$ from noisy measurements of a subset of their pairwise ratios $R_{i}^{-1}R_{j}$. The problem has found applications in computer vision, computer graphics, and sensor network localization, among others. Its least squares solution can be approximated by either spectral relaxation or semidefinite programming followed by a rounding procedure, analogous to the approximation algorithms of \\textsc{Max-Cut}. The contribution of this paper is three-fold: First, we int"},"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":"1211.2441","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-11T17:44:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b07d4e669d8e1a34eefa0e533911f3f6cddad457175832631235b7778e5aeba6","abstract_canon_sha256":"2f9058a53d6f7c8acddd7d560f2624673ae0bdb2eb25a0c1fb2ee60170fb04fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:20.382446Z","signature_b64":"1ceZEhJ2hh/bYZUifM5jda069Sp8rajm+2BgjvAJuFDSSVMrzjPf2cduiCiz+HyPVrg4L5gdQ90zEDuB57ccCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6708543115fe26e7e2a0b6b25120f9df7b7ce53091cff651e39ebeca5701c19","last_reissued_at":"2026-05-18T03:18:20.382050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:20.382050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact and Stable Recovery of Rotations for Robust Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amit Singer, Lanhui Wang","submitted_at":"2012-11-11T17:44:34Z","abstract_excerpt":"The synchronization problem over the special orthogonal group $SO(d)$ consists of estimating a set of unknown rotations $R_1,R_2,...,R_n$ from noisy measurements of a subset of their pairwise ratios $R_{i}^{-1}R_{j}$. The problem has found applications in computer vision, computer graphics, and sensor network localization, among others. Its least squares solution can be approximated by either spectral relaxation or semidefinite programming followed by a rounding procedure, analogous to the approximation algorithms of \\textsc{Max-Cut}. The contribution of this paper is three-fold: First, we int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2441","kind":"arxiv","version":4},"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":"1211.2441","created_at":"2026-05-18T03:18:20.382106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2441v4","created_at":"2026-05-18T03:18:20.382106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2441","created_at":"2026-05-18T03:18:20.382106+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZYIKQYRL7RG","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZYIKQYRL7RG47RK","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZYIKQYR","created_at":"2026-05-18T12:26:53.410803+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/4ZYIKQYRL7RG47RKBNVSKEQPTX","json":"https://pith.science/pith/4ZYIKQYRL7RG47RKBNVSKEQPTX.json","graph_json":"https://pith.science/api/pith-number/4ZYIKQYRL7RG47RKBNVSKEQPTX/graph.json","events_json":"https://pith.science/api/pith-number/4ZYIKQYRL7RG47RKBNVSKEQPTX/events.json","paper":"https://pith.science/paper/4ZYIKQYR"},"agent_actions":{"view_html":"https://pith.science/pith/4ZYIKQYRL7RG47RKBNVSKEQPTX","download_json":"https://pith.science/pith/4ZYIKQYRL7RG47RKBNVSKEQPTX.json","view_paper":"https://pith.science/paper/4ZYIKQYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2441&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZYIKQYRL7RG47RKBNVSKEQPTX/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZYIKQYRL7RG47RKBNVSKEQPTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZYIKQYRL7RG47RKBNVSKEQPTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZYIKQYRL7RG47RKBNVSKEQPTX/action/storage_attestation","attest_author":"https://pith.science/pith/4ZYIKQYRL7RG47RKBNVSKEQPTX/action/author_attestation","sign_citation":"https://pith.science/pith/4ZYIKQYRL7RG47RKBNVSKEQPTX/action/citation_signature","submit_replication":"https://pith.science/pith/4ZYIKQYRL7RG47RKBNVSKEQPTX/action/replication_record"}},"created_at":"2026-05-18T03:18:20.382106+00:00","updated_at":"2026-05-18T03:18:20.382106+00:00"}