{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VACKMUYXJXPNONKWHSXX6F5OR2","short_pith_number":"pith:VACKMUYX","canonical_record":{"source":{"id":"1804.00430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T08:35:23Z","cross_cats_sorted":["astro-ph.IM","cs.SY","math.CV"],"title_canon_sha256":"976a1b199d5762c8c3bfcf2567f892c8ad4780f95fa12c67c2304da54aa31f98","abstract_canon_sha256":"a3d8151d6bacc62d5f7ee0756e448fdfedaa76ba56ae13db27ed156868ce18ab"},"schema_version":"1.0"},"canonical_sha256":"a804a653174dded735563caf7f17ae8ebf334a03f851b213fe4b487ae2185810","source":{"kind":"arxiv","id":"1804.00430","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00430","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00430v1","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00430","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"VACKMUYXJXPN","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VACKMUYXJXPNONKW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VACKMUYX","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VACKMUYXJXPNONKWHSXX6F5OR2","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T08:35:23Z","cross_cats_sorted":["astro-ph.IM","cs.SY","math.CV"],"title_canon_sha256":"976a1b199d5762c8c3bfcf2567f892c8ad4780f95fa12c67c2304da54aa31f98","abstract_canon_sha256":"a3d8151d6bacc62d5f7ee0756e448fdfedaa76ba56ae13db27ed156868ce18ab"},"schema_version":"1.0"},"canonical_sha256":"a804a653174dded735563caf7f17ae8ebf334a03f851b213fe4b487ae2185810","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:37.196037Z","signature_b64":"w0FFDuBrRYafMsEgdGRKbvuTFextT7wzlLKdCkjV0ZJF5bG4/RW+RtlBEY8d2wrNmYli00UAXMD1vN2gKyRpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a804a653174dded735563caf7f17ae8ebf334a03f851b213fe4b487ae2185810","last_reissued_at":"2026-05-18T00:19:37.195389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:37.195389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00430","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-18T00:19:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ueh9AQHOSuxAgPs2fsBaUFV836X8zqqJNH/227+fDhTT57mfpPZ5gb0C7lK8EjJfUPdNqUjnlxhUx+tRss/nCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:08:06.510832Z"},"content_sha256":"ba7a3afac9b8a88dc94e21fc8da30c8a32f248e1e8b1f5818f22011dd31ca436","schema_version":"1.0","event_id":"sha256:ba7a3afac9b8a88dc94e21fc8da30c8a32f248e1e8b1f5818f22011dd31ca436"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VACKMUYXJXPNONKWHSXX6F5OR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Least Squares for Extended Complex Factor Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","cs.SY","math.CV"],"primary_cat":"stat.CO","authors_text":"Ahmad Mouri Sardarabadi, Alle-Jan van der Veen, L.V.E. Koopmans","submitted_at":"2018-04-02T08:35:23Z","abstract_excerpt":"For subspace estimation with an unknown colored noise, Factor Analysis (FA) is a good candidate for replacing the popular eigenvalue decomposition (EVD). Finding the unknowns in factor analysis can be done by solving a non-linear least square problem. For this type of optimization problems, the Gauss-Newton (GN) algorithm is a powerful and simple method. The most expensive part of the GN algorithm is finding the direction of descent by solving a system of equations at each iteration. In this paper we show that for FA, the matrices involved in solving these systems of equations can be diagonali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00430","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-18T00:19:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4gE9jgg+sOE6/smfzsC1Gg3du+4sxYxP22scmnyVu/XFYxBgTL0YS37NAjkB/6Ao1Y2RiIZxL6xbYKq9QoXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:08:06.511540Z"},"content_sha256":"d6022e5116b6540653c073451f062be3b0cb2bb4990a9e0a211e4acb2de34829","schema_version":"1.0","event_id":"sha256:d6022e5116b6540653c073451f062be3b0cb2bb4990a9e0a211e4acb2de34829"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VACKMUYXJXPNONKWHSXX6F5OR2/bundle.json","state_url":"https://pith.science/pith/VACKMUYXJXPNONKWHSXX6F5OR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VACKMUYXJXPNONKWHSXX6F5OR2/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-05-30T00:08:06Z","links":{"resolver":"https://pith.science/pith/VACKMUYXJXPNONKWHSXX6F5OR2","bundle":"https://pith.science/pith/VACKMUYXJXPNONKWHSXX6F5OR2/bundle.json","state":"https://pith.science/pith/VACKMUYXJXPNONKWHSXX6F5OR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VACKMUYXJXPNONKWHSXX6F5OR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VACKMUYXJXPNONKWHSXX6F5OR2","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":"a3d8151d6bacc62d5f7ee0756e448fdfedaa76ba56ae13db27ed156868ce18ab","cross_cats_sorted":["astro-ph.IM","cs.SY","math.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T08:35:23Z","title_canon_sha256":"976a1b199d5762c8c3bfcf2567f892c8ad4780f95fa12c67c2304da54aa31f98"},"schema_version":"1.0","source":{"id":"1804.00430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00430","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00430v1","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00430","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"VACKMUYXJXPN","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VACKMUYXJXPNONKW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VACKMUYX","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:d6022e5116b6540653c073451f062be3b0cb2bb4990a9e0a211e4acb2de34829","target":"graph","created_at":"2026-05-18T00:19:37Z","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":"For subspace estimation with an unknown colored noise, Factor Analysis (FA) is a good candidate for replacing the popular eigenvalue decomposition (EVD). Finding the unknowns in factor analysis can be done by solving a non-linear least square problem. For this type of optimization problems, the Gauss-Newton (GN) algorithm is a powerful and simple method. The most expensive part of the GN algorithm is finding the direction of descent by solving a system of equations at each iteration. In this paper we show that for FA, the matrices involved in solving these systems of equations can be diagonali","authors_text":"Ahmad Mouri Sardarabadi, Alle-Jan van der Veen, L.V.E. Koopmans","cross_cats":["astro-ph.IM","cs.SY","math.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T08:35:23Z","title":"Constrained Least Squares for Extended Complex Factor Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00430","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:ba7a3afac9b8a88dc94e21fc8da30c8a32f248e1e8b1f5818f22011dd31ca436","target":"record","created_at":"2026-05-18T00:19:37Z","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":"a3d8151d6bacc62d5f7ee0756e448fdfedaa76ba56ae13db27ed156868ce18ab","cross_cats_sorted":["astro-ph.IM","cs.SY","math.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T08:35:23Z","title_canon_sha256":"976a1b199d5762c8c3bfcf2567f892c8ad4780f95fa12c67c2304da54aa31f98"},"schema_version":"1.0","source":{"id":"1804.00430","kind":"arxiv","version":1}},"canonical_sha256":"a804a653174dded735563caf7f17ae8ebf334a03f851b213fe4b487ae2185810","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a804a653174dded735563caf7f17ae8ebf334a03f851b213fe4b487ae2185810","first_computed_at":"2026-05-18T00:19:37.195389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:37.195389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w0FFDuBrRYafMsEgdGRKbvuTFextT7wzlLKdCkjV0ZJF5bG4/RW+RtlBEY8d2wrNmYli00UAXMD1vN2gKyRpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:37.196037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba7a3afac9b8a88dc94e21fc8da30c8a32f248e1e8b1f5818f22011dd31ca436","sha256:d6022e5116b6540653c073451f062be3b0cb2bb4990a9e0a211e4acb2de34829"],"state_sha256":"958ec05de3594333c802d6820e007bd5ba34fadc54f17ec8ce9383271bbc0167"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fOZvjk+1qa0mB3tngZ9d0B7uP2cXyGhW9RkpKjfWTd1w7PNRrFObWi1FyPm2fip3OMldWEcZwdof1NEse2aRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:08:06.515159Z","bundle_sha256":"a1f9de79706211ceb4259ffbca78321ad45e721efd6e82e5a086f066dfa53c2b"}}