{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UPY4NJDRL6ZJ7O5CNTY4RGHJ46","short_pith_number":"pith:UPY4NJDR","canonical_record":{"source":{"id":"1303.3240","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-13T18:18:14Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"3272e8c874e47c7288267e833b081106e1fecbfd5df321e46fd81fc86fdeccde","abstract_canon_sha256":"833889dfb6dbc1360598be8608a93968128adf388b282a99e05dc432ddb6148a"},"schema_version":"1.0"},"canonical_sha256":"a3f1c6a4715fb29fbba26cf1c898e9e7915f2590edaeb65974843310c7238629","source":{"kind":"arxiv","id":"1303.3240","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3240","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3240v2","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3240","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"UPY4NJDRL6ZJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UPY4NJDRL6ZJ7O5C","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UPY4NJDR","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UPY4NJDRL6ZJ7O5CNTY4RGHJ46","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3240","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-13T18:18:14Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"3272e8c874e47c7288267e833b081106e1fecbfd5df321e46fd81fc86fdeccde","abstract_canon_sha256":"833889dfb6dbc1360598be8608a93968128adf388b282a99e05dc432ddb6148a"},"schema_version":"1.0"},"canonical_sha256":"a3f1c6a4715fb29fbba26cf1c898e9e7915f2590edaeb65974843310c7238629","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.046641Z","signature_b64":"7TXShy6nPBxI448ZKx+JNTuuxWBmHdFkP+qRGiLMRfrvhqh2kLCz9Asx+UlGBvnEEeNipcvpoh6BW5WZdBWbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3f1c6a4715fb29fbba26cf1c898e9e7915f2590edaeb65974843310c7238629","last_reissued_at":"2026-05-18T02:37:43.046270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.046270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3240","source_version":2,"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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ku7iseSNpP3hJQGlC68VV0TVltICn/aKhj7lqVtSJHfAHb7XZNww5UB8WtKImKn2EpLOmE1jXfpQyHzVVE6KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:02:24.311221Z"},"content_sha256":"949b295ce35e31544578a073ced17bfd26656dd68a76f9cb79e4f55c793bd2c5","schema_version":"1.0","event_id":"sha256:949b295ce35e31544578a073ced17bfd26656dd68a76f9cb79e4f55c793bd2c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UPY4NJDRL6ZJ7O5CNTY4RGHJ46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Framework for Probabilistic Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Maja Pantic, Mihalis A. Nicolaou, Stefanos Zafeiriou","submitted_at":"2013-03-13T18:18:14Z","abstract_excerpt":"We present a unifying framework which reduces the construction of probabilistic component analysis techniques to a mere selection of the latent neighbourhood, thus providing an elegant and principled framework for creating novel component analysis models as well as constructing probabilistic equivalents of deterministic component analysis methods. Under our framework, we unify many very popular and well-studied component analysis algorithms, such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Locality Preserving Projections (LPP) and Slow Feature Analysis (SFA), som"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3240","kind":"arxiv","version":2},"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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2uuoYkyCep+xOEIco9OOGSkKatfhmK5JScB3SP/5zXxdXMps6xpr/Cqc1anlhgKIX2NxRZSuI37tqJFMFcuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:02:24.311888Z"},"content_sha256":"c671fc4f214b83e5727efc8b0b92ee162aee3aa6a9db75e61da5efbd8a766f30","schema_version":"1.0","event_id":"sha256:c671fc4f214b83e5727efc8b0b92ee162aee3aa6a9db75e61da5efbd8a766f30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPY4NJDRL6ZJ7O5CNTY4RGHJ46/bundle.json","state_url":"https://pith.science/pith/UPY4NJDRL6ZJ7O5CNTY4RGHJ46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPY4NJDRL6ZJ7O5CNTY4RGHJ46/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-27T04:02:24Z","links":{"resolver":"https://pith.science/pith/UPY4NJDRL6ZJ7O5CNTY4RGHJ46","bundle":"https://pith.science/pith/UPY4NJDRL6ZJ7O5CNTY4RGHJ46/bundle.json","state":"https://pith.science/pith/UPY4NJDRL6ZJ7O5CNTY4RGHJ46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPY4NJDRL6ZJ7O5CNTY4RGHJ46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UPY4NJDRL6ZJ7O5CNTY4RGHJ46","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":"833889dfb6dbc1360598be8608a93968128adf388b282a99e05dc432ddb6148a","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-13T18:18:14Z","title_canon_sha256":"3272e8c874e47c7288267e833b081106e1fecbfd5df321e46fd81fc86fdeccde"},"schema_version":"1.0","source":{"id":"1303.3240","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3240","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3240v2","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3240","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"UPY4NJDRL6ZJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UPY4NJDRL6ZJ7O5C","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UPY4NJDR","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:c671fc4f214b83e5727efc8b0b92ee162aee3aa6a9db75e61da5efbd8a766f30","target":"graph","created_at":"2026-05-18T02:37:43Z","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":"We present a unifying framework which reduces the construction of probabilistic component analysis techniques to a mere selection of the latent neighbourhood, thus providing an elegant and principled framework for creating novel component analysis models as well as constructing probabilistic equivalents of deterministic component analysis methods. Under our framework, we unify many very popular and well-studied component analysis algorithms, such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Locality Preserving Projections (LPP) and Slow Feature Analysis (SFA), som","authors_text":"Maja Pantic, Mihalis A. Nicolaou, Stefanos Zafeiriou","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-13T18:18:14Z","title":"A Unified Framework for Probabilistic Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3240","kind":"arxiv","version":2},"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:949b295ce35e31544578a073ced17bfd26656dd68a76f9cb79e4f55c793bd2c5","target":"record","created_at":"2026-05-18T02:37:43Z","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":"833889dfb6dbc1360598be8608a93968128adf388b282a99e05dc432ddb6148a","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-13T18:18:14Z","title_canon_sha256":"3272e8c874e47c7288267e833b081106e1fecbfd5df321e46fd81fc86fdeccde"},"schema_version":"1.0","source":{"id":"1303.3240","kind":"arxiv","version":2}},"canonical_sha256":"a3f1c6a4715fb29fbba26cf1c898e9e7915f2590edaeb65974843310c7238629","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3f1c6a4715fb29fbba26cf1c898e9e7915f2590edaeb65974843310c7238629","first_computed_at":"2026-05-18T02:37:43.046270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:43.046270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7TXShy6nPBxI448ZKx+JNTuuxWBmHdFkP+qRGiLMRfrvhqh2kLCz9Asx+UlGBvnEEeNipcvpoh6BW5WZdBWbBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:43.046641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3240","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:949b295ce35e31544578a073ced17bfd26656dd68a76f9cb79e4f55c793bd2c5","sha256:c671fc4f214b83e5727efc8b0b92ee162aee3aa6a9db75e61da5efbd8a766f30"],"state_sha256":"ded21d444a621ddd28ea158e7cb7021356ffd86d01e29e547865e858aa4d5886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YuxtSObDPiG81FybkEWulgMQIBizxqmXIIwWeMh8xAdDouJq0Vd1Kpe908JkCVLvfBrtg9LKtE/Xn6enSU5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:02:24.315087Z","bundle_sha256":"bd848895d734101e888f851336705dc1395a1d46902310b6c88e8fbf67921b5f"}}