{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TKGSQGB4JOGQ5Q6CTYYSMZS6BT","short_pith_number":"pith:TKGSQGB4","schema_version":"1.0","canonical_sha256":"9a8d28183c4b8d0ec3c29e3126665e0cf2167b7d9b47007c357d37b1e7602c87","source":{"kind":"arxiv","id":"2605.22188","version":1},"attestation_state":"computed","paper":{"title":"From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Jiachang Liu","submitted_at":"2026-05-21T08:56:15Z","abstract_excerpt":"GPUs have significantly accelerated first-order methods for large-scale optimization, especially in continuous optimization. However, this success has not transferred cleanly to problems with discrete variables, combinatorial structure, and nonlinear objectives, such as certifying optimal solutions for cardinality-constrained generalized linear models. Major challenges include the sequential processing of heterogeneous nodes in branch and bound (BnB) and frequent data movement between the CPU and GPU. We propose a simple, generic, and modular CPU--GPU framework that processes multiple BnB node"},"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":"2605.22188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-21T08:56:15Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e5645b0e203622b78ba20623720bfc2e6d50a1537fe9ddf3012b54a2b88f5590","abstract_canon_sha256":"5a25cf8d7a67a6a0da869fe744188bf1662d47d34e4e2314a6fdaa58768a92d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:30.934304Z","signature_b64":"CxLRi+KCpQ+k2IBwCJisz2jUg9SETjp/ySvUMNmPDbYNlRA1AK7EUWile9Bf2K8GkQXAIHyQJ3sHEI9tnuRoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a8d28183c4b8d0ec3c29e3126665e0cf2167b7d9b47007c357d37b1e7602c87","last_reissued_at":"2026-05-22T01:04:30.933449Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:30.933449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Jiachang Liu","submitted_at":"2026-05-21T08:56:15Z","abstract_excerpt":"GPUs have significantly accelerated first-order methods for large-scale optimization, especially in continuous optimization. However, this success has not transferred cleanly to problems with discrete variables, combinatorial structure, and nonlinear objectives, such as certifying optimal solutions for cardinality-constrained generalized linear models. Major challenges include the sequential processing of heterogeneous nodes in branch and bound (BnB) and frequent data movement between the CPU and GPU. We propose a simple, generic, and modular CPU--GPU framework that processes multiple BnB node"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22188","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/2605.22188/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":"2605.22188","created_at":"2026-05-22T01:04:30.933612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22188v1","created_at":"2026-05-22T01:04:30.933612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22188","created_at":"2026-05-22T01:04:30.933612+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKGSQGB4JOGQ","created_at":"2026-05-22T01:04:30.933612+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKGSQGB4JOGQ5Q6C","created_at":"2026-05-22T01:04:30.933612+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKGSQGB4","created_at":"2026-05-22T01:04:30.933612+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/TKGSQGB4JOGQ5Q6CTYYSMZS6BT","json":"https://pith.science/pith/TKGSQGB4JOGQ5Q6CTYYSMZS6BT.json","graph_json":"https://pith.science/api/pith-number/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/graph.json","events_json":"https://pith.science/api/pith-number/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/events.json","paper":"https://pith.science/paper/TKGSQGB4"},"agent_actions":{"view_html":"https://pith.science/pith/TKGSQGB4JOGQ5Q6CTYYSMZS6BT","download_json":"https://pith.science/pith/TKGSQGB4JOGQ5Q6CTYYSMZS6BT.json","view_paper":"https://pith.science/paper/TKGSQGB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22188&json=true","fetch_graph":"https://pith.science/api/pith-number/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/graph.json","fetch_events":"https://pith.science/api/pith-number/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/action/storage_attestation","attest_author":"https://pith.science/pith/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/action/author_attestation","sign_citation":"https://pith.science/pith/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/action/citation_signature","submit_replication":"https://pith.science/pith/TKGSQGB4JOGQ5Q6CTYYSMZS6BT/action/replication_record"}},"created_at":"2026-05-22T01:04:30.933612+00:00","updated_at":"2026-05-22T01:04:30.933612+00:00"}