{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:626HGBL2W4RBWMMOS3B7MOTOTQ","short_pith_number":"pith:626HGBL2","canonical_record":{"source":{"id":"1804.03018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-09T14:23:07Z","cross_cats_sorted":[],"title_canon_sha256":"e8f3970dcb5c11007dbb43e679666979fbeec84d514d27cc4d4ed6d5edc7e664","abstract_canon_sha256":"1bf8c3801d35839bf1bfcb37aeb1c53e2d53ad429cebb75d64e2283259839510"},"schema_version":"1.0"},"canonical_sha256":"f6bc73057ab7221b318e96c3f63a6e9c293c32e03ddfded31d6fd0189d1c7f1e","source":{"kind":"arxiv","id":"1804.03018","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03018","created_at":"2026-05-18T00:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03018v1","created_at":"2026-05-18T00:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03018","created_at":"2026-05-18T00:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"626HGBL2W4RB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"626HGBL2W4RBWMMO","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"626HGBL2","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:626HGBL2W4RBWMMOS3B7MOTOTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-09T14:23:07Z","cross_cats_sorted":[],"title_canon_sha256":"e8f3970dcb5c11007dbb43e679666979fbeec84d514d27cc4d4ed6d5edc7e664","abstract_canon_sha256":"1bf8c3801d35839bf1bfcb37aeb1c53e2d53ad429cebb75d64e2283259839510"},"schema_version":"1.0"},"canonical_sha256":"f6bc73057ab7221b318e96c3f63a6e9c293c32e03ddfded31d6fd0189d1c7f1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:57.658588Z","signature_b64":"NXBojj2CErvIh/weNim3aYi6M1hslDH3Xqwszcbj+k0SN+Tts7qMlF7JQmuN4t6HhGEtA+uOAD6JjEIqQcTfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6bc73057ab7221b318e96c3f63a6e9c293c32e03ddfded31d6fd0189d1c7f1e","last_reissued_at":"2026-05-18T00:18:57.658038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:57.658038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03018","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-18T00:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vrs8+UhGnRmtrB1REoR5YMg19krgvDDHP6MjUuzoWeCHtbqecpr0P1FS+KetWMC8Hby8932zRu3x7U38zaToDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:29:26.952981Z"},"content_sha256":"e6c25a3a4db34d693586aa8af40809b76f31926a1505a25c78cf730e6cd3f0c5","schema_version":"1.0","event_id":"sha256:e6c25a3a4db34d693586aa8af40809b76f31926a1505a25c78cf730e6cd3f0c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:626HGBL2W4RBWMMOS3B7MOTOTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional Linear Discriminant Analysis: Optimality, Adaptive Algorithm, and Missing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Linjun Zhang, T. Tony Cai","submitted_at":"2018-04-09T14:23:07Z","abstract_excerpt":"This paper aims to develop an optimality theory for linear discriminant analysis in the high-dimensional setting. A data-driven and tuning free classification rule, which is based on an adaptive constrained $\\ell_1$ minimization approach, is proposed and analyzed. Minimax lower bounds are obtained and this classification rule is shown to be simultaneously rate optimal over a collection of parameter spaces. In addition, we consider classification with incomplete data under the missing completely at random (MCR) model. An adaptive classifier with theoretical guarantees is introduced and optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03018","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-18T00:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+JVU1l96EfgXzWu5vsTa133WkwKdIDrjsytmQZtyLwwhGMNxohXvTPBvkcUZlZlESPweiTQHCfH7YSD2gCYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:29:26.953331Z"},"content_sha256":"b770512d1fc541a6d3bdd32c244cde3ed4f95940856f60f6d41a1e904532f6d5","schema_version":"1.0","event_id":"sha256:b770512d1fc541a6d3bdd32c244cde3ed4f95940856f60f6d41a1e904532f6d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/626HGBL2W4RBWMMOS3B7MOTOTQ/bundle.json","state_url":"https://pith.science/pith/626HGBL2W4RBWMMOS3B7MOTOTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/626HGBL2W4RBWMMOS3B7MOTOTQ/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-28T00:29:26Z","links":{"resolver":"https://pith.science/pith/626HGBL2W4RBWMMOS3B7MOTOTQ","bundle":"https://pith.science/pith/626HGBL2W4RBWMMOS3B7MOTOTQ/bundle.json","state":"https://pith.science/pith/626HGBL2W4RBWMMOS3B7MOTOTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/626HGBL2W4RBWMMOS3B7MOTOTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:626HGBL2W4RBWMMOS3B7MOTOTQ","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":"1bf8c3801d35839bf1bfcb37aeb1c53e2d53ad429cebb75d64e2283259839510","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-09T14:23:07Z","title_canon_sha256":"e8f3970dcb5c11007dbb43e679666979fbeec84d514d27cc4d4ed6d5edc7e664"},"schema_version":"1.0","source":{"id":"1804.03018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03018","created_at":"2026-05-18T00:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03018v1","created_at":"2026-05-18T00:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03018","created_at":"2026-05-18T00:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"626HGBL2W4RB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"626HGBL2W4RBWMMO","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"626HGBL2","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:b770512d1fc541a6d3bdd32c244cde3ed4f95940856f60f6d41a1e904532f6d5","target":"graph","created_at":"2026-05-18T00:18:57Z","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 paper aims to develop an optimality theory for linear discriminant analysis in the high-dimensional setting. A data-driven and tuning free classification rule, which is based on an adaptive constrained $\\ell_1$ minimization approach, is proposed and analyzed. Minimax lower bounds are obtained and this classification rule is shown to be simultaneously rate optimal over a collection of parameter spaces. In addition, we consider classification with incomplete data under the missing completely at random (MCR) model. An adaptive classifier with theoretical guarantees is introduced and optimal ","authors_text":"Linjun Zhang, T. Tony Cai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-09T14:23:07Z","title":"High-dimensional Linear Discriminant Analysis: Optimality, Adaptive Algorithm, and Missing Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03018","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:e6c25a3a4db34d693586aa8af40809b76f31926a1505a25c78cf730e6cd3f0c5","target":"record","created_at":"2026-05-18T00:18:57Z","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":"1bf8c3801d35839bf1bfcb37aeb1c53e2d53ad429cebb75d64e2283259839510","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-09T14:23:07Z","title_canon_sha256":"e8f3970dcb5c11007dbb43e679666979fbeec84d514d27cc4d4ed6d5edc7e664"},"schema_version":"1.0","source":{"id":"1804.03018","kind":"arxiv","version":1}},"canonical_sha256":"f6bc73057ab7221b318e96c3f63a6e9c293c32e03ddfded31d6fd0189d1c7f1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6bc73057ab7221b318e96c3f63a6e9c293c32e03ddfded31d6fd0189d1c7f1e","first_computed_at":"2026-05-18T00:18:57.658038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:57.658038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NXBojj2CErvIh/weNim3aYi6M1hslDH3Xqwszcbj+k0SN+Tts7qMlF7JQmuN4t6HhGEtA+uOAD6JjEIqQcTfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:57.658588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6c25a3a4db34d693586aa8af40809b76f31926a1505a25c78cf730e6cd3f0c5","sha256:b770512d1fc541a6d3bdd32c244cde3ed4f95940856f60f6d41a1e904532f6d5"],"state_sha256":"d6e02eba4ccd00199416f8d0cd46238e248899bac8141651371ea1f7e05005e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0sAky/fglv/Oam4FcepsPitUm34soXooDiPEtsnaNVleHLAnsm76iGYnYPrziM78TRSyoQyIJyQzSK37mAGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:29:26.955243Z","bundle_sha256":"4defceda9e83a96b230a589b65a3a0b35a87935ee55acb3bee37e7c4f2603258"}}