{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2N2X62B5GPI5WIWD2TCRJQQLWV","short_pith_number":"pith:2N2X62B5","canonical_record":{"source":{"id":"1409.8491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-09-30T11:25:39Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"2924853d17e241d7389d8addad1e19ac94e45d47da73c3dc15c2a27a9d9759b6","abstract_canon_sha256":"7cdbf89cdd52c790979635da85e5733d8f25016554d84ed33736c7093023f260"},"schema_version":"1.0"},"canonical_sha256":"d3757f683d33d1db22c3d4c514c20bb57ad13e7678e26c4934f0bfe51de161d3","source":{"kind":"arxiv","id":"1409.8491","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8491","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8491v3","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8491","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"2N2X62B5GPI5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2N2X62B5GPI5WIWD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2N2X62B5","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2N2X62B5GPI5WIWD2TCRJQQLWV","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-09-30T11:25:39Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"2924853d17e241d7389d8addad1e19ac94e45d47da73c3dc15c2a27a9d9759b6","abstract_canon_sha256":"7cdbf89cdd52c790979635da85e5733d8f25016554d84ed33736c7093023f260"},"schema_version":"1.0"},"canonical_sha256":"d3757f683d33d1db22c3d4c514c20bb57ad13e7678e26c4934f0bfe51de161d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:04.719497Z","signature_b64":"Gfj4ZR/oDD+J55YoMROv5n1YRKlgOBs6iKXtuxIBH41IW0MIGJhSCQkruwhX7X2ZRCIwYhbQu2PT24zLOvgVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3757f683d33d1db22c3d4c514c20bb57ad13e7678e26c4934f0bfe51de161d3","last_reissued_at":"2026-05-18T01:18:04.718760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:04.718760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8491","source_version":3,"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-18T01:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jn6g2c50Qa+W71IQKsSbWSr1qYjkqCEA+q1MpBwJLGF6EnFhxLCT7jtItQRDTznaNUR5brjAEvwvavh2j70vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:30:04.381029Z"},"content_sha256":"dc380a87bb2aa7e5580eca54c898dda250b2e7db751c61e9080998ae2deceba7","schema_version":"1.0","event_id":"sha256:dc380a87bb2aa7e5580eca54c898dda250b2e7db751c61e9080998ae2deceba7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2N2X62B5GPI5WIWD2TCRJQQLWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model selection and minimax estimation in generalized linear models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Felix Abramovich, Vadim Grinshtein","submitted_at":"2014-09-30T11:25:39Z","abstract_excerpt":"We consider model selection in generalized linear models (GLM) for high-dimensional data and propose a wide class of model selection criteria based on penalized maximum likelihood with a complexity penalty on the model size. We derive a general nonasymptotic upper bound for the expected Kullback-Leibler divergence between the true distribution of the data and that generated by a selected model, and establish the corresponding minimax lower bounds for sparse GLM. For the properly chosen (nonlinear) penalty, the resulting penalized maximum likelihood estimator is shown to be asymptotically minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8491","kind":"arxiv","version":3},"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-18T01:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Mzetm1bDSg6FFnUaF9DeBrCvKLnghjgopdL3KwBrUxGhM5J1m/4OC77hCnvXybilUXNWlSphJos2aVX3Dg2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:30:04.381398Z"},"content_sha256":"5c8a2dd7fb950991f0027774cbd3f0952b5633cbf7836ac41b298b2f7b66083c","schema_version":"1.0","event_id":"sha256:5c8a2dd7fb950991f0027774cbd3f0952b5633cbf7836ac41b298b2f7b66083c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2N2X62B5GPI5WIWD2TCRJQQLWV/bundle.json","state_url":"https://pith.science/pith/2N2X62B5GPI5WIWD2TCRJQQLWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2N2X62B5GPI5WIWD2TCRJQQLWV/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-30T09:30:04Z","links":{"resolver":"https://pith.science/pith/2N2X62B5GPI5WIWD2TCRJQQLWV","bundle":"https://pith.science/pith/2N2X62B5GPI5WIWD2TCRJQQLWV/bundle.json","state":"https://pith.science/pith/2N2X62B5GPI5WIWD2TCRJQQLWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2N2X62B5GPI5WIWD2TCRJQQLWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2N2X62B5GPI5WIWD2TCRJQQLWV","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":"7cdbf89cdd52c790979635da85e5733d8f25016554d84ed33736c7093023f260","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-09-30T11:25:39Z","title_canon_sha256":"2924853d17e241d7389d8addad1e19ac94e45d47da73c3dc15c2a27a9d9759b6"},"schema_version":"1.0","source":{"id":"1409.8491","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8491","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8491v3","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8491","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"2N2X62B5GPI5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2N2X62B5GPI5WIWD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2N2X62B5","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:5c8a2dd7fb950991f0027774cbd3f0952b5633cbf7836ac41b298b2f7b66083c","target":"graph","created_at":"2026-05-18T01:18:04Z","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 model selection in generalized linear models (GLM) for high-dimensional data and propose a wide class of model selection criteria based on penalized maximum likelihood with a complexity penalty on the model size. We derive a general nonasymptotic upper bound for the expected Kullback-Leibler divergence between the true distribution of the data and that generated by a selected model, and establish the corresponding minimax lower bounds for sparse GLM. For the properly chosen (nonlinear) penalty, the resulting penalized maximum likelihood estimator is shown to be asymptotically minim","authors_text":"Felix Abramovich, Vadim Grinshtein","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-09-30T11:25:39Z","title":"Model selection and minimax estimation in generalized linear models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8491","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:dc380a87bb2aa7e5580eca54c898dda250b2e7db751c61e9080998ae2deceba7","target":"record","created_at":"2026-05-18T01:18:04Z","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":"7cdbf89cdd52c790979635da85e5733d8f25016554d84ed33736c7093023f260","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-09-30T11:25:39Z","title_canon_sha256":"2924853d17e241d7389d8addad1e19ac94e45d47da73c3dc15c2a27a9d9759b6"},"schema_version":"1.0","source":{"id":"1409.8491","kind":"arxiv","version":3}},"canonical_sha256":"d3757f683d33d1db22c3d4c514c20bb57ad13e7678e26c4934f0bfe51de161d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3757f683d33d1db22c3d4c514c20bb57ad13e7678e26c4934f0bfe51de161d3","first_computed_at":"2026-05-18T01:18:04.718760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:04.718760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gfj4ZR/oDD+J55YoMROv5n1YRKlgOBs6iKXtuxIBH41IW0MIGJhSCQkruwhX7X2ZRCIwYhbQu2PT24zLOvgVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:04.719497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8491","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc380a87bb2aa7e5580eca54c898dda250b2e7db751c61e9080998ae2deceba7","sha256:5c8a2dd7fb950991f0027774cbd3f0952b5633cbf7836ac41b298b2f7b66083c"],"state_sha256":"180e7cf21ad4e0de11eb6b1b38ce61806f772ebab007ee16ee6b862e4ea5cd3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7V5aIt8U7VbKDndKPVGv7fKYqJ1XFlyZpTUh/BPU53no+N3dhG/SOCN9tM/rTkO5gyFs2dpF1V/w+wSMMEVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T09:30:04.383252Z","bundle_sha256":"20025a3e6e8b60b8edc5911bd16e7ddc45458c9b4f965a3b1dc2ae1f6e04757b"}}