{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7OTS4C6VMRM7SKIE6S5Y2UIDDE","short_pith_number":"pith:7OTS4C6V","schema_version":"1.0","canonical_sha256":"fba72e0bd56459f92904f4bb8d51031907e257e9a2768b73df29bf146ec7366a","source":{"kind":"arxiv","id":"1906.00587","version":1},"attestation_state":"computed","paper":{"title":"Unconstrained representation of orthogonal matrices with application to common principle components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.CO"],"primary_cat":"stat.ME","authors_text":"Antonio Punzo, Luca Bagnato","submitted_at":"2019-06-03T05:58:54Z","abstract_excerpt":"Many statistical problems involve the estimation of a $\\left(d\\times d\\right)$ orthogonal matrix $\\textbf{Q}$. Such an estimation is often challenging due to the orthonormality constraints on $\\textbf{Q}$. To cope with this problem, we propose a very simple decomposition for orthogonal matrices which we abbreviate as PLR decomposition. It produces a one-to-one correspondence between $\\textbf{Q}$ and a $\\left(d\\times d\\right)$ unit lower triangular matrix $\\textbf{L}$ whose $d\\left(d-1\\right)/2$ entries below the diagonal are unconstrained real values. Once the decomposition is applied, regardl"},"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":"1906.00587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-06-03T05:58:54Z","cross_cats_sorted":["stat.AP","stat.CO"],"title_canon_sha256":"e317914650fda695b055f9e950b794da75ed1a98016b70f8af044d7059c0dea2","abstract_canon_sha256":"f1bc2456017042bb54a90ac49da192c3ef6ef8633b3a68a62579d9122af660d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:24.442633Z","signature_b64":"yLosG671UPRqY6IAT+k0miXP1cF9nQuuxGr9lZ8DC9FiBv/o9WGiXA7XYp2adu1twTr/h2O3wTabm6Snv+qVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba72e0bd56459f92904f4bb8d51031907e257e9a2768b73df29bf146ec7366a","last_reissued_at":"2026-05-17T23:44:24.441894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:24.441894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unconstrained representation of orthogonal matrices with application to common principle components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.CO"],"primary_cat":"stat.ME","authors_text":"Antonio Punzo, Luca Bagnato","submitted_at":"2019-06-03T05:58:54Z","abstract_excerpt":"Many statistical problems involve the estimation of a $\\left(d\\times d\\right)$ orthogonal matrix $\\textbf{Q}$. Such an estimation is often challenging due to the orthonormality constraints on $\\textbf{Q}$. To cope with this problem, we propose a very simple decomposition for orthogonal matrices which we abbreviate as PLR decomposition. It produces a one-to-one correspondence between $\\textbf{Q}$ and a $\\left(d\\times d\\right)$ unit lower triangular matrix $\\textbf{L}$ whose $d\\left(d-1\\right)/2$ entries below the diagonal are unconstrained real values. Once the decomposition is applied, regardl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00587","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":""},"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":"1906.00587","created_at":"2026-05-17T23:44:24.442018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00587v1","created_at":"2026-05-17T23:44:24.442018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00587","created_at":"2026-05-17T23:44:24.442018+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OTS4C6VMRM7","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OTS4C6VMRM7SKIE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OTS4C6V","created_at":"2026-05-18T12:33:12.712433+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/7OTS4C6VMRM7SKIE6S5Y2UIDDE","json":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE.json","graph_json":"https://pith.science/api/pith-number/7OTS4C6VMRM7SKIE6S5Y2UIDDE/graph.json","events_json":"https://pith.science/api/pith-number/7OTS4C6VMRM7SKIE6S5Y2UIDDE/events.json","paper":"https://pith.science/paper/7OTS4C6V"},"agent_actions":{"view_html":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE","download_json":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE.json","view_paper":"https://pith.science/paper/7OTS4C6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00587&json=true","fetch_graph":"https://pith.science/api/pith-number/7OTS4C6VMRM7SKIE6S5Y2UIDDE/graph.json","fetch_events":"https://pith.science/api/pith-number/7OTS4C6VMRM7SKIE6S5Y2UIDDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/action/storage_attestation","attest_author":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/action/author_attestation","sign_citation":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/action/citation_signature","submit_replication":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/action/replication_record"}},"created_at":"2026-05-17T23:44:24.442018+00:00","updated_at":"2026-05-17T23:44:24.442018+00:00"}