{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QVFKMRFSV2X4QVFBY6KBFRR6SG","short_pith_number":"pith:QVFKMRFS","schema_version":"1.0","canonical_sha256":"854aa644b2aeafc854a1c79412c63e91933085604acbb4e69b1c6731f90e45b9","source":{"kind":"arxiv","id":"2308.12444","version":1},"attestation_state":"computed","paper":{"title":"Leverage classifier: Another look at support vector machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Changliang Zou, Cheng Meng, Jun Yu, Nan Zhang, Ping Ma, Wenxuan Zhong, Yixin Han","submitted_at":"2023-08-23T21:52:31Z","abstract_excerpt":"Support vector machine (SVM) is a popular classifier known for accuracy, flexibility, and robustness. However, its intensive computation has hindered its application to large-scale datasets. In this paper, we propose a new optimal leverage classifier based on linear SVM under a nonseparable setting. Our classifier aims to select an informative subset of the training sample to reduce data size, enabling efficient computation while maintaining high accuracy. We take a novel view of SVM under the general subsampling framework and rigorously investigate the statistical properties. We propose a two"},"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":"2308.12444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-08-23T21:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"c40073fb5915a7af998c0f8f531ed7dea398db838a7a308fadd9f432d97c4591","abstract_canon_sha256":"4da1fd12a1968a920417c587d84ce58d11ba7f8e606394c8ced735451589c621"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:12.431639Z","signature_b64":"Y2P6oqSDPnSFa9KFbJvMHNNfEdYZRO2CZuVs4UIZ94+lcZGBrV/U1zxJlaHq7xw24OuKwWHLCe+9jVYtv2OoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"854aa644b2aeafc854a1c79412c63e91933085604acbb4e69b1c6731f90e45b9","last_reissued_at":"2026-07-05T06:44:12.431191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:12.431191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leverage classifier: Another look at support vector machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Changliang Zou, Cheng Meng, Jun Yu, Nan Zhang, Ping Ma, Wenxuan Zhong, Yixin Han","submitted_at":"2023-08-23T21:52:31Z","abstract_excerpt":"Support vector machine (SVM) is a popular classifier known for accuracy, flexibility, and robustness. However, its intensive computation has hindered its application to large-scale datasets. In this paper, we propose a new optimal leverage classifier based on linear SVM under a nonseparable setting. Our classifier aims to select an informative subset of the training sample to reduce data size, enabling efficient computation while maintaining high accuracy. We take a novel view of SVM under the general subsampling framework and rigorously investigate the statistical properties. We propose a two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12444","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/2308.12444/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":"2308.12444","created_at":"2026-07-05T06:44:12.431253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.12444v1","created_at":"2026-07-05T06:44:12.431253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12444","created_at":"2026-07-05T06:44:12.431253+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVFKMRFSV2X4","created_at":"2026-07-05T06:44:12.431253+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVFKMRFSV2X4QVFB","created_at":"2026-07-05T06:44:12.431253+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVFKMRFS","created_at":"2026-07-05T06:44:12.431253+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21260","citing_title":"Subsampling for supervised learning in reproducing kernel Hilbert spaces","ref_index":97,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG","json":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG.json","graph_json":"https://pith.science/api/pith-number/QVFKMRFSV2X4QVFBY6KBFRR6SG/graph.json","events_json":"https://pith.science/api/pith-number/QVFKMRFSV2X4QVFBY6KBFRR6SG/events.json","paper":"https://pith.science/paper/QVFKMRFS"},"agent_actions":{"view_html":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG","download_json":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG.json","view_paper":"https://pith.science/paper/QVFKMRFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.12444&json=true","fetch_graph":"https://pith.science/api/pith-number/QVFKMRFSV2X4QVFBY6KBFRR6SG/graph.json","fetch_events":"https://pith.science/api/pith-number/QVFKMRFSV2X4QVFBY6KBFRR6SG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG/action/storage_attestation","attest_author":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG/action/author_attestation","sign_citation":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG/action/citation_signature","submit_replication":"https://pith.science/pith/QVFKMRFSV2X4QVFBY6KBFRR6SG/action/replication_record"}},"created_at":"2026-07-05T06:44:12.431253+00:00","updated_at":"2026-07-05T06:44:12.431253+00:00"}