{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MZL42EQ23WIIZBKFR2ORYNF2UX","short_pith_number":"pith:MZL42EQ2","schema_version":"1.0","canonical_sha256":"6657cd121add908c85458e9d1c34baa5e4448e610e38dcb227ec537099e5d6a9","source":{"kind":"arxiv","id":"2207.08592","version":1},"attestation_state":"computed","paper":{"title":"Symmetrized Robust Procrustes: Constant-Factor Approximation and Exact Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.OC"],"primary_cat":"cs.LG","authors_text":"Nadav Dym, Shahar Kovalsky, Tal Amir","submitted_at":"2022-07-18T13:32:20Z","abstract_excerpt":"The classical $\\textit{Procrustes}$ problem is to find a rigid motion (orthogonal transformation and translation) that best aligns two given point-sets in the least-squares sense. The $\\textit{Robust Procrustes}$ problem is an important variant, in which a power-1 objective is used instead of least squares to improve robustness to outliers. While the optimal solution of the least-squares problem can be easily computed in closed form, dating back to Sch\\\"onemann (1966), no such solution is known for the power-1 problem. In this paper we propose a novel convex relaxation for the Robust Procruste"},"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":"2207.08592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-18T13:32:20Z","cross_cats_sorted":["cs.CG","cs.CV","math.OC"],"title_canon_sha256":"bf20cc19a5fcc69ab410ba1396708728333b0ae21337bb6df4c669aa7df50ebe","abstract_canon_sha256":"dfa7ebc568f071df1517c4656826c9d7946500f8ec7015cd83500bd66182a6b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:06.304308Z","signature_b64":"iqYm1ziQyqBnpFjHiihtqlJIFOHa3E0PErt2PJNMR7082mam+XPS7hs37LLSV6YKYlZ2DhxhGhNG5L+RLWRbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6657cd121add908c85458e9d1c34baa5e4448e610e38dcb227ec537099e5d6a9","last_reissued_at":"2026-07-05T04:41:06.303830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:06.303830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetrized Robust Procrustes: Constant-Factor Approximation and Exact Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.OC"],"primary_cat":"cs.LG","authors_text":"Nadav Dym, Shahar Kovalsky, Tal Amir","submitted_at":"2022-07-18T13:32:20Z","abstract_excerpt":"The classical $\\textit{Procrustes}$ problem is to find a rigid motion (orthogonal transformation and translation) that best aligns two given point-sets in the least-squares sense. The $\\textit{Robust Procrustes}$ problem is an important variant, in which a power-1 objective is used instead of least squares to improve robustness to outliers. While the optimal solution of the least-squares problem can be easily computed in closed form, dating back to Sch\\\"onemann (1966), no such solution is known for the power-1 problem. In this paper we propose a novel convex relaxation for the Robust Procruste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.08592","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/2207.08592/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":"2207.08592","created_at":"2026-07-05T04:41:06.303889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.08592v1","created_at":"2026-07-05T04:41:06.303889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08592","created_at":"2026-07-05T04:41:06.303889+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZL42EQ23WII","created_at":"2026-07-05T04:41:06.303889+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZL42EQ23WIIZBKF","created_at":"2026-07-05T04:41:06.303889+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZL42EQ2","created_at":"2026-07-05T04:41:06.303889+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/MZL42EQ23WIIZBKFR2ORYNF2UX","json":"https://pith.science/pith/MZL42EQ23WIIZBKFR2ORYNF2UX.json","graph_json":"https://pith.science/api/pith-number/MZL42EQ23WIIZBKFR2ORYNF2UX/graph.json","events_json":"https://pith.science/api/pith-number/MZL42EQ23WIIZBKFR2ORYNF2UX/events.json","paper":"https://pith.science/paper/MZL42EQ2"},"agent_actions":{"view_html":"https://pith.science/pith/MZL42EQ23WIIZBKFR2ORYNF2UX","download_json":"https://pith.science/pith/MZL42EQ23WIIZBKFR2ORYNF2UX.json","view_paper":"https://pith.science/paper/MZL42EQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.08592&json=true","fetch_graph":"https://pith.science/api/pith-number/MZL42EQ23WIIZBKFR2ORYNF2UX/graph.json","fetch_events":"https://pith.science/api/pith-number/MZL42EQ23WIIZBKFR2ORYNF2UX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZL42EQ23WIIZBKFR2ORYNF2UX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZL42EQ23WIIZBKFR2ORYNF2UX/action/storage_attestation","attest_author":"https://pith.science/pith/MZL42EQ23WIIZBKFR2ORYNF2UX/action/author_attestation","sign_citation":"https://pith.science/pith/MZL42EQ23WIIZBKFR2ORYNF2UX/action/citation_signature","submit_replication":"https://pith.science/pith/MZL42EQ23WIIZBKFR2ORYNF2UX/action/replication_record"}},"created_at":"2026-07-05T04:41:06.303889+00:00","updated_at":"2026-07-05T04:41:06.303889+00:00"}