{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FFVOJYBYJYFZSG3MEW7WRMH5UD","short_pith_number":"pith:FFVOJYBY","schema_version":"1.0","canonical_sha256":"296ae4e0384e0b991b6c25bf68b0fda0dd44a656bfafeddaad19a4c76dc1e024","source":{"kind":"arxiv","id":"1709.10030","version":1},"attestation_state":"computed","paper":{"title":"Sparse Hierarchical Regression with Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Bart Van Parys, Dimitris Bertsimas","submitted_at":"2017-09-28T16:01:08Z","abstract_excerpt":"We present a novel method for exact hierarchical sparse polynomial regression. Our regressor is that degree $r$ polynomial which depends on at most $k$ inputs, counting at most $\\ell$ monomial terms, which minimizes the sum of the squares of its prediction errors. The previous hierarchical sparse specification aligns well with modern big data settings where many inputs are not relevant for prediction purposes and the functional complexity of the regressor needs to be controlled as to avoid overfitting. We present a two-step approach to this hierarchical sparse regression problem. First, we dis"},"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":"1709.10030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-28T16:01:08Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7b218e5d8949b433d6a344ec191fa6d6f1842fa8977d5e8f0ef7f20e6ff43886","abstract_canon_sha256":"69def5e1314b76d85b28abb6a7485056c7ac595d78575350ff331cd76fb9e58d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:05.874421Z","signature_b64":"yjpsa0ASDffwWdZ9wNlnkz+jZitfgNfBe8P7p7EoxkZwIvdDW8HZGexmAssk9/hG1P305/rQEZ0/9vk2l7LKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"296ae4e0384e0b991b6c25bf68b0fda0dd44a656bfafeddaad19a4c76dc1e024","last_reissued_at":"2026-05-18T00:34:05.873730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:05.873730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Hierarchical Regression with Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Bart Van Parys, Dimitris Bertsimas","submitted_at":"2017-09-28T16:01:08Z","abstract_excerpt":"We present a novel method for exact hierarchical sparse polynomial regression. Our regressor is that degree $r$ polynomial which depends on at most $k$ inputs, counting at most $\\ell$ monomial terms, which minimizes the sum of the squares of its prediction errors. The previous hierarchical sparse specification aligns well with modern big data settings where many inputs are not relevant for prediction purposes and the functional complexity of the regressor needs to be controlled as to avoid overfitting. We present a two-step approach to this hierarchical sparse regression problem. First, we dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10030","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":"1709.10030","created_at":"2026-05-18T00:34:05.873830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.10030v1","created_at":"2026-05-18T00:34:05.873830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10030","created_at":"2026-05-18T00:34:05.873830+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFVOJYBYJYFZ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFVOJYBYJYFZSG3M","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFVOJYBY","created_at":"2026-05-18T12:31:15.632608+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/FFVOJYBYJYFZSG3MEW7WRMH5UD","json":"https://pith.science/pith/FFVOJYBYJYFZSG3MEW7WRMH5UD.json","graph_json":"https://pith.science/api/pith-number/FFVOJYBYJYFZSG3MEW7WRMH5UD/graph.json","events_json":"https://pith.science/api/pith-number/FFVOJYBYJYFZSG3MEW7WRMH5UD/events.json","paper":"https://pith.science/paper/FFVOJYBY"},"agent_actions":{"view_html":"https://pith.science/pith/FFVOJYBYJYFZSG3MEW7WRMH5UD","download_json":"https://pith.science/pith/FFVOJYBYJYFZSG3MEW7WRMH5UD.json","view_paper":"https://pith.science/paper/FFVOJYBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.10030&json=true","fetch_graph":"https://pith.science/api/pith-number/FFVOJYBYJYFZSG3MEW7WRMH5UD/graph.json","fetch_events":"https://pith.science/api/pith-number/FFVOJYBYJYFZSG3MEW7WRMH5UD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFVOJYBYJYFZSG3MEW7WRMH5UD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFVOJYBYJYFZSG3MEW7WRMH5UD/action/storage_attestation","attest_author":"https://pith.science/pith/FFVOJYBYJYFZSG3MEW7WRMH5UD/action/author_attestation","sign_citation":"https://pith.science/pith/FFVOJYBYJYFZSG3MEW7WRMH5UD/action/citation_signature","submit_replication":"https://pith.science/pith/FFVOJYBYJYFZSG3MEW7WRMH5UD/action/replication_record"}},"created_at":"2026-05-18T00:34:05.873830+00:00","updated_at":"2026-05-18T00:34:05.873830+00:00"}