{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6R6ZJCJ2F6PSZLU62EXAHV7DPZ","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":"6c1f4f2f9f889a47ac0e85712ddbd85ec8fd817c305adf84857ec80c42e380ea","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-06-26T12:42:42Z","title_canon_sha256":"4df39eda1b0e65cf8c9223896a6df07ff47f7eb264014dd5675aeab297b1eab9"},"schema_version":"1.0","source":{"id":"1706.08344","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08344","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08344v3","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08344","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"pith_short_12","alias_value":"6R6ZJCJ2F6PS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6R6ZJCJ2F6PSZLU6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6R6ZJCJ2","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:e0f41442a28eeaaa06e0cc643bd18a4a930fbaadadcebad671f79e599af277cd","target":"graph","created_at":"2026-05-18T00:00: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":"We consider high-dimensional binary classification by sparse logistic regression. We propose a model/feature selection procedure based on penalized maximum likelihood with a complexity penalty on the model size and derive the non-asymptotic bounds for the resulting misclassification excess risk. The bounds can be reduced under the additional low-noise condition. The proposed complexity penalty is remarkably related to the VC-dimension of a set of sparse linear classifiers. Implementation of any complexity penalty-based criterion, however, requires a combinatorial search over all possible model","authors_text":"Felix Abramovich, Vadim Grinshtein","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-06-26T12:42:42Z","title":"High-dimensional classification by sparse logistic regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08344","kind":"arxiv","version":3},"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:07f9dfc4a2f32aad4d8f9cc809531a3d1d49a04db7df9e9b2fce535b9e0c08ae","target":"record","created_at":"2026-05-18T00:00: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":"6c1f4f2f9f889a47ac0e85712ddbd85ec8fd817c305adf84857ec80c42e380ea","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-06-26T12:42:42Z","title_canon_sha256":"4df39eda1b0e65cf8c9223896a6df07ff47f7eb264014dd5675aeab297b1eab9"},"schema_version":"1.0","source":{"id":"1706.08344","kind":"arxiv","version":3}},"canonical_sha256":"f47d94893a2f9f2cae9ed12e03d7e37e46e3feccdca6ac92477070c88946e636","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f47d94893a2f9f2cae9ed12e03d7e37e46e3feccdca6ac92477070c88946e636","first_computed_at":"2026-05-18T00:00:31.061930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:31.061930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ceGUb9M6xhbauAkomcMHreOeSzuUyn1cPfHWCt74n0nZCQ8rFe2//k+kdJv8tN6+4v6OvTXEq4aalAwjzk8lBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:31.062491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08344","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07f9dfc4a2f32aad4d8f9cc809531a3d1d49a04db7df9e9b2fce535b9e0c08ae","sha256:e0f41442a28eeaaa06e0cc643bd18a4a930fbaadadcebad671f79e599af277cd"],"state_sha256":"98d58c5276c3fb7146c7c54986354c245a77e4a5e4c378a59e85b38b922dc782"}