{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RWP6RJPRWBTHAPEARQETHZHUF5","short_pith_number":"pith:RWP6RJPR","schema_version":"1.0","canonical_sha256":"8d9fe8a5f1b066703c808c0933e4f42f41603440bda3561971af9263754aaf26","source":{"kind":"arxiv","id":"2505.01082","version":1},"attestation_state":"computed","paper":{"title":"Screening Cut Generation for Sparse Ridge Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanyi Wang, Haozhe Tan","submitted_at":"2025-05-02T07:40:09Z","abstract_excerpt":"Sparse ridge regression is widely utilized in modern data analysis and machine learning. However, computing globally optimal solutions for sparse ridge regression is challenging, particularly when samples are arbitrarily given or generated under weak modeling assumptions. This paper proposes a novel cut-generation method, Screening Cut Generation (SCG), to eliminate non-optimal solutions for arbitrarily given samples. In contrast to recent safe variable screening approaches, SCG offers superior screening capability by identifying whether a specific $\\{\\pm 1\\}$ combination of multiple features "},"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":"2505.01082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-02T07:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"9247ca9e6eef861155798395bf740e7ad54c97e8a5e9b8c92928c71f54881974","abstract_canon_sha256":"683acdfdd216c01b1f8dbfd0109645e2b58eb0cd23fce58a74fe844f3cbe7737"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:57:44.811395Z","signature_b64":"thNWc7EWuaDbgWjFdjNoLQI5cn2Rmg8Syk5MyO+g/pk4R/MQ+djKWTcvQ/tYcIu+Asz/xNIr2T1NohF3r1XMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d9fe8a5f1b066703c808c0933e4f42f41603440bda3561971af9263754aaf26","last_reissued_at":"2026-07-05T10:57:44.810810Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:57:44.810810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Screening Cut Generation for Sparse Ridge Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanyi Wang, Haozhe Tan","submitted_at":"2025-05-02T07:40:09Z","abstract_excerpt":"Sparse ridge regression is widely utilized in modern data analysis and machine learning. However, computing globally optimal solutions for sparse ridge regression is challenging, particularly when samples are arbitrarily given or generated under weak modeling assumptions. This paper proposes a novel cut-generation method, Screening Cut Generation (SCG), to eliminate non-optimal solutions for arbitrarily given samples. In contrast to recent safe variable screening approaches, SCG offers superior screening capability by identifying whether a specific $\\{\\pm 1\\}$ combination of multiple features "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01082","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.01082/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":"2505.01082","created_at":"2026-07-05T10:57:44.810873+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.01082v1","created_at":"2026-07-05T10:57:44.810873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01082","created_at":"2026-07-05T10:57:44.810873+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWP6RJPRWBTH","created_at":"2026-07-05T10:57:44.810873+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWP6RJPRWBTHAPEA","created_at":"2026-07-05T10:57:44.810873+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWP6RJPR","created_at":"2026-07-05T10:57:44.810873+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22894","citing_title":"Sparsity-Cone SDP Relaxations and Applications to Variable Fixing for Sparse Quadratic Programs","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5","json":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5.json","graph_json":"https://pith.science/api/pith-number/RWP6RJPRWBTHAPEARQETHZHUF5/graph.json","events_json":"https://pith.science/api/pith-number/RWP6RJPRWBTHAPEARQETHZHUF5/events.json","paper":"https://pith.science/paper/RWP6RJPR"},"agent_actions":{"view_html":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5","download_json":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5.json","view_paper":"https://pith.science/paper/RWP6RJPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.01082&json=true","fetch_graph":"https://pith.science/api/pith-number/RWP6RJPRWBTHAPEARQETHZHUF5/graph.json","fetch_events":"https://pith.science/api/pith-number/RWP6RJPRWBTHAPEARQETHZHUF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5/action/storage_attestation","attest_author":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5/action/author_attestation","sign_citation":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5/action/citation_signature","submit_replication":"https://pith.science/pith/RWP6RJPRWBTHAPEARQETHZHUF5/action/replication_record"}},"created_at":"2026-07-05T10:57:44.810873+00:00","updated_at":"2026-07-05T10:57:44.810873+00:00"}