{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NYW3OEB634PQLX2SJ2WUFWK36S","short_pith_number":"pith:NYW3OEB6","schema_version":"1.0","canonical_sha256":"6e2db7103edf1f05df524ead42d95bf4afc93325620d076cadd822eab70accd2","source":{"kind":"arxiv","id":"2506.03974","version":1},"attestation_state":"computed","paper":{"title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"C\\'edric Herzet, Cl\\'ement Elvira, Th\\'eo Guyard","submitted_at":"2025-06-04T14:05:49Z","abstract_excerpt":"We present a generic Branch-and-Bound procedure designed to solve L0-penalized optimization problems. Existing approaches primarily focus on quadratic losses and construct relaxations using \"Big-M\" constraints and/or L2-norm penalties. In contrast, our method accommodates a broader class of loss functions and allows greater flexibility in relaxation design through a general penalty term, encompassing existing techniques as special cases. We establish theoretical results ensuring that all key quantities required for the Branch-and-Bound implementation admit closed-form expressions under the gen"},"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":"2506.03974","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-04T14:05:49Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"41b06ff05527eed87f5344345e5d2d7697666eed13ae821537f519e99ea9e712","abstract_canon_sha256":"53aae69410a5bb9401c8e2d25ef1aea1f20cf29f8f372dd9503b511d03c481ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:54.782150Z","signature_b64":"OmSEmwgZMxGAPrG9nDNmIn9TkzZHMnBzS92zAWg20Kpj0noktesIiMaWGmEtPYIu9U7G7S8fyVYaiJXq7xaTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e2db7103edf1f05df524ead42d95bf4afc93325620d076cadd822eab70accd2","last_reissued_at":"2026-07-05T11:15:54.781651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:54.781651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"C\\'edric Herzet, Cl\\'ement Elvira, Th\\'eo Guyard","submitted_at":"2025-06-04T14:05:49Z","abstract_excerpt":"We present a generic Branch-and-Bound procedure designed to solve L0-penalized optimization problems. Existing approaches primarily focus on quadratic losses and construct relaxations using \"Big-M\" constraints and/or L2-norm penalties. In contrast, our method accommodates a broader class of loss functions and allows greater flexibility in relaxation design through a general penalty term, encompassing existing techniques as special cases. We establish theoretical results ensuring that all key quantities required for the Branch-and-Bound implementation admit closed-form expressions under the gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03974","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/2506.03974/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":"2506.03974","created_at":"2026-07-05T11:15:54.781705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03974v1","created_at":"2026-07-05T11:15:54.781705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03974","created_at":"2026-07-05T11:15:54.781705+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYW3OEB634PQ","created_at":"2026-07-05T11:15:54.781705+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYW3OEB634PQLX2S","created_at":"2026-07-05T11:15:54.781705+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYW3OEB6","created_at":"2026-07-05T11:15:54.781705+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/NYW3OEB634PQLX2SJ2WUFWK36S","json":"https://pith.science/pith/NYW3OEB634PQLX2SJ2WUFWK36S.json","graph_json":"https://pith.science/api/pith-number/NYW3OEB634PQLX2SJ2WUFWK36S/graph.json","events_json":"https://pith.science/api/pith-number/NYW3OEB634PQLX2SJ2WUFWK36S/events.json","paper":"https://pith.science/paper/NYW3OEB6"},"agent_actions":{"view_html":"https://pith.science/pith/NYW3OEB634PQLX2SJ2WUFWK36S","download_json":"https://pith.science/pith/NYW3OEB634PQLX2SJ2WUFWK36S.json","view_paper":"https://pith.science/paper/NYW3OEB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03974&json=true","fetch_graph":"https://pith.science/api/pith-number/NYW3OEB634PQLX2SJ2WUFWK36S/graph.json","fetch_events":"https://pith.science/api/pith-number/NYW3OEB634PQLX2SJ2WUFWK36S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYW3OEB634PQLX2SJ2WUFWK36S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYW3OEB634PQLX2SJ2WUFWK36S/action/storage_attestation","attest_author":"https://pith.science/pith/NYW3OEB634PQLX2SJ2WUFWK36S/action/author_attestation","sign_citation":"https://pith.science/pith/NYW3OEB634PQLX2SJ2WUFWK36S/action/citation_signature","submit_replication":"https://pith.science/pith/NYW3OEB634PQLX2SJ2WUFWK36S/action/replication_record"}},"created_at":"2026-07-05T11:15:54.781705+00:00","updated_at":"2026-07-05T11:15:54.781705+00:00"}