{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XIBZ6TCYG2XUQSXDPGGYMCNDLV","short_pith_number":"pith:XIBZ6TCY","canonical_record":{"source":{"id":"1202.3725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"188125ecb95d0195ce7490da7fc2891b4c8a9961b7a92346c08ec5f19cd27860","abstract_canon_sha256":"76c0dba5227717d0b4d12b5a177b907283fb47f4e730a0268b3f25c67c7878e7"},"schema_version":"1.0"},"canonical_sha256":"ba039f4c5836af484ae3798d8609a35d7308c766589d1c9678eaabf22e97f53f","source":{"kind":"arxiv","id":"1202.3725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3725","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3725v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3725","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"XIBZ6TCYG2XU","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XIBZ6TCYG2XUQSXD","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XIBZ6TCY","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XIBZ6TCYG2XUQSXDPGGYMCNDLV","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"188125ecb95d0195ce7490da7fc2891b4c8a9961b7a92346c08ec5f19cd27860","abstract_canon_sha256":"76c0dba5227717d0b4d12b5a177b907283fb47f4e730a0268b3f25c67c7878e7"},"schema_version":"1.0"},"canonical_sha256":"ba039f4c5836af484ae3798d8609a35d7308c766589d1c9678eaabf22e97f53f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.303997Z","signature_b64":"k9XvNsXJe+8DL2sBJ1MmG7C17LcEjBGdYjASos+PoZO+qGpXnSJJruFz1uBRCAnYz7/GOIFeGrFuZIGdBptyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba039f4c5836af484ae3798d8609a35d7308c766589d1c9678eaabf22e97f53f","last_reissued_at":"2026-05-18T04:02:03.303342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.303342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3725","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kEMRYss2SRFzP9JKGGomA6FBmYCtWedHPMD6HKItrMyFgTJkd883ojwbxfVxa0TYw8lImyh6BHFvdbS2HQVRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:18:18.744748Z"},"content_sha256":"2ef5bdae817ebb2d0f483600f3e545dd2ed32cd5aa85bf43139887bd6c857056","schema_version":"1.0","event_id":"sha256:2ef5bdae817ebb2d0f483600f3e545dd2ed32cd5aa85bf43139887bd6c857056"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XIBZ6TCYG2XUQSXDPGGYMCNDLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Fisher Score for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiawei Han, Quanquan Gu, Zhenhui Li","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Fisher score is one of the most widely used supervised feature selection methods. However, it selects each feature independently according to their scores under the Fisher criterion, which leads to a suboptimal subset of features. In this paper, we present a generalized Fisher score to jointly select features. It aims at finding an subset of features, which maximize the lower bound of traditional Fisher score. The resulting feature selection problem is a mixed integer programming, which can be reformulated as a quadratically constrained linear programming (QCLP). It is solved by cutting plane "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3725","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCtehmMvMdqnIASzLNiJ0mcV8RMV370rmca9l3W6PO0HtKSS5vXZlVQOTx+bR241NwOxWClXgt8wM0TpiqZsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:18:18.745110Z"},"content_sha256":"dd6232b9b7c9cd27e5cddea9fe99c74162a828c866ae2b5a46bd775fe0bfb44e","schema_version":"1.0","event_id":"sha256:dd6232b9b7c9cd27e5cddea9fe99c74162a828c866ae2b5a46bd775fe0bfb44e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/bundle.json","state_url":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/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-07-01T15:18:18Z","links":{"resolver":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV","bundle":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/bundle.json","state":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XIBZ6TCYG2XUQSXDPGGYMCNDLV","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":"76c0dba5227717d0b4d12b5a177b907283fb47f4e730a0268b3f25c67c7878e7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"188125ecb95d0195ce7490da7fc2891b4c8a9961b7a92346c08ec5f19cd27860"},"schema_version":"1.0","source":{"id":"1202.3725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3725","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3725v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3725","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"XIBZ6TCYG2XU","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XIBZ6TCYG2XUQSXD","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XIBZ6TCY","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:dd6232b9b7c9cd27e5cddea9fe99c74162a828c866ae2b5a46bd775fe0bfb44e","target":"graph","created_at":"2026-05-18T04:02:03Z","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":"Fisher score is one of the most widely used supervised feature selection methods. However, it selects each feature independently according to their scores under the Fisher criterion, which leads to a suboptimal subset of features. In this paper, we present a generalized Fisher score to jointly select features. It aims at finding an subset of features, which maximize the lower bound of traditional Fisher score. The resulting feature selection problem is a mixed integer programming, which can be reformulated as a quadratically constrained linear programming (QCLP). It is solved by cutting plane ","authors_text":"Jiawei Han, Quanquan Gu, Zhenhui Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title":"Generalized Fisher Score for Feature Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3725","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:2ef5bdae817ebb2d0f483600f3e545dd2ed32cd5aa85bf43139887bd6c857056","target":"record","created_at":"2026-05-18T04:02:03Z","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":"76c0dba5227717d0b4d12b5a177b907283fb47f4e730a0268b3f25c67c7878e7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"188125ecb95d0195ce7490da7fc2891b4c8a9961b7a92346c08ec5f19cd27860"},"schema_version":"1.0","source":{"id":"1202.3725","kind":"arxiv","version":1}},"canonical_sha256":"ba039f4c5836af484ae3798d8609a35d7308c766589d1c9678eaabf22e97f53f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba039f4c5836af484ae3798d8609a35d7308c766589d1c9678eaabf22e97f53f","first_computed_at":"2026-05-18T04:02:03.303342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:03.303342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k9XvNsXJe+8DL2sBJ1MmG7C17LcEjBGdYjASos+PoZO+qGpXnSJJruFz1uBRCAnYz7/GOIFeGrFuZIGdBptyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:03.303997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ef5bdae817ebb2d0f483600f3e545dd2ed32cd5aa85bf43139887bd6c857056","sha256:dd6232b9b7c9cd27e5cddea9fe99c74162a828c866ae2b5a46bd775fe0bfb44e"],"state_sha256":"58dc68f7106d3df0e41edfbf9966d07d777bcf545edeb58bd2c2569bba83a7c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrYFGx3sSFPW23Fnvqs8ac5eUdvXZxDdO39QaIc++M2w2m6Xi2D3U/IgQ8Ti1aI+DDFI2yNAOYGUYr6qelEvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:18:18.747134Z","bundle_sha256":"63fe0faf7844cc7517b470d37b379c3f29251bd12d57872e190f47923a3e6d7d"}}