{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MJA3VV6YP5IC5JRGMWVQ6IBCRA","short_pith_number":"pith:MJA3VV6Y","canonical_record":{"source":{"id":"1806.04433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:54:45Z","cross_cats_sorted":[],"title_canon_sha256":"0c5bd7b95ce75f0729aed8bfcac45d7942c39e10b5885a040e8a0fe73a03f4e8","abstract_canon_sha256":"5b0f66ad5ca9820df0d2c9132f25ac3436abfbc53df77602daf94687745c05ab"},"schema_version":"1.0"},"canonical_sha256":"6241bad7d87f502ea62665ab0f2022881adab0d44684a51cdca56c6a48b09ca2","source":{"kind":"arxiv","id":"1806.04433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04433","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04433v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04433","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"MJA3VV6YP5IC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJA3VV6YP5IC5JRG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJA3VV6Y","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MJA3VV6YP5IC5JRGMWVQ6IBCRA","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:54:45Z","cross_cats_sorted":[],"title_canon_sha256":"0c5bd7b95ce75f0729aed8bfcac45d7942c39e10b5885a040e8a0fe73a03f4e8","abstract_canon_sha256":"5b0f66ad5ca9820df0d2c9132f25ac3436abfbc53df77602daf94687745c05ab"},"schema_version":"1.0"},"canonical_sha256":"6241bad7d87f502ea62665ab0f2022881adab0d44684a51cdca56c6a48b09ca2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.537777Z","signature_b64":"faKs3dWDmZE2gyQrHjdvDH/nOILwT5Vjn7PDUqHPwyNwfGww7Vpe9Dr0+7fAb08pcdt6xmoubnzQxN1YNmLTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6241bad7d87f502ea62665ab0f2022881adab0d44684a51cdca56c6a48b09ca2","last_reissued_at":"2026-05-18T00:13:35.537104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.537104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04433","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:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NN9PZJ8XoUig8cf/JNkvY0syEvLnaIxVyEOUXwlPwcEK6ub+4+Wh5k+VdF1Pzhy9r1lIfEaRt5A3eJOQZHKiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:13:35.355187Z"},"content_sha256":"82a84d8b44dba8a3b3a8af30a875d0a428fa1c605a1d153043b97465b9cc28a8","schema_version":"1.0","event_id":"sha256:82a84d8b44dba8a3b3a8af30a875d0a428fa1c605a1d153043b97465b9cc28a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MJA3VV6YP5IC5JRGMWVQ6IBCRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An alternating minimization algorithm for Factor Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Augusto Ferrante, Mattia Zorzi, Valentina Ciccone","submitted_at":"2018-06-12T10:54:45Z","abstract_excerpt":"The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem. This algorithm appears to perform extremely well and is extremely fast even when the given covariance matrix has a very large dimension. The effectiveness of the algorithm is assessed through simulation studies and by applications to three real datasets that are considered as benchmark for the problem. A local convergence analysis of the algorithm is also pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04433","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:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pobZtqzhMeG2bclMO1fO6RN4cM9hu+suDTyvlp/6cvcSAh8NeCoXH+sG9SpzvHfrVXVeJq+iDiHLZRc70zINBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:13:35.355844Z"},"content_sha256":"51614c5b8b7216c710b7e1860c0e35daa403873fc3dcab3a7e891e82f4fc4469","schema_version":"1.0","event_id":"sha256:51614c5b8b7216c710b7e1860c0e35daa403873fc3dcab3a7e891e82f4fc4469"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJA3VV6YP5IC5JRGMWVQ6IBCRA/bundle.json","state_url":"https://pith.science/pith/MJA3VV6YP5IC5JRGMWVQ6IBCRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJA3VV6YP5IC5JRGMWVQ6IBCRA/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-26T17:13:35Z","links":{"resolver":"https://pith.science/pith/MJA3VV6YP5IC5JRGMWVQ6IBCRA","bundle":"https://pith.science/pith/MJA3VV6YP5IC5JRGMWVQ6IBCRA/bundle.json","state":"https://pith.science/pith/MJA3VV6YP5IC5JRGMWVQ6IBCRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJA3VV6YP5IC5JRGMWVQ6IBCRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MJA3VV6YP5IC5JRGMWVQ6IBCRA","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":"5b0f66ad5ca9820df0d2c9132f25ac3436abfbc53df77602daf94687745c05ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:54:45Z","title_canon_sha256":"0c5bd7b95ce75f0729aed8bfcac45d7942c39e10b5885a040e8a0fe73a03f4e8"},"schema_version":"1.0","source":{"id":"1806.04433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04433","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04433v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04433","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"MJA3VV6YP5IC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJA3VV6YP5IC5JRG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJA3VV6Y","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:51614c5b8b7216c710b7e1860c0e35daa403873fc3dcab3a7e891e82f4fc4469","target":"graph","created_at":"2026-05-18T00:13:35Z","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":"The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem. This algorithm appears to perform extremely well and is extremely fast even when the given covariance matrix has a very large dimension. The effectiveness of the algorithm is assessed through simulation studies and by applications to three real datasets that are considered as benchmark for the problem. A local convergence analysis of the algorithm is also pres","authors_text":"Augusto Ferrante, Mattia Zorzi, Valentina Ciccone","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:54:45Z","title":"An alternating minimization algorithm for Factor Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04433","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:82a84d8b44dba8a3b3a8af30a875d0a428fa1c605a1d153043b97465b9cc28a8","target":"record","created_at":"2026-05-18T00:13:35Z","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":"5b0f66ad5ca9820df0d2c9132f25ac3436abfbc53df77602daf94687745c05ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:54:45Z","title_canon_sha256":"0c5bd7b95ce75f0729aed8bfcac45d7942c39e10b5885a040e8a0fe73a03f4e8"},"schema_version":"1.0","source":{"id":"1806.04433","kind":"arxiv","version":1}},"canonical_sha256":"6241bad7d87f502ea62665ab0f2022881adab0d44684a51cdca56c6a48b09ca2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6241bad7d87f502ea62665ab0f2022881adab0d44684a51cdca56c6a48b09ca2","first_computed_at":"2026-05-18T00:13:35.537104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:35.537104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"faKs3dWDmZE2gyQrHjdvDH/nOILwT5Vjn7PDUqHPwyNwfGww7Vpe9Dr0+7fAb08pcdt6xmoubnzQxN1YNmLTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:35.537777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82a84d8b44dba8a3b3a8af30a875d0a428fa1c605a1d153043b97465b9cc28a8","sha256:51614c5b8b7216c710b7e1860c0e35daa403873fc3dcab3a7e891e82f4fc4469"],"state_sha256":"7d52b3a3cac23688eec79f89411fbbce747285f7726db5beb6ca9dcdaca6db51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3U9Sh3IsAxsGcHvp2B3HrEN4MGnaj/i5bPftzEgvpSeZOyYycnUlQ6b10TOPoNEWSjatNJZ8FUlL9UdfRSQlCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:13:35.359243Z","bundle_sha256":"615b3c0d334c64d722d935a13773c5dc818da4b9bc358e665b151e5c3a490e40"}}