{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RV6SJYXQHFKF3FKQXV56SSIP6X","short_pith_number":"pith:RV6SJYXQ","canonical_record":{"source":{"id":"1204.2067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-04-10T07:34:07Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"1887fb59eab4c4b4fbcc340eb0a9fceb66af8d4977b6f8ae8d426258c7b2866a","abstract_canon_sha256":"c9b32851d883e94dae4034bcc9fe6c272df664544d7d44db5d7ee42b66c0d20e"},"schema_version":"1.0"},"canonical_sha256":"8d7d24e2f039545d9550bd7be9490ff5c2ea550892fa1f24729c114c190b09f0","source":{"kind":"arxiv","id":"1204.2067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2067","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2067v1","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2067","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"RV6SJYXQHFKF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RV6SJYXQHFKF3FKQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RV6SJYXQ","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RV6SJYXQHFKF3FKQXV56SSIP6X","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-04-10T07:34:07Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"1887fb59eab4c4b4fbcc340eb0a9fceb66af8d4977b6f8ae8d426258c7b2866a","abstract_canon_sha256":"c9b32851d883e94dae4034bcc9fe6c272df664544d7d44db5d7ee42b66c0d20e"},"schema_version":"1.0"},"canonical_sha256":"8d7d24e2f039545d9550bd7be9490ff5c2ea550892fa1f24729c114c190b09f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:13.419745Z","signature_b64":"UIeRCZ1ZRFONRiFO7qjXwsJ7WpHT9PZRb00SWyqsocPNeoJ0qoBpP4oYAqBzZnthJw5dyPs25nKR3ZIilMT9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d7d24e2f039545d9550bd7be9490ff5c2ea550892fa1f24729c114c190b09f0","last_reissued_at":"2026-05-18T03:58:13.419245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:13.419245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2067","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-18T03:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGzQyZaVbaXfBm4BDVhoo+f+TxLw0tJSXn6q75YsyVGew6xvWqmsZc4YYyftHowy+LswhbI40EbpaRrFSxDcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:29:22.357876Z"},"content_sha256":"d222a204120c81fbbf5a9c6cfcc11339f9334d89337d54440e597f57ac3d07e1","schema_version":"1.0","event_id":"sha256:d222a204120c81fbbf5a9c6cfcc11339f9334d89337d54440e597f57ac3d07e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RV6SJYXQHFKF3FKQXV56SSIP6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminative variable selection for clustering with the sparse Fisher-EM algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Camille Brunet, Charles Bouveyron","submitted_at":"2012-04-10T07:34:07Z","abstract_excerpt":"The interest in variable selection for clustering has increased recently due to the growing need in clustering high-dimensional data. Variable selection allows in particular to ease both the clustering and the interpretation of the results. Existing approaches have demonstrated the efficiency of variable selection for clustering but turn out to be either very time consuming or not sparse enough in high-dimensional spaces. This work proposes to perform a selection of the discriminative variables by introducing sparsity in the loading matrix of the Fisher-EM algorithm. This clustering method has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2067","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-18T03:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkYD9nYfXkf7QuNdwlBkXvTvmhwPq1XaECcC2WVVbfK2hop/7YaSy3uThpka036mKIxKcyTSV8CGkIo6qirADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:29:22.358229Z"},"content_sha256":"91adb718f90be76f4979d7db939263446fdf0dcd354e6df0829e8c987f023265","schema_version":"1.0","event_id":"sha256:91adb718f90be76f4979d7db939263446fdf0dcd354e6df0829e8c987f023265"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RV6SJYXQHFKF3FKQXV56SSIP6X/bundle.json","state_url":"https://pith.science/pith/RV6SJYXQHFKF3FKQXV56SSIP6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RV6SJYXQHFKF3FKQXV56SSIP6X/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-22T18:29:22Z","links":{"resolver":"https://pith.science/pith/RV6SJYXQHFKF3FKQXV56SSIP6X","bundle":"https://pith.science/pith/RV6SJYXQHFKF3FKQXV56SSIP6X/bundle.json","state":"https://pith.science/pith/RV6SJYXQHFKF3FKQXV56SSIP6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RV6SJYXQHFKF3FKQXV56SSIP6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RV6SJYXQHFKF3FKQXV56SSIP6X","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":"c9b32851d883e94dae4034bcc9fe6c272df664544d7d44db5d7ee42b66c0d20e","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-04-10T07:34:07Z","title_canon_sha256":"1887fb59eab4c4b4fbcc340eb0a9fceb66af8d4977b6f8ae8d426258c7b2866a"},"schema_version":"1.0","source":{"id":"1204.2067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2067","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2067v1","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2067","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"RV6SJYXQHFKF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RV6SJYXQHFKF3FKQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RV6SJYXQ","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:91adb718f90be76f4979d7db939263446fdf0dcd354e6df0829e8c987f023265","target":"graph","created_at":"2026-05-18T03:58:13Z","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 interest in variable selection for clustering has increased recently due to the growing need in clustering high-dimensional data. Variable selection allows in particular to ease both the clustering and the interpretation of the results. Existing approaches have demonstrated the efficiency of variable selection for clustering but turn out to be either very time consuming or not sparse enough in high-dimensional spaces. This work proposes to perform a selection of the discriminative variables by introducing sparsity in the loading matrix of the Fisher-EM algorithm. This clustering method has","authors_text":"Camille Brunet, Charles Bouveyron","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-04-10T07:34:07Z","title":"Discriminative variable selection for clustering with the sparse Fisher-EM algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2067","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:d222a204120c81fbbf5a9c6cfcc11339f9334d89337d54440e597f57ac3d07e1","target":"record","created_at":"2026-05-18T03:58:13Z","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":"c9b32851d883e94dae4034bcc9fe6c272df664544d7d44db5d7ee42b66c0d20e","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-04-10T07:34:07Z","title_canon_sha256":"1887fb59eab4c4b4fbcc340eb0a9fceb66af8d4977b6f8ae8d426258c7b2866a"},"schema_version":"1.0","source":{"id":"1204.2067","kind":"arxiv","version":1}},"canonical_sha256":"8d7d24e2f039545d9550bd7be9490ff5c2ea550892fa1f24729c114c190b09f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d7d24e2f039545d9550bd7be9490ff5c2ea550892fa1f24729c114c190b09f0","first_computed_at":"2026-05-18T03:58:13.419245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:13.419245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UIeRCZ1ZRFONRiFO7qjXwsJ7WpHT9PZRb00SWyqsocPNeoJ0qoBpP4oYAqBzZnthJw5dyPs25nKR3ZIilMT9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:13.419745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d222a204120c81fbbf5a9c6cfcc11339f9334d89337d54440e597f57ac3d07e1","sha256:91adb718f90be76f4979d7db939263446fdf0dcd354e6df0829e8c987f023265"],"state_sha256":"568a9c67d888f4d0379c22a59bc3f9567238f075bc8b234c42b33c74f0caa77d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZTZHv0+UvRIk9fEYZ17SW2rsMkDKmhOLTdgvm4TFsnwAqFbrTSoVWG2zbnQvRx4tVxe7O7rMfG/3VG1c8OPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:29:22.360211Z","bundle_sha256":"5c711795df84262cfb098a31b39cbde6df9a4581db63537e8c7c15c678952b5f"}}