{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7OTS4C6VMRM7SKIE6S5Y2UIDDE","short_pith_number":"pith:7OTS4C6V","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"},"canonical_sha256":"fba72e0bd56459f92904f4bb8d51031907e257e9a2768b73df29bf146ec7366a","source":{"kind":"arxiv","id":"1906.00587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00587","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00587v1","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00587","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"7OTS4C6VMRM7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7OTS4C6VMRM7SKIE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7OTS4C6V","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7OTS4C6VMRM7SKIE6S5Y2UIDDE","target":"record","payload":{"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"},"canonical_sha256":"fba72e0bd56459f92904f4bb8d51031907e257e9a2768b73df29bf146ec7366a","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"},"source_kind":"arxiv","source_id":"1906.00587","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cgoz2blpf3RqFgDFRvX/5GKdjzYzE/r4YK9pOcuecjvZh855PPAoegemLug1Zg74OijiESPKpDlkRVDQqMRwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:35:44.203122Z"},"content_sha256":"5c6296e3ae3ef1d72558057ec85310ccba5a1d0c3e4682e4f24a85ac5ac08bf1","schema_version":"1.0","event_id":"sha256:5c6296e3ae3ef1d72558057ec85310ccba5a1d0c3e4682e4f24a85ac5ac08bf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7OTS4C6VMRM7SKIE6S5Y2UIDDE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKiI1q2tNfoI/M6KLKUfxwa+1FebvvRoVUoS/HVHh59k8MtNccJi2iMSuwMpjK+l6M5KFrKkc9alGR/Y7WCxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:35:44.203823Z"},"content_sha256":"f4a2dbb454be7105d073a0d56358cb48c6af569d37c1f1fa67682ae93ffdc705","schema_version":"1.0","event_id":"sha256:f4a2dbb454be7105d073a0d56358cb48c6af569d37c1f1fa67682ae93ffdc705"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/bundle.json","state_url":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T15:35:44Z","links":{"resolver":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE","bundle":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/bundle.json","state":"https://pith.science/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OTS4C6VMRM7SKIE6S5Y2UIDDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7OTS4C6VMRM7SKIE6S5Y2UIDDE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f1bc2456017042bb54a90ac49da192c3ef6ef8633b3a68a62579d9122af660d6","cross_cats_sorted":["stat.AP","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-06-03T05:58:54Z","title_canon_sha256":"e317914650fda695b055f9e950b794da75ed1a98016b70f8af044d7059c0dea2"},"schema_version":"1.0","source":{"id":"1906.00587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00587","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00587v1","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00587","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"7OTS4C6VMRM7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7OTS4C6VMRM7SKIE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7OTS4C6V","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:f4a2dbb454be7105d073a0d56358cb48c6af569d37c1f1fa67682ae93ffdc705","target":"graph","created_at":"2026-05-17T23:44:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Antonio Punzo, Luca Bagnato","cross_cats":["stat.AP","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-06-03T05:58:54Z","title":"Unconstrained representation of orthogonal matrices with application to common principle components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00587","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5c6296e3ae3ef1d72558057ec85310ccba5a1d0c3e4682e4f24a85ac5ac08bf1","target":"record","created_at":"2026-05-17T23:44:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f1bc2456017042bb54a90ac49da192c3ef6ef8633b3a68a62579d9122af660d6","cross_cats_sorted":["stat.AP","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-06-03T05:58:54Z","title_canon_sha256":"e317914650fda695b055f9e950b794da75ed1a98016b70f8af044d7059c0dea2"},"schema_version":"1.0","source":{"id":"1906.00587","kind":"arxiv","version":1}},"canonical_sha256":"fba72e0bd56459f92904f4bb8d51031907e257e9a2768b73df29bf146ec7366a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fba72e0bd56459f92904f4bb8d51031907e257e9a2768b73df29bf146ec7366a","first_computed_at":"2026-05-17T23:44:24.441894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:24.441894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yLosG671UPRqY6IAT+k0miXP1cF9nQuuxGr9lZ8DC9FiBv/o9WGiXA7XYp2adu1twTr/h2O3wTabm6Snv+qVBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:24.442633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c6296e3ae3ef1d72558057ec85310ccba5a1d0c3e4682e4f24a85ac5ac08bf1","sha256:f4a2dbb454be7105d073a0d56358cb48c6af569d37c1f1fa67682ae93ffdc705"],"state_sha256":"1f50087b6a80ad175e7fe1522256f8328a803c3dfa4843d85bb73a4c8395f42f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uD+d3pZwAIK7JwkoNgSMFDt7xQ14zttrEMkr+7LoXJIfZ66Yoy0UQkLYut/U0qIWDIMf2AOG8KBeFy5kHPkGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:35:44.207661Z","bundle_sha256":"0255798474d166624915a919c252ad458ef28ed4426254bc3f393420ec506720"}}