{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G6GZ45XHEQRBVQ7VBJPFT64MCH","short_pith_number":"pith:G6GZ45XH","schema_version":"1.0","canonical_sha256":"378d9e76e724221ac3f50a5e59fb8c11ef0a2fe188be4935037c04bbbd6f7207","source":{"kind":"arxiv","id":"2502.09502","version":3},"attestation_state":"computed","paper":{"title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Jiachang Liu, Soroosh Shafiee","submitted_at":"2025-02-13T17:14:18Z","abstract_excerpt":"This paper investigates the problem of certifying optimality for sparse generalized linear models (GLMs), where sparsity is enforced through an $\\ell_0$ cardinality constraint. While branch-and-bound (BnB) frameworks can certify optimality by pruning nodes using dual bounds, existing methods for computing these bounds are either computationally intensive or exhibit slow convergence, limiting their scalability to large-scale problems. To address this challenge, we propose a first-order proximal gradient algorithm designed to solve the perspective relaxation of the problem within a BnB framework"},"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":"2502.09502","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T17:14:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5d05c1fa24db55561485184e7ff54e71b36b49532abf2dbf614a83657252c31e","abstract_canon_sha256":"f26956a664cc463204e24b30acd48803591d74bd76c5edec179177ee77ecce98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:51.378480Z","signature_b64":"vy8rdxF9l2+0BlLNlZrrDTzUi1TKg9l4sMnfsFqlf2uvUTcv75BXdfNfoG8S++KkmVmpUZuno2NQUWedWCH8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"378d9e76e724221ac3f50a5e59fb8c11ef0a2fe188be4935037c04bbbd6f7207","last_reissued_at":"2026-07-05T11:19:51.378041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:51.378041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Jiachang Liu, Soroosh Shafiee","submitted_at":"2025-02-13T17:14:18Z","abstract_excerpt":"This paper investigates the problem of certifying optimality for sparse generalized linear models (GLMs), where sparsity is enforced through an $\\ell_0$ cardinality constraint. While branch-and-bound (BnB) frameworks can certify optimality by pruning nodes using dual bounds, existing methods for computing these bounds are either computationally intensive or exhibit slow convergence, limiting their scalability to large-scale problems. To address this challenge, we propose a first-order proximal gradient algorithm designed to solve the perspective relaxation of the problem within a BnB framework"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09502","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.09502/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":"2502.09502","created_at":"2026-07-05T11:19:51.378096+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09502v3","created_at":"2026-07-05T11:19:51.378096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09502","created_at":"2026-07-05T11:19:51.378096+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6GZ45XHEQRB","created_at":"2026-07-05T11:19:51.378096+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6GZ45XHEQRBVQ7V","created_at":"2026-07-05T11:19:51.378096+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6GZ45XH","created_at":"2026-07-05T11:19:51.378096+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/G6GZ45XHEQRBVQ7VBJPFT64MCH","json":"https://pith.science/pith/G6GZ45XHEQRBVQ7VBJPFT64MCH.json","graph_json":"https://pith.science/api/pith-number/G6GZ45XHEQRBVQ7VBJPFT64MCH/graph.json","events_json":"https://pith.science/api/pith-number/G6GZ45XHEQRBVQ7VBJPFT64MCH/events.json","paper":"https://pith.science/paper/G6GZ45XH"},"agent_actions":{"view_html":"https://pith.science/pith/G6GZ45XHEQRBVQ7VBJPFT64MCH","download_json":"https://pith.science/pith/G6GZ45XHEQRBVQ7VBJPFT64MCH.json","view_paper":"https://pith.science/paper/G6GZ45XH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09502&json=true","fetch_graph":"https://pith.science/api/pith-number/G6GZ45XHEQRBVQ7VBJPFT64MCH/graph.json","fetch_events":"https://pith.science/api/pith-number/G6GZ45XHEQRBVQ7VBJPFT64MCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6GZ45XHEQRBVQ7VBJPFT64MCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6GZ45XHEQRBVQ7VBJPFT64MCH/action/storage_attestation","attest_author":"https://pith.science/pith/G6GZ45XHEQRBVQ7VBJPFT64MCH/action/author_attestation","sign_citation":"https://pith.science/pith/G6GZ45XHEQRBVQ7VBJPFT64MCH/action/citation_signature","submit_replication":"https://pith.science/pith/G6GZ45XHEQRBVQ7VBJPFT64MCH/action/replication_record"}},"created_at":"2026-07-05T11:19:51.378096+00:00","updated_at":"2026-07-05T11:19:51.378096+00:00"}