{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:NHEE2ZTWGJNQMJZAPTWRZGSYR5","short_pith_number":"pith:NHEE2ZTW","schema_version":"1.0","canonical_sha256":"69c84d6676325b0627207ced1c9a588f638ae49240eec954765f4cbf6c8f4265","source":{"kind":"arxiv","id":"math/0406456","version":2},"attestation_state":"computed","paper":{"title":"Least Angle Regression","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Bradley Efron, Iain Johnstone, Robert Tibshirani, Trevor Hastie","submitted_at":"2004-06-23T08:06:25Z","abstract_excerpt":"The purpose of model selection algorithms such as All Subsets, Forward\n  Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to select a parsimonious set for the efficient prediction of a response variable. Least Angle Regression (LARS), a new model selection algorithm, is a useful and less greedy version of traditional forward selection methods.\n  Three main properties are derived: (1) A simple modification of the LARS alg"},"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":"math/0406456","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.ST","submitted_at":"2004-06-23T08:06:25Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"535f22105adba82c0d140db74036b662fb59f533f038d8704036ec6402ecb5eb","abstract_canon_sha256":"ec7f5f3fccd9b31ae56d2153834a11430f48def265df311d06dae91dd0e37061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:01:54.002207Z","signature_b64":"JEJSnYBIiS7JNGtPnPpQQqLZK0RxCSHJ66qecXJrpvqjn/0FICOVwJ6vjmyoRRgSlPUeV03Vbkh/N2XCYf5iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c84d6676325b0627207ced1c9a588f638ae49240eec954765f4cbf6c8f4265","last_reissued_at":"2026-07-04T15:01:54.001807Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:01:54.001807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Least Angle Regression","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Bradley Efron, Iain Johnstone, Robert Tibshirani, Trevor Hastie","submitted_at":"2004-06-23T08:06:25Z","abstract_excerpt":"The purpose of model selection algorithms such as All Subsets, Forward\n  Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to select a parsimonious set for the efficient prediction of a response variable. Least Angle Regression (LARS), a new model selection algorithm, is a useful and less greedy version of traditional forward selection methods.\n  Three main properties are derived: (1) A simple modification of the LARS alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0406456","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0406456/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0406456","created_at":"2026-07-04T15:01:54.001884+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0406456v2","created_at":"2026-07-04T15:01:54.001884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0406456","created_at":"2026-07-04T15:01:54.001884+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHEE2ZTWGJNQ","created_at":"2026-07-04T15:01:54.001884+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHEE2ZTWGJNQMJZA","created_at":"2026-07-04T15:01:54.001884+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHEE2ZTW","created_at":"2026-07-04T15:01:54.001884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.20706","citing_title":"Efficient and SPAM-Robust Ansatz-Free Lindbladian Learning","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5","json":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5.json","graph_json":"https://pith.science/api/pith-number/NHEE2ZTWGJNQMJZAPTWRZGSYR5/graph.json","events_json":"https://pith.science/api/pith-number/NHEE2ZTWGJNQMJZAPTWRZGSYR5/events.json","paper":"https://pith.science/paper/NHEE2ZTW"},"agent_actions":{"view_html":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5","download_json":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5.json","view_paper":"https://pith.science/paper/NHEE2ZTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0406456&json=true","fetch_graph":"https://pith.science/api/pith-number/NHEE2ZTWGJNQMJZAPTWRZGSYR5/graph.json","fetch_events":"https://pith.science/api/pith-number/NHEE2ZTWGJNQMJZAPTWRZGSYR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5/action/storage_attestation","attest_author":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5/action/author_attestation","sign_citation":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5/action/citation_signature","submit_replication":"https://pith.science/pith/NHEE2ZTWGJNQMJZAPTWRZGSYR5/action/replication_record"}},"created_at":"2026-07-04T15:01:54.001884+00:00","updated_at":"2026-07-04T15:01:54.001884+00:00"}