{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MSYLRE2RR5HXP3YU5WNUIDVBUP","short_pith_number":"pith:MSYLRE2R","schema_version":"1.0","canonical_sha256":"64b0b893518f4f77ef14ed9b440ea1a3ec29bd6a5f0e2a1ce836a7706c2f73de","source":{"kind":"arxiv","id":"1504.00494","version":3},"attestation_state":"computed","paper":{"title":"Identifying a minimal class of models for high-dimensional data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Daniel Nevo, Ya'acov Ritov","submitted_at":"2015-04-02T09:44:17Z","abstract_excerpt":"Model selection consistency in the high-dimensional regression setting can be achieved only if strong assumptions are fulfilled. We therefore suggest to pursue a different goal, which we call a minimal class of models. The minimal class of models includes models that are similar in their prediction accuracy but not necessarily in their elements. We suggest a random search algorithm to reveal candidate models. The algorithm implements simulated annealing while using a score for each predictor that we suggest to derive using a combination of the Lasso and the Elastic Net. The utility of using a "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.00494","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-04-02T09:44:17Z","cross_cats_sorted":[],"title_canon_sha256":"70cdb5e9f7ebc6de2373b9b723853da27d785f739b4006c21520e56cf16764a2","abstract_canon_sha256":"daff836236704a9625ac4a735cbae919f24cb85aa47fab71dc8513d41dc0f096"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:02.832251Z","signature_b64":"XSDDBH3jnqZOeVs1Gea4jQ3KUTmt6hNBfcsT5Ao8dHz93suYzRcE3MSxPInk7snVndZy+PQw/fj5GZuBqqlPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b0b893518f4f77ef14ed9b440ea1a3ec29bd6a5f0e2a1ce836a7706c2f73de","last_reissued_at":"2026-05-18T01:26:02.831751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:02.831751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying a minimal class of models for high-dimensional data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Daniel Nevo, Ya'acov Ritov","submitted_at":"2015-04-02T09:44:17Z","abstract_excerpt":"Model selection consistency in the high-dimensional regression setting can be achieved only if strong assumptions are fulfilled. We therefore suggest to pursue a different goal, which we call a minimal class of models. The minimal class of models includes models that are similar in their prediction accuracy but not necessarily in their elements. We suggest a random search algorithm to reveal candidate models. The algorithm implements simulated annealing while using a score for each predictor that we suggest to derive using a combination of the Lasso and the Elastic Net. The utility of using a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00494","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.00494","created_at":"2026-05-18T01:26:02.831849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00494v3","created_at":"2026-05-18T01:26:02.831849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00494","created_at":"2026-05-18T01:26:02.831849+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSYLRE2RR5HX","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSYLRE2RR5HXP3YU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSYLRE2R","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP","json":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP.json","graph_json":"https://pith.science/api/pith-number/MSYLRE2RR5HXP3YU5WNUIDVBUP/graph.json","events_json":"https://pith.science/api/pith-number/MSYLRE2RR5HXP3YU5WNUIDVBUP/events.json","paper":"https://pith.science/paper/MSYLRE2R"},"agent_actions":{"view_html":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP","download_json":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP.json","view_paper":"https://pith.science/paper/MSYLRE2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00494&json=true","fetch_graph":"https://pith.science/api/pith-number/MSYLRE2RR5HXP3YU5WNUIDVBUP/graph.json","fetch_events":"https://pith.science/api/pith-number/MSYLRE2RR5HXP3YU5WNUIDVBUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP/action/storage_attestation","attest_author":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP/action/author_attestation","sign_citation":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP/action/citation_signature","submit_replication":"https://pith.science/pith/MSYLRE2RR5HXP3YU5WNUIDVBUP/action/replication_record"}},"created_at":"2026-05-18T01:26:02.831849+00:00","updated_at":"2026-05-18T01:26:02.831849+00:00"}