{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MZAOFJIA25Q3T6UKA4BD3XTL46","short_pith_number":"pith:MZAOFJIA","canonical_record":{"source":{"id":"1811.11433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-11-28T08:03:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"521c08b99e07d2b2f7c5e09c135d521bc7575bb572f7f1ac2a663d0eb5e93cc7","abstract_canon_sha256":"326d004d185d950b176ba48bc0edad02871e55fafb840893633dc1c419c1b1f5"},"schema_version":"1.0"},"canonical_sha256":"6640e2a500d761b9fa8a07023dde6be7a73f4557d83c4a2fe14f6189a7bb36d5","source":{"kind":"arxiv","id":"1811.11433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11433","created_at":"2026-05-17T23:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11433v1","created_at":"2026-05-17T23:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11433","created_at":"2026-05-17T23:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"MZAOFJIA25Q3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MZAOFJIA25Q3T6UK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MZAOFJIA","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MZAOFJIA25Q3T6UKA4BD3XTL46","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-11-28T08:03:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"521c08b99e07d2b2f7c5e09c135d521bc7575bb572f7f1ac2a663d0eb5e93cc7","abstract_canon_sha256":"326d004d185d950b176ba48bc0edad02871e55fafb840893633dc1c419c1b1f5"},"schema_version":"1.0"},"canonical_sha256":"6640e2a500d761b9fa8a07023dde6be7a73f4557d83c4a2fe14f6189a7bb36d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:31.807254Z","signature_b64":"K7bz0flDWTwOEReS6FyqxytHnloJY5pLrZ4Z0G6nYQ6+anL4rWGa/xa3feszthlvlk3bbO2Z6nAytI5/mX+FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6640e2a500d761b9fa8a07023dde6be7a73f4557d83c4a2fe14f6189a7bb36d5","last_reissued_at":"2026-05-17T23:59:31.806627Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:31.806627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11433","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:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPZgZ8EP92fP2JPEnHwk/krsZhZoWFnn0dLwoM8ixGcT8KD/0VFpIeEtMIQsIbiC6KEPvtjfEHVvUh6+PrlQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:19:10.542049Z"},"content_sha256":"5a1949b2404b6c44a516ed39f7ca380c20998cd8d7783042f53e8160dee99458","schema_version":"1.0","event_id":"sha256:5a1949b2404b6c44a516ed39f7ca380c20998cd8d7783042f53e8160dee99458"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MZAOFJIA25Q3T6UKA4BD3XTL46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Pham's algorithm for joint diagonalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Alexandre Gramfort (PARIETAL), IAP), Jean-Fran\\c{c}ois Cardoso (CNRS, Pierre Ablin (PARIETAL)","submitted_at":"2018-11-28T08:03:18Z","abstract_excerpt":"The approximate joint diagonalization of a set of matrices consists in finding a basis in which these matrices are as diagonal as possible. This problem naturally appears in several statistical learning tasks such as blind signal separation. We consider the diagonalization criterion studied in a seminal paper by Pham (2001), and propose a new quasi-Newton method for its optimization. Through numerical experiments on simulated and real datasets, we show that the proposed method outper-forms Pham's algorithm. An open source Python package is released."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11433","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:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBRJi7XJ88ATempw9urv5FjwFLVfk024IOTI3sf01w1Y2wmHKDvC1WKeTA3Kc/ywAhPjEw6aD2nkSObMnYu/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:19:10.542407Z"},"content_sha256":"1ea373cf825aeb049705e520f5d1373c5c53e44d665b5388589f56a77460c71e","schema_version":"1.0","event_id":"sha256:1ea373cf825aeb049705e520f5d1373c5c53e44d665b5388589f56a77460c71e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZAOFJIA25Q3T6UKA4BD3XTL46/bundle.json","state_url":"https://pith.science/pith/MZAOFJIA25Q3T6UKA4BD3XTL46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZAOFJIA25Q3T6UKA4BD3XTL46/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-05T00:19:10Z","links":{"resolver":"https://pith.science/pith/MZAOFJIA25Q3T6UKA4BD3XTL46","bundle":"https://pith.science/pith/MZAOFJIA25Q3T6UKA4BD3XTL46/bundle.json","state":"https://pith.science/pith/MZAOFJIA25Q3T6UKA4BD3XTL46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZAOFJIA25Q3T6UKA4BD3XTL46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MZAOFJIA25Q3T6UKA4BD3XTL46","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":"326d004d185d950b176ba48bc0edad02871e55fafb840893633dc1c419c1b1f5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-11-28T08:03:18Z","title_canon_sha256":"521c08b99e07d2b2f7c5e09c135d521bc7575bb572f7f1ac2a663d0eb5e93cc7"},"schema_version":"1.0","source":{"id":"1811.11433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11433","created_at":"2026-05-17T23:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11433v1","created_at":"2026-05-17T23:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11433","created_at":"2026-05-17T23:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"MZAOFJIA25Q3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MZAOFJIA25Q3T6UK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MZAOFJIA","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:1ea373cf825aeb049705e520f5d1373c5c53e44d665b5388589f56a77460c71e","target":"graph","created_at":"2026-05-17T23:59:31Z","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 approximate joint diagonalization of a set of matrices consists in finding a basis in which these matrices are as diagonal as possible. This problem naturally appears in several statistical learning tasks such as blind signal separation. We consider the diagonalization criterion studied in a seminal paper by Pham (2001), and propose a new quasi-Newton method for its optimization. Through numerical experiments on simulated and real datasets, we show that the proposed method outper-forms Pham's algorithm. An open source Python package is released.","authors_text":"Alexandre Gramfort (PARIETAL), IAP), Jean-Fran\\c{c}ois Cardoso (CNRS, Pierre Ablin (PARIETAL)","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-11-28T08:03:18Z","title":"Beyond Pham's algorithm for joint diagonalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11433","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:5a1949b2404b6c44a516ed39f7ca380c20998cd8d7783042f53e8160dee99458","target":"record","created_at":"2026-05-17T23:59:31Z","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":"326d004d185d950b176ba48bc0edad02871e55fafb840893633dc1c419c1b1f5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-11-28T08:03:18Z","title_canon_sha256":"521c08b99e07d2b2f7c5e09c135d521bc7575bb572f7f1ac2a663d0eb5e93cc7"},"schema_version":"1.0","source":{"id":"1811.11433","kind":"arxiv","version":1}},"canonical_sha256":"6640e2a500d761b9fa8a07023dde6be7a73f4557d83c4a2fe14f6189a7bb36d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6640e2a500d761b9fa8a07023dde6be7a73f4557d83c4a2fe14f6189a7bb36d5","first_computed_at":"2026-05-17T23:59:31.806627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:31.806627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7bz0flDWTwOEReS6FyqxytHnloJY5pLrZ4Z0G6nYQ6+anL4rWGa/xa3feszthlvlk3bbO2Z6nAytI5/mX+FCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:31.807254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a1949b2404b6c44a516ed39f7ca380c20998cd8d7783042f53e8160dee99458","sha256:1ea373cf825aeb049705e520f5d1373c5c53e44d665b5388589f56a77460c71e"],"state_sha256":"ef8b26493d99e47c3dbaf8add23a4be50574624d1c0fa00d56906c8b23b6ebf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4czSrFX+8qvwqIXGWCuZPaFGJTQ5zlyFE4JhvLi+wFFawpRErE8jl9C0s9YTDsyG5Y21PsMi6rsN92Rirs7SBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:19:10.544360Z","bundle_sha256":"20c81d2cf1670f2f2870ba150830251cc91f0a9aa831e77f6e0abdf8ecebf5ed"}}