{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DJLXGJLBMTNS7WEHLD2PQSXFMT","short_pith_number":"pith:DJLXGJLB","canonical_record":{"source":{"id":"1505.01949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-08T07:57:15Z","cross_cats_sorted":[],"title_canon_sha256":"1e65c184e10deb6d2354219f8b2658222a0c28f2b8f9e6b0ffbd77cb9e028fae","abstract_canon_sha256":"d591a7901dcb2931a9b31f956552c1fb6cca91b0732f504bd419db54c5db70f5"},"schema_version":"1.0"},"canonical_sha256":"1a5773256164db2fd88758f4f84ae564ee8db0da0bc2732682c2e74380a7810e","source":{"kind":"arxiv","id":"1505.01949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01949","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01949v1","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01949","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"DJLXGJLBMTNS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DJLXGJLBMTNS7WEH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DJLXGJLB","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DJLXGJLBMTNS7WEHLD2PQSXFMT","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-08T07:57:15Z","cross_cats_sorted":[],"title_canon_sha256":"1e65c184e10deb6d2354219f8b2658222a0c28f2b8f9e6b0ffbd77cb9e028fae","abstract_canon_sha256":"d591a7901dcb2931a9b31f956552c1fb6cca91b0732f504bd419db54c5db70f5"},"schema_version":"1.0"},"canonical_sha256":"1a5773256164db2fd88758f4f84ae564ee8db0da0bc2732682c2e74380a7810e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:18.768538Z","signature_b64":"EkzyCTpLdvtTzWFrwzRCzcP9i1UY74qWAWP2ukj+9b7FTNEV0dD9vO5nl14/O1uV7RzwCTOrAUGp1ICQtgUsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a5773256164db2fd88758f4f84ae564ee8db0da0bc2732682c2e74380a7810e","last_reissued_at":"2026-05-18T01:16:18.768028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:18.768028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01949","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-18T01:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TkHk+wQY/UPjzaDGuNxo8foBbr3fQDem6V7BhgNv6xS+RFZz0HP53vvBq7bjKle0luNvtNIcEi+azyLNqdFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:31:21.090753Z"},"content_sha256":"eb869f0e6054bf4baf263395c511a4ac87e6241b276304335eda95d9834e5966","schema_version":"1.0","event_id":"sha256:eb869f0e6054bf4baf263395c511a4ac87e6241b276304335eda95d9834e5966"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DJLXGJLBMTNS7WEHLD2PQSXFMT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An adaptive Ridge procedure for L0 regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Florian Frommlet, Gregory Nuel","submitted_at":"2015-05-08T07:57:15Z","abstract_excerpt":"Penalized selection criteria like AIC or BIC are among the most popular methods for variable selection. Their theoretical properties have been studied intensively and are well understood, but making use of them in case of high-dimensional data is difficult due to the non-convex optimization problem induced by L0 penalties. An elegant solution to this problem is provided by the multi-step adaptive lasso, where iteratively weighted lasso problems are solved, whose weights are updated in such a way that the procedure converges towards selection with L0 penalties. In this paper we introduce an ada"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01949","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-18T01:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueCrHLhS1xUHjmnIAFAdostpoqo/lu48BhEkpJ5niK3tfkp3Q61j8sOUE1o72L4hcY/s76sZI+NuCnmdsaWBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:31:21.091104Z"},"content_sha256":"b8f9d76dfbf908a4916cab9d7e68716dd38174440df214ccd50abeaefee8a4c0","schema_version":"1.0","event_id":"sha256:b8f9d76dfbf908a4916cab9d7e68716dd38174440df214ccd50abeaefee8a4c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJLXGJLBMTNS7WEHLD2PQSXFMT/bundle.json","state_url":"https://pith.science/pith/DJLXGJLBMTNS7WEHLD2PQSXFMT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJLXGJLBMTNS7WEHLD2PQSXFMT/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-01T03:31:21Z","links":{"resolver":"https://pith.science/pith/DJLXGJLBMTNS7WEHLD2PQSXFMT","bundle":"https://pith.science/pith/DJLXGJLBMTNS7WEHLD2PQSXFMT/bundle.json","state":"https://pith.science/pith/DJLXGJLBMTNS7WEHLD2PQSXFMT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJLXGJLBMTNS7WEHLD2PQSXFMT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DJLXGJLBMTNS7WEHLD2PQSXFMT","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":"d591a7901dcb2931a9b31f956552c1fb6cca91b0732f504bd419db54c5db70f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-08T07:57:15Z","title_canon_sha256":"1e65c184e10deb6d2354219f8b2658222a0c28f2b8f9e6b0ffbd77cb9e028fae"},"schema_version":"1.0","source":{"id":"1505.01949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01949","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01949v1","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01949","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"DJLXGJLBMTNS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DJLXGJLBMTNS7WEH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DJLXGJLB","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:b8f9d76dfbf908a4916cab9d7e68716dd38174440df214ccd50abeaefee8a4c0","target":"graph","created_at":"2026-05-18T01:16:18Z","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":"Penalized selection criteria like AIC or BIC are among the most popular methods for variable selection. Their theoretical properties have been studied intensively and are well understood, but making use of them in case of high-dimensional data is difficult due to the non-convex optimization problem induced by L0 penalties. An elegant solution to this problem is provided by the multi-step adaptive lasso, where iteratively weighted lasso problems are solved, whose weights are updated in such a way that the procedure converges towards selection with L0 penalties. In this paper we introduce an ada","authors_text":"Florian Frommlet, Gregory Nuel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-08T07:57:15Z","title":"An adaptive Ridge procedure for L0 regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01949","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:eb869f0e6054bf4baf263395c511a4ac87e6241b276304335eda95d9834e5966","target":"record","created_at":"2026-05-18T01:16:18Z","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":"d591a7901dcb2931a9b31f956552c1fb6cca91b0732f504bd419db54c5db70f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-08T07:57:15Z","title_canon_sha256":"1e65c184e10deb6d2354219f8b2658222a0c28f2b8f9e6b0ffbd77cb9e028fae"},"schema_version":"1.0","source":{"id":"1505.01949","kind":"arxiv","version":1}},"canonical_sha256":"1a5773256164db2fd88758f4f84ae564ee8db0da0bc2732682c2e74380a7810e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a5773256164db2fd88758f4f84ae564ee8db0da0bc2732682c2e74380a7810e","first_computed_at":"2026-05-18T01:16:18.768028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:18.768028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EkzyCTpLdvtTzWFrwzRCzcP9i1UY74qWAWP2ukj+9b7FTNEV0dD9vO5nl14/O1uV7RzwCTOrAUGp1ICQtgUsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:18.768538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb869f0e6054bf4baf263395c511a4ac87e6241b276304335eda95d9834e5966","sha256:b8f9d76dfbf908a4916cab9d7e68716dd38174440df214ccd50abeaefee8a4c0"],"state_sha256":"27bdf8b9126c1b5e6f7725a642ab5531a9cbf16a2e19d2d80e1790de984e37fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfCI2HH/Da8MFKbV+9456HK0St+zRM32Nhkr4sa7p1zDs52UX5gJjJDuZpjLzxBnn92NxHZEgIURVhbakyCuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:31:21.093413Z","bundle_sha256":"815c3618c9068a53fab7378603ebe3823dc1f812b379d75d584014541c6a6a17"}}