{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MVBCWEG2YSFVTSI7XTNEVNPDRQ","short_pith_number":"pith:MVBCWEG2","canonical_record":{"source":{"id":"1606.02702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T19:51:47Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"770bc90db584b3712e554b5bbf31d960c663a7e8c9c179b515448a6fd5d27042","abstract_canon_sha256":"a5ebdda183975741d76c6de60445e13f65b782eecc6212c8028337a75c0acd91"},"schema_version":"1.0"},"canonical_sha256":"65422b10dac48b59c91fbcda4ab5e38c0885d92d06cb1ac31d83607b46aa4363","source":{"kind":"arxiv","id":"1606.02702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02702","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02702v1","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02702","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"MVBCWEG2YSFV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVBCWEG2YSFVTSI7","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVBCWEG2","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MVBCWEG2YSFVTSI7XTNEVNPDRQ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T19:51:47Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"770bc90db584b3712e554b5bbf31d960c663a7e8c9c179b515448a6fd5d27042","abstract_canon_sha256":"a5ebdda183975741d76c6de60445e13f65b782eecc6212c8028337a75c0acd91"},"schema_version":"1.0"},"canonical_sha256":"65422b10dac48b59c91fbcda4ab5e38c0885d92d06cb1ac31d83607b46aa4363","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:09.114713Z","signature_b64":"tXt8pxJ5NlAZxH8GOc9fEssSddhEAYGeeEX/sIYegipnXK4TNYZe03sk67gXfMwTkCL70LLti51TEB+A1o/LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65422b10dac48b59c91fbcda4ab5e38c0885d92d06cb1ac31d83607b46aa4363","last_reissued_at":"2026-05-18T00:30:09.114206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:09.114206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02702","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:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ii+kwG0wUecF/t604fqLWpKu1UE8eUj6nuJef6azUJL00DdHiaBUfIUFURnqCujAnEjrn+vfi4T7iOGXOAaFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:45:55.718540Z"},"content_sha256":"3fa36817ed36fffc67d8a9c49adb2bcf4c86fb0bcbfaade716674aa543be092c","schema_version":"1.0","event_id":"sha256:3fa36817ed36fffc67d8a9c49adb2bcf4c86fb0bcbfaade716674aa543be092c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MVBCWEG2YSFVTSI7XTNEVNPDRQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Eugene Ndiaye, Joseph Salmon, Olivier Fercoq, Vincent Lecl\\`ere","submitted_at":"2016-06-08T19:51:47Z","abstract_excerpt":"In high dimensional settings, sparse structures are crucial for efficiency, both in term of memory, computation and performance. It is customary to consider $\\ell_1$ penalty to enforce sparsity in such scenarios. Sparsity enforcing methods, the Lasso being a canonical example, are popular candidates to address high dimension. For efficiency, they rely on tuning a parameter trading data fitting versus sparsity. For the Lasso theory to hold this tuning parameter should be proportional to the noise level, yet the latter is often unknown in practice. A possible remedy is to jointly optimize over t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02702","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:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vuJoqvL4rD+TEi+2uy6JfwmYAX90q88dT6IxM+xEZWcWtFXM/0PyEHIfpwCrTd3hkG9PK8R6Mv6cQjPof1SlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:45:55.719231Z"},"content_sha256":"825460283dec63d3404e4bdec7a5ff77087f8b96629fe99b91d060189991128f","schema_version":"1.0","event_id":"sha256:825460283dec63d3404e4bdec7a5ff77087f8b96629fe99b91d060189991128f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/bundle.json","state_url":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/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-25T09:45:55Z","links":{"resolver":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ","bundle":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/bundle.json","state":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MVBCWEG2YSFVTSI7XTNEVNPDRQ","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":"a5ebdda183975741d76c6de60445e13f65b782eecc6212c8028337a75c0acd91","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T19:51:47Z","title_canon_sha256":"770bc90db584b3712e554b5bbf31d960c663a7e8c9c179b515448a6fd5d27042"},"schema_version":"1.0","source":{"id":"1606.02702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02702","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02702v1","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02702","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"MVBCWEG2YSFV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVBCWEG2YSFVTSI7","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVBCWEG2","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:825460283dec63d3404e4bdec7a5ff77087f8b96629fe99b91d060189991128f","target":"graph","created_at":"2026-05-18T00:30:09Z","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":"In high dimensional settings, sparse structures are crucial for efficiency, both in term of memory, computation and performance. It is customary to consider $\\ell_1$ penalty to enforce sparsity in such scenarios. Sparsity enforcing methods, the Lasso being a canonical example, are popular candidates to address high dimension. For efficiency, they rely on tuning a parameter trading data fitting versus sparsity. For the Lasso theory to hold this tuning parameter should be proportional to the noise level, yet the latter is often unknown in practice. A possible remedy is to jointly optimize over t","authors_text":"Alexandre Gramfort, Eugene Ndiaye, Joseph Salmon, Olivier Fercoq, Vincent Lecl\\`ere","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T19:51:47Z","title":"Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02702","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:3fa36817ed36fffc67d8a9c49adb2bcf4c86fb0bcbfaade716674aa543be092c","target":"record","created_at":"2026-05-18T00:30:09Z","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":"a5ebdda183975741d76c6de60445e13f65b782eecc6212c8028337a75c0acd91","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T19:51:47Z","title_canon_sha256":"770bc90db584b3712e554b5bbf31d960c663a7e8c9c179b515448a6fd5d27042"},"schema_version":"1.0","source":{"id":"1606.02702","kind":"arxiv","version":1}},"canonical_sha256":"65422b10dac48b59c91fbcda4ab5e38c0885d92d06cb1ac31d83607b46aa4363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65422b10dac48b59c91fbcda4ab5e38c0885d92d06cb1ac31d83607b46aa4363","first_computed_at":"2026-05-18T00:30:09.114206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:09.114206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tXt8pxJ5NlAZxH8GOc9fEssSddhEAYGeeEX/sIYegipnXK4TNYZe03sk67gXfMwTkCL70LLti51TEB+A1o/LBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:09.114713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fa36817ed36fffc67d8a9c49adb2bcf4c86fb0bcbfaade716674aa543be092c","sha256:825460283dec63d3404e4bdec7a5ff77087f8b96629fe99b91d060189991128f"],"state_sha256":"7540fd42ff385b9f152ac0624e326b58bdfd622c42dbe952a337582e39718bbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnE5G9Mk8IsBv+QLwKEt2nt8z6iqtZ6Qhd1ODvHmnSmxURcYDffQI5gCbhieHCc6xyAAmbo1yvJTpjkXdoDSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:45:55.722935Z","bundle_sha256":"729ef822219702e9a5f7d913b0cacbeb6622c446da605b9a3a751921da28429c"}}