{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZGSXA55PA7IZNXVG7JA23TSB2V","short_pith_number":"pith:ZGSXA55P","canonical_record":{"source":{"id":"1803.00783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-02T09:50:11Z","cross_cats_sorted":[],"title_canon_sha256":"359792ee8735cf1521aa1a4b58b0a12af91c65c425aa61c7af7acc1bfd5a5c9c","abstract_canon_sha256":"280e7a0d646c2a6e05e0686e50b8a32cf18d76b428b8d054ee6175038c04e4c8"},"schema_version":"1.0"},"canonical_sha256":"c9a57077af07d196dea6fa41adce41d543b9b0a286cf26d9959af5aad638b084","source":{"kind":"arxiv","id":"1803.00783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00783","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00783v1","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00783","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZGSXA55PA7IZ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZGSXA55PA7IZNXVG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZGSXA55P","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZGSXA55PA7IZNXVG7JA23TSB2V","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-02T09:50:11Z","cross_cats_sorted":[],"title_canon_sha256":"359792ee8735cf1521aa1a4b58b0a12af91c65c425aa61c7af7acc1bfd5a5c9c","abstract_canon_sha256":"280e7a0d646c2a6e05e0686e50b8a32cf18d76b428b8d054ee6175038c04e4c8"},"schema_version":"1.0"},"canonical_sha256":"c9a57077af07d196dea6fa41adce41d543b9b0a286cf26d9959af5aad638b084","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:15.322716Z","signature_b64":"4a6GX/No9m7gcBYxq7BR7F4til6nPyWr2QqrrdDI7AGOzZBzvWJucg2RYU9I8x6GJd/bNy7D2Mg3NRKWyAokAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9a57077af07d196dea6fa41adce41d543b9b0a286cf26d9959af5aad638b084","last_reissued_at":"2026-05-17T23:56:15.322159Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:15.322159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00783","source_version":1,"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-17T23:56:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZwWxEs9AamiHC2pTquIeyKaaENQ+CvyTc63fSmIGa2X4RZa28NMSCKIq5CE9rcqfMWqxxBed/DCWe+c4JoMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:56:11.125438Z"},"content_sha256":"e40067d03eb5c40e4dc5f4170137df7fbbaf0d7df3d1287b8751122ed143d04a","schema_version":"1.0","event_id":"sha256:e40067d03eb5c40e4dc5f4170137df7fbbaf0d7df3d1287b8751122ed143d04a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZGSXA55PA7IZNXVG7JA23TSB2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Multiple Kernel Learning: Support Identification via Mirror Stratifiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa","submitted_at":"2018-03-02T09:50:11Z","abstract_excerpt":"In statistical machine learning, kernel methods allow to consider infinite dimensional feature spaces with a computational cost that only depends on the number of observations. This is usually done by solving an optimization problem depending on a data fit term and a suitable regularizer. In this paper we consider feature maps which are the concatenation of a fixed, possibly large, set of simpler feature maps. The penalty is a sparsity inducing one, promoting solutions depending only on a small subset of the features. The group lasso problem is a special case of this more general setting. We s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00783","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":""},"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-17T23:56:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLraPY7uRzOC61LI5QvhHd3GiRkAj3Ft4TwEqPBiXC3kul3FPISyOe/pOmdkdKOY+CMV44Xdan77mVIIFjalDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:56:11.126228Z"},"content_sha256":"851595db0c4b3946c501046a30d4b0cb85b465af8a5dffee7c1fd12e91467dea","schema_version":"1.0","event_id":"sha256:851595db0c4b3946c501046a30d4b0cb85b465af8a5dffee7c1fd12e91467dea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGSXA55PA7IZNXVG7JA23TSB2V/bundle.json","state_url":"https://pith.science/pith/ZGSXA55PA7IZNXVG7JA23TSB2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGSXA55PA7IZNXVG7JA23TSB2V/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-08T18:56:11Z","links":{"resolver":"https://pith.science/pith/ZGSXA55PA7IZNXVG7JA23TSB2V","bundle":"https://pith.science/pith/ZGSXA55PA7IZNXVG7JA23TSB2V/bundle.json","state":"https://pith.science/pith/ZGSXA55PA7IZNXVG7JA23TSB2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGSXA55PA7IZNXVG7JA23TSB2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZGSXA55PA7IZNXVG7JA23TSB2V","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":"280e7a0d646c2a6e05e0686e50b8a32cf18d76b428b8d054ee6175038c04e4c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-02T09:50:11Z","title_canon_sha256":"359792ee8735cf1521aa1a4b58b0a12af91c65c425aa61c7af7acc1bfd5a5c9c"},"schema_version":"1.0","source":{"id":"1803.00783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00783","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00783v1","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00783","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZGSXA55PA7IZ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZGSXA55PA7IZNXVG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZGSXA55P","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:851595db0c4b3946c501046a30d4b0cb85b465af8a5dffee7c1fd12e91467dea","target":"graph","created_at":"2026-05-17T23:56:15Z","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":"In statistical machine learning, kernel methods allow to consider infinite dimensional feature spaces with a computational cost that only depends on the number of observations. This is usually done by solving an optimization problem depending on a data fit term and a suitable regularizer. In this paper we consider feature maps which are the concatenation of a fixed, possibly large, set of simpler feature maps. The penalty is a sparsity inducing one, promoting solutions depending only on a small subset of the features. The group lasso problem is a special case of this more general setting. We s","authors_text":"Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-02T09:50:11Z","title":"Sparse Multiple Kernel Learning: Support Identification via Mirror Stratifiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00783","kind":"arxiv","version":1},"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:e40067d03eb5c40e4dc5f4170137df7fbbaf0d7df3d1287b8751122ed143d04a","target":"record","created_at":"2026-05-17T23:56:15Z","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":"280e7a0d646c2a6e05e0686e50b8a32cf18d76b428b8d054ee6175038c04e4c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-02T09:50:11Z","title_canon_sha256":"359792ee8735cf1521aa1a4b58b0a12af91c65c425aa61c7af7acc1bfd5a5c9c"},"schema_version":"1.0","source":{"id":"1803.00783","kind":"arxiv","version":1}},"canonical_sha256":"c9a57077af07d196dea6fa41adce41d543b9b0a286cf26d9959af5aad638b084","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9a57077af07d196dea6fa41adce41d543b9b0a286cf26d9959af5aad638b084","first_computed_at":"2026-05-17T23:56:15.322159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:15.322159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4a6GX/No9m7gcBYxq7BR7F4til6nPyWr2QqrrdDI7AGOzZBzvWJucg2RYU9I8x6GJd/bNy7D2Mg3NRKWyAokAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:15.322716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e40067d03eb5c40e4dc5f4170137df7fbbaf0d7df3d1287b8751122ed143d04a","sha256:851595db0c4b3946c501046a30d4b0cb85b465af8a5dffee7c1fd12e91467dea"],"state_sha256":"eec013f2dbf6f8199e4bbcbcfc18fb891592e6d147569049eeb16dad5e053895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h798/HPviCV2W4IH2j+jEflgn7mPCAuUc/StToeYyKRGlXZYY9KwePzZiCj5M8sDCDoW/mYLEO6CK1ekEEBIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:56:11.130219Z","bundle_sha256":"5ff3bdc83fedaa352eafe995a8615c376443ded9b5fd486f09c7c9e93c43209b"}}