{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XAC5TXUBUYA5WSBAPLOGKHIQG3","short_pith_number":"pith:XAC5TXUB","canonical_record":{"source":{"id":"1109.4003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-09-19T11:44:54Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"b032eda23a0eb2ba885801ed3fb96c809257a4d9fa420c1e38e84731b4c898a3","abstract_canon_sha256":"1531c2d6c27ccd817771f7d4b2bd8c4456a5b37143cce65ac9f7da297b93abb9"},"schema_version":"1.0"},"canonical_sha256":"b805d9de81a601db48207adc651d1036e1ed7e22ab7db07d697c939507425b59","source":{"kind":"arxiv","id":"1109.4003","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4003","created_at":"2026-05-18T02:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4003v2","created_at":"2026-05-18T02:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4003","created_at":"2026-05-18T02:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"XAC5TXUBUYA5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XAC5TXUBUYA5WSBA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XAC5TXUB","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XAC5TXUBUYA5WSBAPLOGKHIQG3","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-09-19T11:44:54Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"b032eda23a0eb2ba885801ed3fb96c809257a4d9fa420c1e38e84731b4c898a3","abstract_canon_sha256":"1531c2d6c27ccd817771f7d4b2bd8c4456a5b37143cce65ac9f7da297b93abb9"},"schema_version":"1.0"},"canonical_sha256":"b805d9de81a601db48207adc651d1036e1ed7e22ab7db07d697c939507425b59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:43.449668Z","signature_b64":"q+lewFkpNEp+JDDagtPA/bQ7rL4+S90qo8L3DFFHiH8+O0dNsn66Qw7f9V2bldek+7Q986+sQ7J19oGZ0I2bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b805d9de81a601db48207adc651d1036e1ed7e22ab7db07d697c939507425b59","last_reissued_at":"2026-05-18T02:50:43.449164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:43.449164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4003","source_version":2,"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-18T02:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7h2/cltbaEzFuoBnJQT0JNkhj5g/0X7SIBPu1vQIgFRAupt7z3t5nsOXVGXB//Oh3n0oxehSovnyyWLLA/ZkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:12.321841Z"},"content_sha256":"7f0b22baae2c449a2764bb0099732cfa5670562d453a6c8cc105bc3e2926926a","schema_version":"1.0","event_id":"sha256:7f0b22baae2c449a2764bb0099732cfa5670562d453a6c8cc105bc3e2926926a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XAC5TXUBUYA5WSBAPLOGKHIQG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GLMMLasso: An Algorithm for High-Dimensional Generalized Linear Mixed Models Using L1-Penalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.CO","authors_text":"J\\\"urg Schelldorfer, Lukas Meier, Peter B\\\"uhlmann","submitted_at":"2011-09-19T11:44:54Z","abstract_excerpt":"We propose an L1-penalized algorithm for fitting high-dimensional generalized linear mixed models. Generalized linear mixed models (GLMMs) can be viewed as an extension of generalized linear models for clustered observations. This Lasso-type approach for GLMMs should be mainly used as variable screening method to reduce the number of variables below the sample size. We then suggest a refitting by maximum likelihood based on the selected variables only. This is an effective correction to overcome problems stemming from the variable screening procedure which are more severe with GLMMs. We illust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4003","kind":"arxiv","version":2},"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-18T02:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzwrB9Iw+IovtuUgC5rJuueh+bsABLzfC1YD4UWG7Y6UW2SvfSO/DFhcYdmeIEsYUB0SPJITn0QCRW2xkgvYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:12.322188Z"},"content_sha256":"886650d879430d23563808a20deed66057cc9032ec19ef945a8b33fb0680d2a1","schema_version":"1.0","event_id":"sha256:886650d879430d23563808a20deed66057cc9032ec19ef945a8b33fb0680d2a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XAC5TXUBUYA5WSBAPLOGKHIQG3/bundle.json","state_url":"https://pith.science/pith/XAC5TXUBUYA5WSBAPLOGKHIQG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XAC5TXUBUYA5WSBAPLOGKHIQG3/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-02T19:26:12Z","links":{"resolver":"https://pith.science/pith/XAC5TXUBUYA5WSBAPLOGKHIQG3","bundle":"https://pith.science/pith/XAC5TXUBUYA5WSBAPLOGKHIQG3/bundle.json","state":"https://pith.science/pith/XAC5TXUBUYA5WSBAPLOGKHIQG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XAC5TXUBUYA5WSBAPLOGKHIQG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XAC5TXUBUYA5WSBAPLOGKHIQG3","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":"1531c2d6c27ccd817771f7d4b2bd8c4456a5b37143cce65ac9f7da297b93abb9","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-09-19T11:44:54Z","title_canon_sha256":"b032eda23a0eb2ba885801ed3fb96c809257a4d9fa420c1e38e84731b4c898a3"},"schema_version":"1.0","source":{"id":"1109.4003","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4003","created_at":"2026-05-18T02:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4003v2","created_at":"2026-05-18T02:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4003","created_at":"2026-05-18T02:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"XAC5TXUBUYA5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XAC5TXUBUYA5WSBA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XAC5TXUB","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:886650d879430d23563808a20deed66057cc9032ec19ef945a8b33fb0680d2a1","target":"graph","created_at":"2026-05-18T02:50:43Z","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 propose an L1-penalized algorithm for fitting high-dimensional generalized linear mixed models. Generalized linear mixed models (GLMMs) can be viewed as an extension of generalized linear models for clustered observations. This Lasso-type approach for GLMMs should be mainly used as variable screening method to reduce the number of variables below the sample size. We then suggest a refitting by maximum likelihood based on the selected variables only. This is an effective correction to overcome problems stemming from the variable screening procedure which are more severe with GLMMs. We illust","authors_text":"J\\\"urg Schelldorfer, Lukas Meier, Peter B\\\"uhlmann","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-09-19T11:44:54Z","title":"GLMMLasso: An Algorithm for High-Dimensional Generalized Linear Mixed Models Using L1-Penalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4003","kind":"arxiv","version":2},"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:7f0b22baae2c449a2764bb0099732cfa5670562d453a6c8cc105bc3e2926926a","target":"record","created_at":"2026-05-18T02:50:43Z","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":"1531c2d6c27ccd817771f7d4b2bd8c4456a5b37143cce65ac9f7da297b93abb9","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-09-19T11:44:54Z","title_canon_sha256":"b032eda23a0eb2ba885801ed3fb96c809257a4d9fa420c1e38e84731b4c898a3"},"schema_version":"1.0","source":{"id":"1109.4003","kind":"arxiv","version":2}},"canonical_sha256":"b805d9de81a601db48207adc651d1036e1ed7e22ab7db07d697c939507425b59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b805d9de81a601db48207adc651d1036e1ed7e22ab7db07d697c939507425b59","first_computed_at":"2026-05-18T02:50:43.449164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:43.449164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q+lewFkpNEp+JDDagtPA/bQ7rL4+S90qo8L3DFFHiH8+O0dNsn66Qw7f9V2bldek+7Q986+sQ7J19oGZ0I2bAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:43.449668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4003","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f0b22baae2c449a2764bb0099732cfa5670562d453a6c8cc105bc3e2926926a","sha256:886650d879430d23563808a20deed66057cc9032ec19ef945a8b33fb0680d2a1"],"state_sha256":"ccf25d2f5c7115e4e0b6ad4a3ba482edabe5033f2a76f5f31da7311c9f09cba3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uK62cLzQ1eE1WB/Lf8odfsL3IIq/pT4v731y1TOfb4vfe1oPHHfJzSJ+g1jcz9kkvb4K7njq6kFcl8NSAC0HAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:26:12.324134Z","bundle_sha256":"b9d7c6c188fd210a5b67110bc2a0b40a44d97992eedc153c2eb4599cc11b9c08"}}