{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SX7EZA7H4ZGZEGHWQBA3WGVZF4","short_pith_number":"pith:SX7EZA7H","schema_version":"1.0","canonical_sha256":"95fe4c83e7e64d9218f68041bb1ab92f061c183515fc762344af7653083e7dfc","source":{"kind":"arxiv","id":"1008.4000","version":1},"attestation_state":"computed","paper":{"title":"NESVM: a Fast Gradient Method for Support Vector Machines","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Tianyi Zhou, Xindong Wu","submitted_at":"2010-08-24T10:02:01Z","abstract_excerpt":"Support vector machines (SVMs) are invaluable tools for many practical applications in artificial intelligence, e.g., classification and event recognition. However, popular SVM solvers are not sufficiently efficient for applications with a great deal of samples as well as a large number of features. In this paper, thus, we present NESVM, a fast gradient SVM solver that can optimize various SVM models, e.g., classical SVM, linear programming SVM and least square SVM. Compared against SVM-Perf \\cite{SVM_Perf}\\cite{PerfML} (its convergence rate in solving the dual SVM is upper bounded by $\\mathca"},"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":"1008.4000","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2010-08-24T10:02:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f4ff58e7e6d68d9bde230ac6ee2c1bb56c4b709651943d01672c5a8f17552037","abstract_canon_sha256":"d21775be9bb79fe4228736dfa479b9e7567a3d12ab20b455f29ebca50191483a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:00.917122Z","signature_b64":"+5QQGQIgf4wryjYPlkAvRdCjJsw+wH80xpFl3Iar4CWy2RFc+dhNipxlTa1wg7ikk9mg8ILRJso/1QjbqIRfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95fe4c83e7e64d9218f68041bb1ab92f061c183515fc762344af7653083e7dfc","last_reissued_at":"2026-05-18T04:12:00.916431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:00.916431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NESVM: a Fast Gradient Method for Support Vector Machines","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Tianyi Zhou, Xindong Wu","submitted_at":"2010-08-24T10:02:01Z","abstract_excerpt":"Support vector machines (SVMs) are invaluable tools for many practical applications in artificial intelligence, e.g., classification and event recognition. However, popular SVM solvers are not sufficiently efficient for applications with a great deal of samples as well as a large number of features. In this paper, thus, we present NESVM, a fast gradient SVM solver that can optimize various SVM models, e.g., classical SVM, linear programming SVM and least square SVM. Compared against SVM-Perf \\cite{SVM_Perf}\\cite{PerfML} (its convergence rate in solving the dual SVM is upper bounded by $\\mathca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4000","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.4000","created_at":"2026-05-18T04:12:00.916553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4000v1","created_at":"2026-05-18T04:12:00.916553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4000","created_at":"2026-05-18T04:12:00.916553+00:00"},{"alias_kind":"pith_short_12","alias_value":"SX7EZA7H4ZGZ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SX7EZA7H4ZGZEGHW","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SX7EZA7H","created_at":"2026-05-18T12:26:13.927090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4","json":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4.json","graph_json":"https://pith.science/api/pith-number/SX7EZA7H4ZGZEGHWQBA3WGVZF4/graph.json","events_json":"https://pith.science/api/pith-number/SX7EZA7H4ZGZEGHWQBA3WGVZF4/events.json","paper":"https://pith.science/paper/SX7EZA7H"},"agent_actions":{"view_html":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4","download_json":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4.json","view_paper":"https://pith.science/paper/SX7EZA7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4000&json=true","fetch_graph":"https://pith.science/api/pith-number/SX7EZA7H4ZGZEGHWQBA3WGVZF4/graph.json","fetch_events":"https://pith.science/api/pith-number/SX7EZA7H4ZGZEGHWQBA3WGVZF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/action/storage_attestation","attest_author":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/action/author_attestation","sign_citation":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/action/citation_signature","submit_replication":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/action/replication_record"}},"created_at":"2026-05-18T04:12:00.916553+00:00","updated_at":"2026-05-18T04:12:00.916553+00:00"}