{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RIWZPX5Z3ZVWXDKAIEFUXBAX3D","short_pith_number":"pith:RIWZPX5Z","canonical_record":{"source":{"id":"1810.03817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T05:20:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9df1e309cca4180f51953f21f7080bcf983b68cd3719ed7d314c9cbb47b5fa01","abstract_canon_sha256":"3620663e4739cc62d57ded4facc6d11310078a3f6ff513a53f12c694eed77460"},"schema_version":"1.0"},"canonical_sha256":"8a2d97dfb9de6b6b8d40410b4b8417d8e801392bbd3e1253a3f22f52da506cb3","source":{"kind":"arxiv","id":"1810.03817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03817","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03817v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03817","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"RIWZPX5Z3ZVW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIWZPX5Z3ZVWXDKA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIWZPX5Z","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RIWZPX5Z3ZVWXDKAIEFUXBAX3D","target":"record","payload":{"canonical_record":{"source":{"id":"1810.03817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T05:20:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9df1e309cca4180f51953f21f7080bcf983b68cd3719ed7d314c9cbb47b5fa01","abstract_canon_sha256":"3620663e4739cc62d57ded4facc6d11310078a3f6ff513a53f12c694eed77460"},"schema_version":"1.0"},"canonical_sha256":"8a2d97dfb9de6b6b8d40410b4b8417d8e801392bbd3e1253a3f22f52da506cb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.455516Z","signature_b64":"wJOOXTgMeyG7JRihesemm/HEpx0Ca8NwECgfZonTRukId0I84S2Soi88pF9s6Ce4922B348pYeClvDMO0DxwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a2d97dfb9de6b6b8d40410b4b8417d8e801392bbd3e1253a3f22f52da506cb3","last_reissued_at":"2026-05-18T00:03:44.455002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.455002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.03817","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-18T00:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TP3FG4wEI3VWrkQqSKiGQ+Rn37yRFPKwU5MINVA2jy6eciNPLuwy3dR1sZq3kdSP0MwQW6Lc/25e8RX0Rq0MDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:30:15.816005Z"},"content_sha256":"8ade339fc4c51c070ba8b9255be9eb3976790b68a0f7d92c5459a4065c47be94","schema_version":"1.0","event_id":"sha256:8ade339fc4c51c070ba8b9255be9eb3976790b68a0f7d92c5459a4065c47be94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RIWZPX5Z3ZVWXDKAIEFUXBAX3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shahin Shahrampour, Vahid Tarokh","submitted_at":"2018-10-09T05:20:41Z","abstract_excerpt":"Nonlinear kernels can be approximated using finite-dimensional feature maps for efficient risk minimization. Due to the inherent trade-off between the dimension of the (mapped) feature space and the approximation accuracy, the key problem is to identify promising (explicit) features leading to a satisfactory out-of-sample performance. In this work, we tackle this problem by efficiently choosing such features from multiple kernels in a greedy fashion. Our method sequentially selects these explicit features from a set of candidate features using a correlation metric. We establish an out-of-sampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03817","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-18T00:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/27Lom/fbp9SO/l7Jkpty4IxfqTxN+yGd1eXGgrVDCaPo8ZCTh6aujy8Xw9s0IXNRgXeoCEn9nXus4U1ClrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:30:15.816708Z"},"content_sha256":"97313907264d845c5ab4c3b6aac0e3c6e87b563fe7f6093e1ae98a884dc59964","schema_version":"1.0","event_id":"sha256:97313907264d845c5ab4c3b6aac0e3c6e87b563fe7f6093e1ae98a884dc59964"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/bundle.json","state_url":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/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-25T08:30:15Z","links":{"resolver":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D","bundle":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/bundle.json","state":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RIWZPX5Z3ZVWXDKAIEFUXBAX3D","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":"3620663e4739cc62d57ded4facc6d11310078a3f6ff513a53f12c694eed77460","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T05:20:41Z","title_canon_sha256":"9df1e309cca4180f51953f21f7080bcf983b68cd3719ed7d314c9cbb47b5fa01"},"schema_version":"1.0","source":{"id":"1810.03817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03817","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03817v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03817","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"RIWZPX5Z3ZVW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIWZPX5Z3ZVWXDKA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIWZPX5Z","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:97313907264d845c5ab4c3b6aac0e3c6e87b563fe7f6093e1ae98a884dc59964","target":"graph","created_at":"2026-05-18T00:03:44Z","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":"Nonlinear kernels can be approximated using finite-dimensional feature maps for efficient risk minimization. Due to the inherent trade-off between the dimension of the (mapped) feature space and the approximation accuracy, the key problem is to identify promising (explicit) features leading to a satisfactory out-of-sample performance. In this work, we tackle this problem by efficiently choosing such features from multiple kernels in a greedy fashion. Our method sequentially selects these explicit features from a set of candidate features using a correlation metric. We establish an out-of-sampl","authors_text":"Shahin Shahrampour, Vahid Tarokh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T05:20:41Z","title":"Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03817","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:8ade339fc4c51c070ba8b9255be9eb3976790b68a0f7d92c5459a4065c47be94","target":"record","created_at":"2026-05-18T00:03:44Z","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":"3620663e4739cc62d57ded4facc6d11310078a3f6ff513a53f12c694eed77460","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T05:20:41Z","title_canon_sha256":"9df1e309cca4180f51953f21f7080bcf983b68cd3719ed7d314c9cbb47b5fa01"},"schema_version":"1.0","source":{"id":"1810.03817","kind":"arxiv","version":1}},"canonical_sha256":"8a2d97dfb9de6b6b8d40410b4b8417d8e801392bbd3e1253a3f22f52da506cb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a2d97dfb9de6b6b8d40410b4b8417d8e801392bbd3e1253a3f22f52da506cb3","first_computed_at":"2026-05-18T00:03:44.455002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:44.455002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wJOOXTgMeyG7JRihesemm/HEpx0Ca8NwECgfZonTRukId0I84S2Soi88pF9s6Ce4922B348pYeClvDMO0DxwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:44.455516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ade339fc4c51c070ba8b9255be9eb3976790b68a0f7d92c5459a4065c47be94","sha256:97313907264d845c5ab4c3b6aac0e3c6e87b563fe7f6093e1ae98a884dc59964"],"state_sha256":"156a1f927d33bd8beb2ab7cda05d658fdfefebc12df61dd3cab80265dcc4b2ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKOlmb+0lz3JPa8APj5YdY3KcabtoUQHnkfTKxd06Q+aylzvLb+MNKAX7NDWhFwDXj1koHNiKsyIq5L8t37nBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:30:15.820101Z","bundle_sha256":"f901106321f1295ad3b3de7364a7d898789c515274efaa8e38855d608b9c7021"}}