{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LUOBQJLBZVAPNDH2TTAPERXA6X","short_pith_number":"pith:LUOBQJLB","canonical_record":{"source":{"id":"1206.1660","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-06-08T04:47:48Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"333a9df0a365f88b44e94f0338ac0587cf6c99091cd7ef9567554b7a544b502b","abstract_canon_sha256":"234ddf55282b04455212a0ac55f8da37f3a1ca2c82f5da961f337ac8b097f150"},"schema_version":"1.0"},"canonical_sha256":"5d1c182561cd40f68cfa9cc0f246e0f5c7024a5249af91ae1e3e22c8e069640e","source":{"kind":"arxiv","id":"1206.1660","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1660","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1660v4","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1660","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"LUOBQJLBZVAP","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LUOBQJLBZVAPNDH2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LUOBQJLB","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LUOBQJLBZVAPNDH2TTAPERXA6X","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1660","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-06-08T04:47:48Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"333a9df0a365f88b44e94f0338ac0587cf6c99091cd7ef9567554b7a544b502b","abstract_canon_sha256":"234ddf55282b04455212a0ac55f8da37f3a1ca2c82f5da961f337ac8b097f150"},"schema_version":"1.0"},"canonical_sha256":"5d1c182561cd40f68cfa9cc0f246e0f5c7024a5249af91ae1e3e22c8e069640e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.858919Z","signature_b64":"5g2NpQXvYe5sY16vh+L95gUK6LdNtO8rhAtoZuSdZ33yWP1T74yjDJx5SQpxohSqpHe4Leiz1Fc5BTx3T5PiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d1c182561cd40f68cfa9cc0f246e0f5c7024a5249af91ae1e3e22c8e069640e","last_reissued_at":"2026-05-18T03:27:32.858438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.858438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1660","source_version":4,"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:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SzSXO8qVC7iioV948FmcKjTtUiFb+FwYzLLTz3N4XgqDjgHumUPGwhGRppCjlX7R40dXYoQMXf7Z7oeKZExBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:13:30.982130Z"},"content_sha256":"bcb913c98adef7b05881ca14b89c0bb156f8b1d790079931c7e0363960acabd4","schema_version":"1.0","event_id":"sha256:bcb913c98adef7b05881ca14b89c0bb156f8b1d790079931c7e0363960acabd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LUOBQJLBZVAPNDH2TTAPERXA6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal feature selection for sparse linear discriminant analysis and its applications in gene expression data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Baiqi Miao, Cheng Wang, Longbing Cao","submitted_at":"2012-06-08T04:47:48Z","abstract_excerpt":"This work studies the theoretical rules of feature selection in linear discriminant analysis (LDA), and a new feature selection method is proposed for sparse linear discriminant analysis. An $l_1$ minimization method is used to select the important features from which the LDA will be constructed. The asymptotic results of this proposed two-stage LDA (TLDA) are studied, demonstrating that TLDA is an optimal classification rule whose convergence rate is the best compared to existing methods. The experiments on simulated and real datasets are consistent with the theoretical results and show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1660","kind":"arxiv","version":4},"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:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MszucEUm5qz7vSY6Ds7B3eiybjejRur8sOe5t2Y5y+L8fiBo/kqGiDtjNtEQmYNX/MdMe4/ThP04tyk9eWXrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:13:30.982562Z"},"content_sha256":"194d461cb9871e35af835a34803b18a3f690dc25c4f01c2795bc229621bd16c9","schema_version":"1.0","event_id":"sha256:194d461cb9871e35af835a34803b18a3f690dc25c4f01c2795bc229621bd16c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUOBQJLBZVAPNDH2TTAPERXA6X/bundle.json","state_url":"https://pith.science/pith/LUOBQJLBZVAPNDH2TTAPERXA6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUOBQJLBZVAPNDH2TTAPERXA6X/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-31T18:13:30Z","links":{"resolver":"https://pith.science/pith/LUOBQJLBZVAPNDH2TTAPERXA6X","bundle":"https://pith.science/pith/LUOBQJLBZVAPNDH2TTAPERXA6X/bundle.json","state":"https://pith.science/pith/LUOBQJLBZVAPNDH2TTAPERXA6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUOBQJLBZVAPNDH2TTAPERXA6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LUOBQJLBZVAPNDH2TTAPERXA6X","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":"234ddf55282b04455212a0ac55f8da37f3a1ca2c82f5da961f337ac8b097f150","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-06-08T04:47:48Z","title_canon_sha256":"333a9df0a365f88b44e94f0338ac0587cf6c99091cd7ef9567554b7a544b502b"},"schema_version":"1.0","source":{"id":"1206.1660","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1660","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1660v4","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1660","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"LUOBQJLBZVAP","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LUOBQJLBZVAPNDH2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LUOBQJLB","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:194d461cb9871e35af835a34803b18a3f690dc25c4f01c2795bc229621bd16c9","target":"graph","created_at":"2026-05-18T03:27:32Z","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":"This work studies the theoretical rules of feature selection in linear discriminant analysis (LDA), and a new feature selection method is proposed for sparse linear discriminant analysis. An $l_1$ minimization method is used to select the important features from which the LDA will be constructed. The asymptotic results of this proposed two-stage LDA (TLDA) are studied, demonstrating that TLDA is an optimal classification rule whose convergence rate is the best compared to existing methods. The experiments on simulated and real datasets are consistent with the theoretical results and show that ","authors_text":"Baiqi Miao, Cheng Wang, Longbing Cao","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-06-08T04:47:48Z","title":"Optimal feature selection for sparse linear discriminant analysis and its applications in gene expression data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1660","kind":"arxiv","version":4},"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:bcb913c98adef7b05881ca14b89c0bb156f8b1d790079931c7e0363960acabd4","target":"record","created_at":"2026-05-18T03:27:32Z","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":"234ddf55282b04455212a0ac55f8da37f3a1ca2c82f5da961f337ac8b097f150","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-06-08T04:47:48Z","title_canon_sha256":"333a9df0a365f88b44e94f0338ac0587cf6c99091cd7ef9567554b7a544b502b"},"schema_version":"1.0","source":{"id":"1206.1660","kind":"arxiv","version":4}},"canonical_sha256":"5d1c182561cd40f68cfa9cc0f246e0f5c7024a5249af91ae1e3e22c8e069640e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d1c182561cd40f68cfa9cc0f246e0f5c7024a5249af91ae1e3e22c8e069640e","first_computed_at":"2026-05-18T03:27:32.858438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:32.858438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5g2NpQXvYe5sY16vh+L95gUK6LdNtO8rhAtoZuSdZ33yWP1T74yjDJx5SQpxohSqpHe4Leiz1Fc5BTx3T5PiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:32.858919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1660","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcb913c98adef7b05881ca14b89c0bb156f8b1d790079931c7e0363960acabd4","sha256:194d461cb9871e35af835a34803b18a3f690dc25c4f01c2795bc229621bd16c9"],"state_sha256":"02954f5330f1a96afd0e0c1049f681ba631e9d23d96fc4f9d14a6ab4006bd6fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pItQxEPqEsSNuIzmjK6idvEF5SR9rEaEr+9MfZtB0Qa9SEiMWUjAdm2DaD0MipPaUgX74nQM8V/uoWiq9kByDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:13:30.985391Z","bundle_sha256":"148e7f27287fa2733786a8ed73995fa3b2cd73f752651f69bc41245b1b4781aa"}}