{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N5OW7TRBWHT7FFK6NORXLBQJIQ","short_pith_number":"pith:N5OW7TRB","schema_version":"1.0","canonical_sha256":"6f5d6fce21b1e7f2955e6ba375860944249315ef2a681d2e40f0544c5f72ff72","source":{"kind":"arxiv","id":"1505.04008","version":1},"attestation_state":"computed","paper":{"title":"Delete or merge regressors for linear model selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Agnieszka Prochenka, Aleksandra Maj-Ka\\'nska, Piotr Pokarowski","submitted_at":"2015-05-15T10:11:39Z","abstract_excerpt":"We consider a problem of linear model selection in the presence of both continuous and categorical predictors. Feasible models consist of subsets of numerical variables and partitions of levels of factors. A new algorithm called delete or merge regressors (DMR) is presented which is a stepwise backward procedure involving ranking the predictors according to squared t-statistics and choosing the final model minimizing BIC. In the article we prove consistency of DMR when the number of predictors tends to infinity with the sample size and describe a simulation study using a pertaining R package. "},"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":"1505.04008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-05-15T10:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"824b6b3abf348f5b155be3e60b1b022257f37724efe49ece74076e4bfe8f060c","abstract_canon_sha256":"21af43db8afd32043d89e1e3de1c066055f4d202b0bb475663e631400dcaefd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:03.726632Z","signature_b64":"ZQ0UWbSRIuCLGMW+/56J6/YNRjnOPb8A085LYt2r3VpJ/bCskSqBTCApBRRzpNRtS6oFc3v9pk4GDsnffbdtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f5d6fce21b1e7f2955e6ba375860944249315ef2a681d2e40f0544c5f72ff72","last_reissued_at":"2026-05-18T01:24:03.726022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:03.726022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delete or merge regressors for linear model selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Agnieszka Prochenka, Aleksandra Maj-Ka\\'nska, Piotr Pokarowski","submitted_at":"2015-05-15T10:11:39Z","abstract_excerpt":"We consider a problem of linear model selection in the presence of both continuous and categorical predictors. Feasible models consist of subsets of numerical variables and partitions of levels of factors. A new algorithm called delete or merge regressors (DMR) is presented which is a stepwise backward procedure involving ranking the predictors according to squared t-statistics and choosing the final model minimizing BIC. In the article we prove consistency of DMR when the number of predictors tends to infinity with the sample size and describe a simulation study using a pertaining R package. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04008","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.04008","created_at":"2026-05-18T01:24:03.726105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04008v1","created_at":"2026-05-18T01:24:03.726105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04008","created_at":"2026-05-18T01:24:03.726105+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5OW7TRBWHT7","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5OW7TRBWHT7FFK6","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5OW7TRB","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/N5OW7TRBWHT7FFK6NORXLBQJIQ","json":"https://pith.science/pith/N5OW7TRBWHT7FFK6NORXLBQJIQ.json","graph_json":"https://pith.science/api/pith-number/N5OW7TRBWHT7FFK6NORXLBQJIQ/graph.json","events_json":"https://pith.science/api/pith-number/N5OW7TRBWHT7FFK6NORXLBQJIQ/events.json","paper":"https://pith.science/paper/N5OW7TRB"},"agent_actions":{"view_html":"https://pith.science/pith/N5OW7TRBWHT7FFK6NORXLBQJIQ","download_json":"https://pith.science/pith/N5OW7TRBWHT7FFK6NORXLBQJIQ.json","view_paper":"https://pith.science/paper/N5OW7TRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04008&json=true","fetch_graph":"https://pith.science/api/pith-number/N5OW7TRBWHT7FFK6NORXLBQJIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/N5OW7TRBWHT7FFK6NORXLBQJIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5OW7TRBWHT7FFK6NORXLBQJIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5OW7TRBWHT7FFK6NORXLBQJIQ/action/storage_attestation","attest_author":"https://pith.science/pith/N5OW7TRBWHT7FFK6NORXLBQJIQ/action/author_attestation","sign_citation":"https://pith.science/pith/N5OW7TRBWHT7FFK6NORXLBQJIQ/action/citation_signature","submit_replication":"https://pith.science/pith/N5OW7TRBWHT7FFK6NORXLBQJIQ/action/replication_record"}},"created_at":"2026-05-18T01:24:03.726105+00:00","updated_at":"2026-05-18T01:24:03.726105+00:00"}