{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YBYG262XOVIHQTSWHRVDUVTXAY","short_pith_number":"pith:YBYG262X","schema_version":"1.0","canonical_sha256":"c0706d7b577550784e563c6a3a56770611e5ba3a04e84337c3f4b17c2e8a213f","source":{"kind":"arxiv","id":"2304.14961","version":1},"attestation_state":"computed","paper":{"title":"Solving constrained Procrustes problems: a conic optimization approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"M\\'aria Trnovsk\\'a, Ter\\'ezia Fulov\\'a","submitted_at":"2023-04-28T16:29:26Z","abstract_excerpt":"Procrustes problems are matrix approximation problems searching for a~transformation of the given dataset to fit another dataset. They find applications in numerous areas, such as factor and multivariate analysis, computer vision, multidimensional scaling or finance. The known methods for solving Procrustes problems have been designed to handle specific sub-classes, where the set of feasible solutions has a special structure (e.g. a Stiefel manifold), and the objective function is defined using a specific matrix norm (typically the Frobenius norm). We show that a wide class of Procrustes probl"},"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":"2304.14961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-28T16:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"3c18622737fb49c3d3be64678890a71737210111e60dd9c9f1efef19d33daa56","abstract_canon_sha256":"fe7c2befc905e450a91d2ce4b7241494ec341d64c9eadf6bf774bd609febccb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:05:22.770616Z","signature_b64":"AurUF3RQV12UnBUKM9EpQWAjWPG3LEY+0LAhEWZheKd1qaPkA0DDaSU7BIzwEeLM0IXtNT5ouYw49emZGAr3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0706d7b577550784e563c6a3a56770611e5ba3a04e84337c3f4b17c2e8a213f","last_reissued_at":"2026-07-05T06:05:22.770187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:05:22.770187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving constrained Procrustes problems: a conic optimization approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"M\\'aria Trnovsk\\'a, Ter\\'ezia Fulov\\'a","submitted_at":"2023-04-28T16:29:26Z","abstract_excerpt":"Procrustes problems are matrix approximation problems searching for a~transformation of the given dataset to fit another dataset. They find applications in numerous areas, such as factor and multivariate analysis, computer vision, multidimensional scaling or finance. The known methods for solving Procrustes problems have been designed to handle specific sub-classes, where the set of feasible solutions has a special structure (e.g. a Stiefel manifold), and the objective function is defined using a specific matrix norm (typically the Frobenius norm). We show that a wide class of Procrustes probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.14961","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/2304.14961/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":"2304.14961","created_at":"2026-07-05T06:05:22.770250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.14961v1","created_at":"2026-07-05T06:05:22.770250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.14961","created_at":"2026-07-05T06:05:22.770250+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBYG262XOVIH","created_at":"2026-07-05T06:05:22.770250+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBYG262XOVIHQTSW","created_at":"2026-07-05T06:05:22.770250+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBYG262X","created_at":"2026-07-05T06:05:22.770250+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23560","citing_title":"A modified Riemannian Levenberg-Marquardt Algorithm for robust or constraint optimization on manifolds","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY","json":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY.json","graph_json":"https://pith.science/api/pith-number/YBYG262XOVIHQTSWHRVDUVTXAY/graph.json","events_json":"https://pith.science/api/pith-number/YBYG262XOVIHQTSWHRVDUVTXAY/events.json","paper":"https://pith.science/paper/YBYG262X"},"agent_actions":{"view_html":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY","download_json":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY.json","view_paper":"https://pith.science/paper/YBYG262X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.14961&json=true","fetch_graph":"https://pith.science/api/pith-number/YBYG262XOVIHQTSWHRVDUVTXAY/graph.json","fetch_events":"https://pith.science/api/pith-number/YBYG262XOVIHQTSWHRVDUVTXAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY/action/storage_attestation","attest_author":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY/action/author_attestation","sign_citation":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY/action/citation_signature","submit_replication":"https://pith.science/pith/YBYG262XOVIHQTSWHRVDUVTXAY/action/replication_record"}},"created_at":"2026-07-05T06:05:22.770250+00:00","updated_at":"2026-07-05T06:05:22.770250+00:00"}