{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Y6EMGOWKBJXEBU4IWVDLBFVG6E","short_pith_number":"pith:Y6EMGOWK","canonical_record":{"source":{"id":"1206.5580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-25T05:57:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8826b0e1b7c7945544a02d39bfb0a5e28faf74143207f1cbe4f9779df173beae","abstract_canon_sha256":"6bbd3219d759092f9e828bbf4593474e28bbc49cae289e89922533ab7bbaaeaa"},"schema_version":"1.0"},"canonical_sha256":"c788c33aca0a6e40d388b546b096a6f10c81d617001549429a90f76fd6a4e558","source":{"kind":"arxiv","id":"1206.5580","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5580","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5580v2","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5580","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"Y6EMGOWKBJXE","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y6EMGOWKBJXEBU4I","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y6EMGOWK","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Y6EMGOWKBJXEBU4IWVDLBFVG6E","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-25T05:57:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8826b0e1b7c7945544a02d39bfb0a5e28faf74143207f1cbe4f9779df173beae","abstract_canon_sha256":"6bbd3219d759092f9e828bbf4593474e28bbc49cae289e89922533ab7bbaaeaa"},"schema_version":"1.0"},"canonical_sha256":"c788c33aca0a6e40d388b546b096a6f10c81d617001549429a90f76fd6a4e558","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:19.404876Z","signature_b64":"yQTo47dTeXL6ygW3i38QQ9yPyZxRsmO/2GW6zl61gopHrTkyFq38smvUZ2Rejs/TRYkWB2G0TamIryQKTwYoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c788c33aca0a6e40d388b546b096a6f10c81d617001549429a90f76fd6a4e558","last_reissued_at":"2026-05-18T02:56:19.404291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:19.404291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5580","source_version":2,"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-18T02:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aAVCbQTWDy8qKZ4XF5HimigyavKs3FbYCdQab0XE1Lal45DPbFiHWdym/VDpBPXFj5yc0Lt6EpMX0VDK+shyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:18:29.215280Z"},"content_sha256":"3eff08ed4479bf624950940fc5f1f704c62043ea0642036168ca12190e6346c3","schema_version":"1.0","event_id":"sha256:3eff08ed4479bf624950940fc5f1f704c62043ea0642036168ca12190e6346c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Y6EMGOWKBJXEBU4IWVDLBFVG6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Geometric Algorithm for Scalable Multiple Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avishek Saha, John Moeller, Parasaran Raman, Suresh Venkatasubramanian","submitted_at":"2012-06-25T05:57:29Z","abstract_excerpt":"We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex polytopes. This interpretation combined with novel structural insights from our geometric formulation allows us to reduce the MKL problem to a simple optimization routine that yields provable convergence as well as quality guarantees. As a result our method scales efficiently to much larger data sets than most prior methods can handle. Empirical evaluation on el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5580","kind":"arxiv","version":2},"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-18T02:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gidpwVW6juSmkesC878fGKR6jpoSQvQuVXPOnPJ5G5k5hTNQnXLaEIO2F6XCUrvJCC8D/ZWIo1NtbY56LBVYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:18:29.215670Z"},"content_sha256":"a6608c16c5892532aff1dfaee8f68bd902955281d959235b43f49540c105431d","schema_version":"1.0","event_id":"sha256:a6608c16c5892532aff1dfaee8f68bd902955281d959235b43f49540c105431d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/bundle.json","state_url":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/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-05-31T07:18:29Z","links":{"resolver":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E","bundle":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/bundle.json","state":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Y6EMGOWKBJXEBU4IWVDLBFVG6E","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":"6bbd3219d759092f9e828bbf4593474e28bbc49cae289e89922533ab7bbaaeaa","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-25T05:57:29Z","title_canon_sha256":"8826b0e1b7c7945544a02d39bfb0a5e28faf74143207f1cbe4f9779df173beae"},"schema_version":"1.0","source":{"id":"1206.5580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5580","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5580v2","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5580","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"Y6EMGOWKBJXE","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y6EMGOWKBJXEBU4I","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y6EMGOWK","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:a6608c16c5892532aff1dfaee8f68bd902955281d959235b43f49540c105431d","target":"graph","created_at":"2026-05-18T02:56:19Z","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":"We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex polytopes. This interpretation combined with novel structural insights from our geometric formulation allows us to reduce the MKL problem to a simple optimization routine that yields provable convergence as well as quality guarantees. As a result our method scales efficiently to much larger data sets than most prior methods can handle. Empirical evaluation on el","authors_text":"Avishek Saha, John Moeller, Parasaran Raman, Suresh Venkatasubramanian","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-25T05:57:29Z","title":"A Geometric Algorithm for Scalable Multiple Kernel Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5580","kind":"arxiv","version":2},"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:3eff08ed4479bf624950940fc5f1f704c62043ea0642036168ca12190e6346c3","target":"record","created_at":"2026-05-18T02:56:19Z","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":"6bbd3219d759092f9e828bbf4593474e28bbc49cae289e89922533ab7bbaaeaa","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-25T05:57:29Z","title_canon_sha256":"8826b0e1b7c7945544a02d39bfb0a5e28faf74143207f1cbe4f9779df173beae"},"schema_version":"1.0","source":{"id":"1206.5580","kind":"arxiv","version":2}},"canonical_sha256":"c788c33aca0a6e40d388b546b096a6f10c81d617001549429a90f76fd6a4e558","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c788c33aca0a6e40d388b546b096a6f10c81d617001549429a90f76fd6a4e558","first_computed_at":"2026-05-18T02:56:19.404291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:19.404291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yQTo47dTeXL6ygW3i38QQ9yPyZxRsmO/2GW6zl61gopHrTkyFq38smvUZ2Rejs/TRYkWB2G0TamIryQKTwYoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:19.404876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eff08ed4479bf624950940fc5f1f704c62043ea0642036168ca12190e6346c3","sha256:a6608c16c5892532aff1dfaee8f68bd902955281d959235b43f49540c105431d"],"state_sha256":"772f9da208de273069bcc67c44e2abc8e947d93ecb1dedf6a8fa2fdb0a942e5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGxelnKJ7pzCq/fnSC7ypxf/zs3Eb5qyqQyIoZF8NL0q9E0kD+ZrXqu/+pZ5Hd9GO70nLlYTm+dOSwq+GV72DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:18:29.218886Z","bundle_sha256":"49aa5691a0de63c9f58a6b2499a3042b6b3ea4c52da1d0d9589bd2152d1fd788"}}