{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IS2YW66CRUA6HW6ZFQIIAQR343","short_pith_number":"pith:IS2YW66C","canonical_record":{"source":{"id":"1205.0079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-01T03:37:13Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"eb1b5dbb6dcc5e41d3fa8ba599b617644788f06ce6ec99cda605956cc261c99e","abstract_canon_sha256":"b23d644cf5af279d74ef4a992eb740bad78b46ee1c5d593f3642b3927aa26973"},"schema_version":"1.0"},"canonical_sha256":"44b58b7bc28d01e3dbd92c1080423be6e60e4bbfc1398613474f7a9be3a8e9ce","source":{"kind":"arxiv","id":"1205.0079","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0079","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0079v2","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0079","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"pith_short_12","alias_value":"IS2YW66CRUA6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IS2YW66CRUA6HW6Z","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IS2YW66C","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IS2YW66CRUA6HW6ZFQIIAQR343","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-01T03:37:13Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"eb1b5dbb6dcc5e41d3fa8ba599b617644788f06ce6ec99cda605956cc261c99e","abstract_canon_sha256":"b23d644cf5af279d74ef4a992eb740bad78b46ee1c5d593f3642b3927aa26973"},"schema_version":"1.0"},"canonical_sha256":"44b58b7bc28d01e3dbd92c1080423be6e60e4bbfc1398613474f7a9be3a8e9ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:13.689953Z","signature_b64":"k2My9b0vXYNYF7p/TXVFUjJPUIxcaNxFP1AP15U4TAT45ZKvu5OnBZFjaSO9Sf/wRwdyvZeOWv9+n//ol2ySAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b58b7bc28d01e3dbd92c1080423be6e60e4bbfc1398613474f7a9be3a8e9ce","last_reissued_at":"2026-05-18T03:55:13.689357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:13.689357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0079","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-18T03:55:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+UHH4VwFygZANu2khkwaHj66gI9R+U9tTf91kExbceuWbs5VrJZUt+hy4duj2ib9XaHNuhLXkHFCMbXUIbDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:44:58.429678Z"},"content_sha256":"0da453314c70f5f71fa2da7383da9b5b6638b122f5defecd9c6d988118535dd1","schema_version":"1.0","event_id":"sha256:0da453314c70f5f71fa2da7383da9b5b6638b122f5defecd9c6d988118535dd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IS2YW66CRUA6HW6ZFQIIAQR343","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Analysis of the Lasso Regularization Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Bin Yu, Julien Mairal","submitted_at":"2012-05-01T03:37:13Z","abstract_excerpt":"The regularization path of the Lasso can be shown to be piecewise linear, making it possible to \"follow\" and explicitly compute the entire path. We analyze in this paper this popular strategy, and prove that its worst case complexity is exponential in the number of variables. We then oppose this pessimistic result to an (optimistic) approximate analysis: We show that an approximate path with at most O(1/sqrt(epsilon)) linear segments can always be obtained, where every point on the path is guaranteed to be optimal up to a relative epsilon-duality gap. We complete our theoretical analysis with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0079","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-18T03:55:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHaRlhFW2Va7/roJ/MuCaupzwYzq8y3DLghA+f4r3UWh03ozF4V6M7JyEe/DcSp1VCGulrmwx5z8RvbQGjnbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:44:58.430425Z"},"content_sha256":"fb3f23d882ae38d9fdf758541415de7bdf416ebc463965af1ae640e8441ee56c","schema_version":"1.0","event_id":"sha256:fb3f23d882ae38d9fdf758541415de7bdf416ebc463965af1ae640e8441ee56c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS2YW66CRUA6HW6ZFQIIAQR343/bundle.json","state_url":"https://pith.science/pith/IS2YW66CRUA6HW6ZFQIIAQR343/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS2YW66CRUA6HW6ZFQIIAQR343/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-07T05:44:58Z","links":{"resolver":"https://pith.science/pith/IS2YW66CRUA6HW6ZFQIIAQR343","bundle":"https://pith.science/pith/IS2YW66CRUA6HW6ZFQIIAQR343/bundle.json","state":"https://pith.science/pith/IS2YW66CRUA6HW6ZFQIIAQR343/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS2YW66CRUA6HW6ZFQIIAQR343/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IS2YW66CRUA6HW6ZFQIIAQR343","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":"b23d644cf5af279d74ef4a992eb740bad78b46ee1c5d593f3642b3927aa26973","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-01T03:37:13Z","title_canon_sha256":"eb1b5dbb6dcc5e41d3fa8ba599b617644788f06ce6ec99cda605956cc261c99e"},"schema_version":"1.0","source":{"id":"1205.0079","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0079","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0079v2","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0079","created_at":"2026-05-18T03:55:13Z"},{"alias_kind":"pith_short_12","alias_value":"IS2YW66CRUA6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IS2YW66CRUA6HW6Z","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IS2YW66C","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:fb3f23d882ae38d9fdf758541415de7bdf416ebc463965af1ae640e8441ee56c","target":"graph","created_at":"2026-05-18T03:55:13Z","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":"The regularization path of the Lasso can be shown to be piecewise linear, making it possible to \"follow\" and explicitly compute the entire path. We analyze in this paper this popular strategy, and prove that its worst case complexity is exponential in the number of variables. We then oppose this pessimistic result to an (optimistic) approximate analysis: We show that an approximate path with at most O(1/sqrt(epsilon)) linear segments can always be obtained, where every point on the path is guaranteed to be optimal up to a relative epsilon-duality gap. We complete our theoretical analysis with ","authors_text":"Bin Yu, Julien Mairal","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-01T03:37:13Z","title":"Complexity Analysis of the Lasso Regularization Path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0079","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:0da453314c70f5f71fa2da7383da9b5b6638b122f5defecd9c6d988118535dd1","target":"record","created_at":"2026-05-18T03:55:13Z","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":"b23d644cf5af279d74ef4a992eb740bad78b46ee1c5d593f3642b3927aa26973","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-01T03:37:13Z","title_canon_sha256":"eb1b5dbb6dcc5e41d3fa8ba599b617644788f06ce6ec99cda605956cc261c99e"},"schema_version":"1.0","source":{"id":"1205.0079","kind":"arxiv","version":2}},"canonical_sha256":"44b58b7bc28d01e3dbd92c1080423be6e60e4bbfc1398613474f7a9be3a8e9ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44b58b7bc28d01e3dbd92c1080423be6e60e4bbfc1398613474f7a9be3a8e9ce","first_computed_at":"2026-05-18T03:55:13.689357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:13.689357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k2My9b0vXYNYF7p/TXVFUjJPUIxcaNxFP1AP15U4TAT45ZKvu5OnBZFjaSO9Sf/wRwdyvZeOWv9+n//ol2ySAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:13.689953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0079","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0da453314c70f5f71fa2da7383da9b5b6638b122f5defecd9c6d988118535dd1","sha256:fb3f23d882ae38d9fdf758541415de7bdf416ebc463965af1ae640e8441ee56c"],"state_sha256":"d8ac875b2975cb70ff7ce10106fcf79246a11803ae07fcc638a9569242deffa0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jddp2TTEXJu0f+/bTfklG64QsPWYtdEFcthxPqy+GsLB4Z2g1cxc84p9EphA1FgVQw08IdCent7UpvZAkv6LDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:44:58.433807Z","bundle_sha256":"67a3340a187d0d27b037e0ccbfcb88b784acefecfa3735bb16814feb0e3a996d"}}