{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MBVHCSBJOOMGIYDYUX3XTOLGJE","short_pith_number":"pith:MBVHCSBJ","schema_version":"1.0","canonical_sha256":"606a7148297398646078a5f779b9664919301da9ac621fe0999b5c4efe8c8f84","source":{"kind":"arxiv","id":"2007.08233","version":1},"attestation_state":"computed","paper":{"title":"Radial basis function kernel optimization for Support Vector Machine classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ezequiel L\\'opez-Rubio, Karl Thurnhofer-Hemsi, Kayvan Najarian, Miguel A. Molina-Cabello","submitted_at":"2020-07-16T10:09:15Z","abstract_excerpt":"Support Vector Machines (SVMs) are still one of the most popular and precise classifiers. The Radial Basis Function (RBF) kernel has been used in SVMs to separate among classes with considerable success. However, there is an intrinsic dependence on the initial value of the kernel hyperparameter. In this work, we propose OKSVM, an algorithm that automatically learns the RBF kernel hyperparameter and adjusts the SVM weights simultaneously. The proposed optimization technique is based on a gradient descent method. We analyze the performance of our approach with respect to the classical SVM for cl"},"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":"2007.08233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-16T10:09:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2697f0de9d04d191d674cadc43c9dbbc7a92a6962ef0e5116a66043bb24305eb","abstract_canon_sha256":"68580fcf8d271193f8a324fd7842e2e8a7d329f172b78b1f9326f9c89afddbf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:45.069767Z","signature_b64":"uEnoGR/Zf6NaLIB6RFdr/K+k9d5t42b+zsVK1GuXzHYAph5FiSu4ugCkKyS5dJzWHFRXbfrC5Adbrfe5tizzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"606a7148297398646078a5f779b9664919301da9ac621fe0999b5c4efe8c8f84","last_reissued_at":"2026-07-05T01:19:45.069296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:45.069296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Radial basis function kernel optimization for Support Vector Machine classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ezequiel L\\'opez-Rubio, Karl Thurnhofer-Hemsi, Kayvan Najarian, Miguel A. Molina-Cabello","submitted_at":"2020-07-16T10:09:15Z","abstract_excerpt":"Support Vector Machines (SVMs) are still one of the most popular and precise classifiers. The Radial Basis Function (RBF) kernel has been used in SVMs to separate among classes with considerable success. However, there is an intrinsic dependence on the initial value of the kernel hyperparameter. In this work, we propose OKSVM, an algorithm that automatically learns the RBF kernel hyperparameter and adjusts the SVM weights simultaneously. The proposed optimization technique is based on a gradient descent method. We analyze the performance of our approach with respect to the classical SVM for cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.08233","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/2007.08233/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":"2007.08233","created_at":"2026-07-05T01:19:45.069366+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.08233v1","created_at":"2026-07-05T01:19:45.069366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.08233","created_at":"2026-07-05T01:19:45.069366+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBVHCSBJOOMG","created_at":"2026-07-05T01:19:45.069366+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBVHCSBJOOMGIYDY","created_at":"2026-07-05T01:19:45.069366+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBVHCSBJ","created_at":"2026-07-05T01:19:45.069366+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2312.01562","citing_title":"Kernel Alignment for Quantum Support Vector Machines Using Genetic Algorithms","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19993","citing_title":"Diversity-Aware Batch-Mode Active Learning for Efficient Sampling in Data-Driven Constitutive Modeling","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE","json":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE.json","graph_json":"https://pith.science/api/pith-number/MBVHCSBJOOMGIYDYUX3XTOLGJE/graph.json","events_json":"https://pith.science/api/pith-number/MBVHCSBJOOMGIYDYUX3XTOLGJE/events.json","paper":"https://pith.science/paper/MBVHCSBJ"},"agent_actions":{"view_html":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE","download_json":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE.json","view_paper":"https://pith.science/paper/MBVHCSBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.08233&json=true","fetch_graph":"https://pith.science/api/pith-number/MBVHCSBJOOMGIYDYUX3XTOLGJE/graph.json","fetch_events":"https://pith.science/api/pith-number/MBVHCSBJOOMGIYDYUX3XTOLGJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE/action/storage_attestation","attest_author":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE/action/author_attestation","sign_citation":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE/action/citation_signature","submit_replication":"https://pith.science/pith/MBVHCSBJOOMGIYDYUX3XTOLGJE/action/replication_record"}},"created_at":"2026-07-05T01:19:45.069366+00:00","updated_at":"2026-07-05T01:19:45.069366+00:00"}