{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IUNUUC6ILHO5RN3EABVGPTOMFC","short_pith_number":"pith:IUNUUC6I","canonical_record":{"source":{"id":"1804.00989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-04-03T14:26:18Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"95da0e01d18c06fed4d6779932303136afd3c2086ca4a769dd08de2c33df467c","abstract_canon_sha256":"fe8d100f7ffafdd8e31d76899177f436bc2b55200bedf54c92447f8c82bc8c07"},"schema_version":"1.0"},"canonical_sha256":"451b4a0bc859ddd8b764006a67cdcc288937a2dadf47abf800b6afae9de61235","source":{"kind":"arxiv","id":"1804.00989","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00989","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00989v1","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00989","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"IUNUUC6ILHO5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IUNUUC6ILHO5RN3E","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IUNUUC6I","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IUNUUC6ILHO5RN3EABVGPTOMFC","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-04-03T14:26:18Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"95da0e01d18c06fed4d6779932303136afd3c2086ca4a769dd08de2c33df467c","abstract_canon_sha256":"fe8d100f7ffafdd8e31d76899177f436bc2b55200bedf54c92447f8c82bc8c07"},"schema_version":"1.0"},"canonical_sha256":"451b4a0bc859ddd8b764006a67cdcc288937a2dadf47abf800b6afae9de61235","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:31.610250Z","signature_b64":"n3Fg+cihehnkHN0G2s/WBcqzjZ7yKH2U0stXSISkwz+3wEVy5EW1yOTEp2Tw8LqZEL803H9cRQNYGs/hFoAoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"451b4a0bc859ddd8b764006a67cdcc288937a2dadf47abf800b6afae9de61235","last_reissued_at":"2026-05-18T00:19:31.609640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:31.609640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00989","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:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6MplqcLcBWZR/493ktKrkTFC/XXP5ubKaiVHsDIyzEOoOcUKNAbjO4XsXGIfKhfl+wQVa8LEMRTb4CRlwZcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:15:41.243749Z"},"content_sha256":"827593a8b7a522ab3454c6268fd7b8e4dcc80c0cd4f8061f89226d183945600e","schema_version":"1.0","event_id":"sha256:827593a8b7a522ab3454c6268fd7b8e4dcc80c0cd4f8061f89226d183945600e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IUNUUC6ILHO5RN3EABVGPTOMFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On tight bounds for the Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Sara van de Geer","submitted_at":"2018-04-03T14:26:18Z","abstract_excerpt":"We present upper and lower bounds for the prediction error of the Lasso. For the case of random Gaussian design, we show that under mild conditions the prediction error of the Lasso is up to smaller order terms dominated by the prediction error of its noiseless counterpart. We then provide exact expressions for the prediction error of the latter, in terms of compatibility constants. Here, we assume the active components of the underlying regression function satisfy some \"betamin\" condition. For the case of fixed design, we provide upper and lower bounds, again in terms of compatibility constan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00989","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:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNKyWJI2VG1BiOuxqt8ScRh1ct+jjzAjgEDFUhx8K7lOpKryeWMLRlcxW+On//7RyuUAKq8GVwDoXz8nln6FDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:15:41.244083Z"},"content_sha256":"c1de724973d70c4544086aa6dc8ce670025cb66bd43549f7c3af2cfeb968356d","schema_version":"1.0","event_id":"sha256:c1de724973d70c4544086aa6dc8ce670025cb66bd43549f7c3af2cfeb968356d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUNUUC6ILHO5RN3EABVGPTOMFC/bundle.json","state_url":"https://pith.science/pith/IUNUUC6ILHO5RN3EABVGPTOMFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUNUUC6ILHO5RN3EABVGPTOMFC/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-02T04:15:41Z","links":{"resolver":"https://pith.science/pith/IUNUUC6ILHO5RN3EABVGPTOMFC","bundle":"https://pith.science/pith/IUNUUC6ILHO5RN3EABVGPTOMFC/bundle.json","state":"https://pith.science/pith/IUNUUC6ILHO5RN3EABVGPTOMFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUNUUC6ILHO5RN3EABVGPTOMFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IUNUUC6ILHO5RN3EABVGPTOMFC","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":"fe8d100f7ffafdd8e31d76899177f436bc2b55200bedf54c92447f8c82bc8c07","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-04-03T14:26:18Z","title_canon_sha256":"95da0e01d18c06fed4d6779932303136afd3c2086ca4a769dd08de2c33df467c"},"schema_version":"1.0","source":{"id":"1804.00989","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00989","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00989v1","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00989","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"IUNUUC6ILHO5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IUNUUC6ILHO5RN3E","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IUNUUC6I","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:c1de724973d70c4544086aa6dc8ce670025cb66bd43549f7c3af2cfeb968356d","target":"graph","created_at":"2026-05-18T00:19:31Z","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 present upper and lower bounds for the prediction error of the Lasso. For the case of random Gaussian design, we show that under mild conditions the prediction error of the Lasso is up to smaller order terms dominated by the prediction error of its noiseless counterpart. We then provide exact expressions for the prediction error of the latter, in terms of compatibility constants. Here, we assume the active components of the underlying regression function satisfy some \"betamin\" condition. For the case of fixed design, we provide upper and lower bounds, again in terms of compatibility constan","authors_text":"Sara van de Geer","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-04-03T14:26:18Z","title":"On tight bounds for the Lasso"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00989","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:827593a8b7a522ab3454c6268fd7b8e4dcc80c0cd4f8061f89226d183945600e","target":"record","created_at":"2026-05-18T00:19:31Z","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":"fe8d100f7ffafdd8e31d76899177f436bc2b55200bedf54c92447f8c82bc8c07","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-04-03T14:26:18Z","title_canon_sha256":"95da0e01d18c06fed4d6779932303136afd3c2086ca4a769dd08de2c33df467c"},"schema_version":"1.0","source":{"id":"1804.00989","kind":"arxiv","version":1}},"canonical_sha256":"451b4a0bc859ddd8b764006a67cdcc288937a2dadf47abf800b6afae9de61235","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"451b4a0bc859ddd8b764006a67cdcc288937a2dadf47abf800b6afae9de61235","first_computed_at":"2026-05-18T00:19:31.609640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:31.609640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n3Fg+cihehnkHN0G2s/WBcqzjZ7yKH2U0stXSISkwz+3wEVy5EW1yOTEp2Tw8LqZEL803H9cRQNYGs/hFoAoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:31.610250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00989","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:827593a8b7a522ab3454c6268fd7b8e4dcc80c0cd4f8061f89226d183945600e","sha256:c1de724973d70c4544086aa6dc8ce670025cb66bd43549f7c3af2cfeb968356d"],"state_sha256":"636d8adae290cd929e53c747716edf0cc4db0803c67a42f2996bfe6ae915c641"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlSl2ZClNeC0E78YV7h8B8nzHUiIdD1M2/1vsdCPOadB7lAmpHY75g2B3UmV8y/ySqamXQ05LccVlH/fPWiwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:15:41.245990Z","bundle_sha256":"db0b5673239bbbdeeebebb8b27fd08f86a0c78588d8de5829e91a35d8763dfb9"}}