{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SX7EZA7H4ZGZEGHWQBA3WGVZF4","short_pith_number":"pith:SX7EZA7H","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"},"canonical_sha256":"95fe4c83e7e64d9218f68041bb1ab92f061c183515fc762344af7653083e7dfc","source":{"kind":"arxiv","id":"1008.4000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4000","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4000v1","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4000","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"SX7EZA7H4ZGZ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SX7EZA7H4ZGZEGHW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SX7EZA7H","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SX7EZA7H4ZGZEGHWQBA3WGVZF4","target":"record","payload":{"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"},"canonical_sha256":"95fe4c83e7e64d9218f68041bb1ab92f061c183515fc762344af7653083e7dfc","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"},"source_kind":"arxiv","source_id":"1008.4000","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-18T04:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zYARjnbT0rnQ9dhh7ZBonK8v76iImvPBCrgQqvm1DURayVu22M0QvMlbZ4pRmMmxvt8og4KgAriDaSI6NHlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:43:10.398296Z"},"content_sha256":"7819c0845efbcb389d1743a7544aed765bf2cb1b5060aa2ca43f29258faf99c6","schema_version":"1.0","event_id":"sha256:7819c0845efbcb389d1743a7544aed765bf2cb1b5060aa2ca43f29258faf99c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SX7EZA7H4ZGZEGHWQBA3WGVZF4","target":"graph","payload":{"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"},"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-18T04:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2RCc+jBicrVxnuLZylno5FpciLSwD8s5+mbR/vnl9QuCeAQ3wbc+5i9zvTr3eGZ3VKUj7x77HgR8uESyCSqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:43:10.398850Z"},"content_sha256":"3bad513a37dc6d7e889e5508542479b15a9baeec9f3c5ee696c6a387ad0b9ffc","schema_version":"1.0","event_id":"sha256:3bad513a37dc6d7e889e5508542479b15a9baeec9f3c5ee696c6a387ad0b9ffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/bundle.json","state_url":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/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-06-01T05:43:10Z","links":{"resolver":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4","bundle":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/bundle.json","state":"https://pith.science/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SX7EZA7H4ZGZEGHWQBA3WGVZF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SX7EZA7H4ZGZEGHWQBA3WGVZF4","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":"d21775be9bb79fe4228736dfa479b9e7567a3d12ab20b455f29ebca50191483a","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2010-08-24T10:02:01Z","title_canon_sha256":"f4ff58e7e6d68d9bde230ac6ee2c1bb56c4b709651943d01672c5a8f17552037"},"schema_version":"1.0","source":{"id":"1008.4000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4000","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4000v1","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4000","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"SX7EZA7H4ZGZ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SX7EZA7H4ZGZEGHW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SX7EZA7H","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:3bad513a37dc6d7e889e5508542479b15a9baeec9f3c5ee696c6a387ad0b9ffc","target":"graph","created_at":"2026-05-18T04:12:00Z","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":"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","authors_text":"Dacheng Tao, Tianyi Zhou, Xindong Wu","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2010-08-24T10:02:01Z","title":"NESVM: a Fast Gradient Method for Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4000","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:7819c0845efbcb389d1743a7544aed765bf2cb1b5060aa2ca43f29258faf99c6","target":"record","created_at":"2026-05-18T04:12:00Z","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":"d21775be9bb79fe4228736dfa479b9e7567a3d12ab20b455f29ebca50191483a","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2010-08-24T10:02:01Z","title_canon_sha256":"f4ff58e7e6d68d9bde230ac6ee2c1bb56c4b709651943d01672c5a8f17552037"},"schema_version":"1.0","source":{"id":"1008.4000","kind":"arxiv","version":1}},"canonical_sha256":"95fe4c83e7e64d9218f68041bb1ab92f061c183515fc762344af7653083e7dfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95fe4c83e7e64d9218f68041bb1ab92f061c183515fc762344af7653083e7dfc","first_computed_at":"2026-05-18T04:12:00.916431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:00.916431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+5QQGQIgf4wryjYPlkAvRdCjJsw+wH80xpFl3Iar4CWy2RFc+dhNipxlTa1wg7ikk9mg8ILRJso/1QjbqIRfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:00.917122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7819c0845efbcb389d1743a7544aed765bf2cb1b5060aa2ca43f29258faf99c6","sha256:3bad513a37dc6d7e889e5508542479b15a9baeec9f3c5ee696c6a387ad0b9ffc"],"state_sha256":"21939461892e49967f97ad095a6d32a47097d237d158687a36f380335a635c64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7CV1WqmiYP7UJcqb2dsWeytBcdh1+lb778SH9c2E+iKWy2mBK62L62w6Vx4XdgCxLaIZTKlBxqKLBrXE4bjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:43:10.401638Z","bundle_sha256":"d69ec1ed44c71d5b608fcdda73f41929607607764358d0f8667ab98c42ae380b"}}