{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KF665J2ZLGWP2HBRKFN32SZZXH","short_pith_number":"pith:KF665J2Z","canonical_record":{"source":{"id":"1506.02196","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-06T21:47:02Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"8f7e3df700c12974d04e711b37fcb7eca2a9fd0254c97a21db007bd79f7ec3a1","abstract_canon_sha256":"37583b6f2d796533bf17167d24a70529b4e5c3df02e0aeb924286a7ffe1d3f89"},"schema_version":"1.0"},"canonical_sha256":"517deea75959acfd1c31515bbd4b39b9d64105377f9a177c792cc92b61a6d37d","source":{"kind":"arxiv","id":"1506.02196","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02196","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02196v4","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02196","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"KF665J2ZLGWP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KF665J2ZLGWP2HBR","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KF665J2Z","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KF665J2ZLGWP2HBRKFN32SZZXH","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02196","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-06T21:47:02Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"8f7e3df700c12974d04e711b37fcb7eca2a9fd0254c97a21db007bd79f7ec3a1","abstract_canon_sha256":"37583b6f2d796533bf17167d24a70529b4e5c3df02e0aeb924286a7ffe1d3f89"},"schema_version":"1.0"},"canonical_sha256":"517deea75959acfd1c31515bbd4b39b9d64105377f9a177c792cc92b61a6d37d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:01.503624Z","signature_b64":"CoJXkgiSEFua/3W+DrNil7/+YWpFdtFlQVROm+bWEqKG+x4WHlPgs+LTq9/eSzC7VbNC1z+X7wMb0X3rTqNmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"517deea75959acfd1c31515bbd4b39b9d64105377f9a177c792cc92b61a6d37d","last_reissued_at":"2026-05-18T00:48:01.503110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:01.503110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02196","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLp87g7hD9MnRaxUcZRrwKljRBDRYRwqh3/Hwx6Wj7RXx1dwKESt2+KGuE9k2/rdocdO9d7wkNLa7mnpXBKzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:47:25.300518Z"},"content_sha256":"77c22cf72f3de751950bee11bac99eb24a97995f35b8d62c7a03760cfbd7c750","schema_version":"1.0","event_id":"sha256:77c22cf72f3de751950bee11bac99eb24a97995f35b8d62c7a03760cfbd7c750"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KF665J2ZLGWP2HBRKFN32SZZXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification and regression using an outer approximation projection-gradient method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Lionel Fillatre, Michel Barlaud, Patrick L. Combettes, Wafa Belhajali","submitted_at":"2015-06-06T21:47:02Z","abstract_excerpt":"This paper deals with sparse feature selection and grouping for classification and regression. The classification or regression problems under consideration consists in minimizing a convex empirical risk function subject to an $\\ell^1$ constraint, a pairwise $\\ell^\\infty$ constraint, or a pairwise $\\ell^1$ constraint. Existing work, such as the Lasso formulation, has focused mainly on Lagrangian penalty approximations, which often require ad hoc or computationally expensive procedures to determine the penalization parameter. We depart from this approach and address the constrained problem dire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02196","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYZGFLPybpsVVr37MXOjzdk0Clrn+UZr8Tu14wxeH6cpKi4nPOpBKtfX3qwKoQ5Pg92TwSwGVaw4yCWUliEIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:47:25.301243Z"},"content_sha256":"94c7d6d16b3e57c44c8d15248b55831548923c23247a8890d8e2f57af314cf34","schema_version":"1.0","event_id":"sha256:94c7d6d16b3e57c44c8d15248b55831548923c23247a8890d8e2f57af314cf34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KF665J2ZLGWP2HBRKFN32SZZXH/bundle.json","state_url":"https://pith.science/pith/KF665J2ZLGWP2HBRKFN32SZZXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KF665J2ZLGWP2HBRKFN32SZZXH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T18:47:25Z","links":{"resolver":"https://pith.science/pith/KF665J2ZLGWP2HBRKFN32SZZXH","bundle":"https://pith.science/pith/KF665J2ZLGWP2HBRKFN32SZZXH/bundle.json","state":"https://pith.science/pith/KF665J2ZLGWP2HBRKFN32SZZXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KF665J2ZLGWP2HBRKFN32SZZXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KF665J2ZLGWP2HBRKFN32SZZXH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"37583b6f2d796533bf17167d24a70529b4e5c3df02e0aeb924286a7ffe1d3f89","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-06T21:47:02Z","title_canon_sha256":"8f7e3df700c12974d04e711b37fcb7eca2a9fd0254c97a21db007bd79f7ec3a1"},"schema_version":"1.0","source":{"id":"1506.02196","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02196","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02196v4","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02196","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"KF665J2ZLGWP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KF665J2ZLGWP2HBR","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KF665J2Z","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:94c7d6d16b3e57c44c8d15248b55831548923c23247a8890d8e2f57af314cf34","target":"graph","created_at":"2026-05-18T00:48:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper deals with sparse feature selection and grouping for classification and regression. The classification or regression problems under consideration consists in minimizing a convex empirical risk function subject to an $\\ell^1$ constraint, a pairwise $\\ell^\\infty$ constraint, or a pairwise $\\ell^1$ constraint. Existing work, such as the Lasso formulation, has focused mainly on Lagrangian penalty approximations, which often require ad hoc or computationally expensive procedures to determine the penalization parameter. We depart from this approach and address the constrained problem dire","authors_text":"Lionel Fillatre, Michel Barlaud, Patrick L. Combettes, Wafa Belhajali","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-06T21:47:02Z","title":"Classification and regression using an outer approximation projection-gradient method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02196","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:77c22cf72f3de751950bee11bac99eb24a97995f35b8d62c7a03760cfbd7c750","target":"record","created_at":"2026-05-18T00:48:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"37583b6f2d796533bf17167d24a70529b4e5c3df02e0aeb924286a7ffe1d3f89","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-06T21:47:02Z","title_canon_sha256":"8f7e3df700c12974d04e711b37fcb7eca2a9fd0254c97a21db007bd79f7ec3a1"},"schema_version":"1.0","source":{"id":"1506.02196","kind":"arxiv","version":4}},"canonical_sha256":"517deea75959acfd1c31515bbd4b39b9d64105377f9a177c792cc92b61a6d37d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"517deea75959acfd1c31515bbd4b39b9d64105377f9a177c792cc92b61a6d37d","first_computed_at":"2026-05-18T00:48:01.503110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:01.503110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CoJXkgiSEFua/3W+DrNil7/+YWpFdtFlQVROm+bWEqKG+x4WHlPgs+LTq9/eSzC7VbNC1z+X7wMb0X3rTqNmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:01.503624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02196","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77c22cf72f3de751950bee11bac99eb24a97995f35b8d62c7a03760cfbd7c750","sha256:94c7d6d16b3e57c44c8d15248b55831548923c23247a8890d8e2f57af314cf34"],"state_sha256":"3664ca1c1324105865d3d274fb0da98abc80f92ba928c483662035ad8b43a9f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNoo5sDvpf4cm7yZgdU7ukQBUoooInwxIQ+VJ1cF6eS+6raGjfYO0gicF6DYe3R5y0FFNYmNhncrDfdVxnNaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:47:25.304648Z","bundle_sha256":"6cd515e79bed4b4fad5ff67ebf0f45d858ed3787c9fbea4634f6a40aae834c7a"}}