{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OMREILFTDZ3IWQ2NZ7JINN73JC","short_pith_number":"pith:OMREILFT","canonical_record":{"source":{"id":"1703.01332","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-03T20:33:58Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"fe32375e8d7d6a5368f0babf9a722981bd4d6e2c8acd65ee281be20c3946138b","abstract_canon_sha256":"9ab0b34891445ae2efdb013c494f6712a82d9209b08b9532b5a3881ae3f36acd"},"schema_version":"1.0"},"canonical_sha256":"7322442cb31e768b434dcfd286b7fb488366a43dc7995325c36fc68baf42f878","source":{"kind":"arxiv","id":"1703.01332","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01332","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01332v3","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01332","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"OMREILFTDZ3I","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OMREILFTDZ3IWQ2N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OMREILFT","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OMREILFTDZ3IWQ2NZ7JINN73JC","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01332","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-03T20:33:58Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"fe32375e8d7d6a5368f0babf9a722981bd4d6e2c8acd65ee281be20c3946138b","abstract_canon_sha256":"9ab0b34891445ae2efdb013c494f6712a82d9209b08b9532b5a3881ae3f36acd"},"schema_version":"1.0"},"canonical_sha256":"7322442cb31e768b434dcfd286b7fb488366a43dc7995325c36fc68baf42f878","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.220238Z","signature_b64":"GeLfLGT9GNVCZnxb8wWdtDJ1ozL4X1q426QnKb5hSF2sC5GBS2bhEE5V+G/nbtzv6Nrnu3eyTtTQy9CpCUhiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7322442cb31e768b434dcfd286b7fb488366a43dc7995325c36fc68baf42f878","last_reissued_at":"2026-05-18T00:33:32.219725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.219725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01332","source_version":3,"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:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bj5/3dPRg3MndqgM90dGF1uTZavlSCY80n+Zxk6wBb9IeaAkGePQ91NhtxDkXJ/CU/U+EHu+zTtaHHX/H6boCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T13:51:50.636853Z"},"content_sha256":"142837450f6cbb93f7b1ac36449aedea84bf931690b35c3c70401731bebbe9cd","schema_version":"1.0","event_id":"sha256:142837450f6cbb93f7b1ac36449aedea84bf931690b35c3c70401731bebbe9cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OMREILFTDZ3IWQ2NZ7JINN73JC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimistic lower bounds for convex regularized least-squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Pierre C Bellec","submitted_at":"2017-03-03T20:33:58Z","abstract_excerpt":"Minimax lower bounds are pessimistic in nature: for any given estimator, minimax lower bounds yield the existence of a worst-case target vector $\\beta^*_{worst}$ for which the prediction error of the given estimator is bounded from below. However, minimax lower bounds shed no light on the prediction error of the given estimator for target vectors different than $\\beta^*_{worst}$. A characterization of the prediction error of any convex regularized least-squares is given. This characterization provide both a lower bound and an upper bound on the prediction error. This produces lower bounds that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01332","kind":"arxiv","version":3},"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:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hghYFhVFp+10yAvCnazSqVN2NietKFweq7SWWFwa+xmqvjPLJ5w9FE5JUX2rJJLagNfGSb7AXBAJA2UaFdyoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T13:51:50.637201Z"},"content_sha256":"fbb8cacc30d3076429d6087d718c6d53749327a4085c681a00f0460819f8da0d","schema_version":"1.0","event_id":"sha256:fbb8cacc30d3076429d6087d718c6d53749327a4085c681a00f0460819f8da0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMREILFTDZ3IWQ2NZ7JINN73JC/bundle.json","state_url":"https://pith.science/pith/OMREILFTDZ3IWQ2NZ7JINN73JC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMREILFTDZ3IWQ2NZ7JINN73JC/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-07-02T13:51:50Z","links":{"resolver":"https://pith.science/pith/OMREILFTDZ3IWQ2NZ7JINN73JC","bundle":"https://pith.science/pith/OMREILFTDZ3IWQ2NZ7JINN73JC/bundle.json","state":"https://pith.science/pith/OMREILFTDZ3IWQ2NZ7JINN73JC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMREILFTDZ3IWQ2NZ7JINN73JC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OMREILFTDZ3IWQ2NZ7JINN73JC","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":"9ab0b34891445ae2efdb013c494f6712a82d9209b08b9532b5a3881ae3f36acd","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-03T20:33:58Z","title_canon_sha256":"fe32375e8d7d6a5368f0babf9a722981bd4d6e2c8acd65ee281be20c3946138b"},"schema_version":"1.0","source":{"id":"1703.01332","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01332","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01332v3","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01332","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"OMREILFTDZ3I","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OMREILFTDZ3IWQ2N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OMREILFT","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:fbb8cacc30d3076429d6087d718c6d53749327a4085c681a00f0460819f8da0d","target":"graph","created_at":"2026-05-18T00:33:32Z","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":"Minimax lower bounds are pessimistic in nature: for any given estimator, minimax lower bounds yield the existence of a worst-case target vector $\\beta^*_{worst}$ for which the prediction error of the given estimator is bounded from below. However, minimax lower bounds shed no light on the prediction error of the given estimator for target vectors different than $\\beta^*_{worst}$. A characterization of the prediction error of any convex regularized least-squares is given. This characterization provide both a lower bound and an upper bound on the prediction error. This produces lower bounds that","authors_text":"Pierre C Bellec","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-03T20:33:58Z","title":"Optimistic lower bounds for convex regularized least-squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01332","kind":"arxiv","version":3},"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:142837450f6cbb93f7b1ac36449aedea84bf931690b35c3c70401731bebbe9cd","target":"record","created_at":"2026-05-18T00:33:32Z","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":"9ab0b34891445ae2efdb013c494f6712a82d9209b08b9532b5a3881ae3f36acd","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-03T20:33:58Z","title_canon_sha256":"fe32375e8d7d6a5368f0babf9a722981bd4d6e2c8acd65ee281be20c3946138b"},"schema_version":"1.0","source":{"id":"1703.01332","kind":"arxiv","version":3}},"canonical_sha256":"7322442cb31e768b434dcfd286b7fb488366a43dc7995325c36fc68baf42f878","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7322442cb31e768b434dcfd286b7fb488366a43dc7995325c36fc68baf42f878","first_computed_at":"2026-05-18T00:33:32.219725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:32.219725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GeLfLGT9GNVCZnxb8wWdtDJ1ozL4X1q426QnKb5hSF2sC5GBS2bhEE5V+G/nbtzv6Nrnu3eyTtTQy9CpCUhiCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:32.220238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01332","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:142837450f6cbb93f7b1ac36449aedea84bf931690b35c3c70401731bebbe9cd","sha256:fbb8cacc30d3076429d6087d718c6d53749327a4085c681a00f0460819f8da0d"],"state_sha256":"b85da49009e5fd3ade6ad8e26e39b99789825585afec8903f3c777fe1418916f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2eMrIWXNfxNT2WNQE9qOYycsxda9GeLwyft+5TuPlDzuPHrTZuLODEF5KExaRYKeW2hvuWfA9SCBQ/MjqfFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T13:51:50.639194Z","bundle_sha256":"810741fad3b3cdc132e7d7a393453959b3daba8a394ca7665dea98a69b515cf9"}}